cg386mem.pas 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636
  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. { we load the array reference to p^.location }
  278. { an ansistring needs to be dereferenced }
  279. if is_ansistring(p^.left^.resulttype) or
  280. is_widestring(p^.left^.resulttype) then
  281. begin
  282. reset_reference(p^.location.reference);
  283. p^.location.loc:=LOC_REFERENCE;
  284. del_reference(p^.left^.location.reference);
  285. p^.location.reference.base:=getregister32;
  286. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  287. newreference(p^.left^.location.reference),
  288. p^.location.reference.base)));
  289. if is_ansistring(p^.left^.resulttype) then
  290. begin
  291. { in ansistrings S[1] is pchar(S)[0] !! }
  292. dec(p^.location.reference.offset);
  293. { this is necessary for ansistrings with constant index }
  294. dec(p^.left^.location.reference.offset);
  295. end
  296. else
  297. begin
  298. { in widestrings S[1] is pwchar(S)[0] !! }
  299. dec(p^.location.reference.offset,2);
  300. { this is necessary for ansistrings with constant index }
  301. dec(p^.left^.location.reference.offset,2);
  302. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,
  303. 2,p^.location.reference.base)));
  304. end;
  305. end
  306. else
  307. set_location(p^.location,p^.left^.location);
  308. { offset can only differ from 0 if arraydef }
  309. if p^.left^.resulttype^.deftype=arraydef then
  310. dec(p^.location.reference.offset,
  311. get_mul_size*parraydef(p^.left^.resulttype)^.lowrange);
  312. if p^.right^.treetype=ordconstn then
  313. begin
  314. { offset can only differ from 0 if arraydef }
  315. if (p^.left^.resulttype^.deftype=arraydef) then
  316. begin
  317. if not(is_open_array(p^.left^.resulttype)) then
  318. begin
  319. if (p^.right^.value>parraydef(p^.left^.resulttype)^.highrange) or
  320. (p^.right^.value<parraydef(p^.left^.resulttype)^.lowrange) then
  321. Message(parser_e_range_check_error);
  322. dec(p^.left^.location.reference.offset,
  323. get_mul_size*parraydef(p^.left^.resulttype)^.lowrange);
  324. end
  325. else
  326. begin
  327. { range checking for open arrays }
  328. end;
  329. end;
  330. inc(p^.left^.location.reference.offset,
  331. get_mul_size*p^.right^.value);
  332. if p^.memseg then
  333. p^.left^.location.reference.segment:=R_FS;
  334. p^.left^.resulttype:=p^.resulttype;
  335. disposetree(p^.right);
  336. _p:=p^.left;
  337. putnode(p);
  338. p:=_p;
  339. end
  340. else
  341. begin
  342. { quick hack, to overcome Delphi 2 }
  343. if (cs_maxoptimize in aktglobalswitches) and
  344. (p^.left^.resulttype^.deftype=arraydef) then
  345. begin
  346. extraoffset:=0;
  347. if (p^.right^.treetype=addn) then
  348. begin
  349. if p^.right^.right^.treetype=ordconstn then
  350. begin
  351. extraoffset:=p^.right^.right^.value;
  352. t:=p^.right^.left;
  353. putnode(p^.right);
  354. putnode(p^.right^.right);
  355. p^.right:=t
  356. end
  357. else if p^.right^.left^.treetype=ordconstn then
  358. begin
  359. extraoffset:=p^.right^.left^.value;
  360. t:=p^.right^.right;
  361. putnode(p^.right);
  362. putnode(p^.right^.left);
  363. p^.right:=t
  364. end;
  365. end
  366. else if (p^.right^.treetype=subn) then
  367. begin
  368. if p^.right^.right^.treetype=ordconstn then
  369. begin
  370. extraoffset:=p^.right^.right^.value;
  371. t:=p^.right^.left;
  372. putnode(p^.right);
  373. putnode(p^.right^.right);
  374. p^.right:=t
  375. end
  376. else if p^.right^.left^.treetype=ordconstn then
  377. begin
  378. extraoffset:=p^.right^.left^.value;
  379. t:=p^.right^.right;
  380. putnode(p^.right);
  381. putnode(p^.right^.left);
  382. p^.right:=t
  383. end;
  384. end;
  385. inc(p^.location.reference.offset,
  386. get_mul_size*extraoffset);
  387. end;
  388. { calculate from left to right }
  389. if (p^.location.loc<>LOC_REFERENCE) and
  390. (p^.location.loc<>LOC_MEM) then
  391. Message(cg_e_illegal_expression);
  392. pushed:=maybe_push(p^.right^.registers32,p);
  393. secondpass(p^.right);
  394. if pushed then restore(p);
  395. case p^.right^.location.loc of
  396. LOC_REGISTER:
  397. begin
  398. ind:=p^.right^.location.register;
  399. case p^.right^.resulttype^.size of
  400. 1:
  401. begin
  402. hr:=reg8toreg32(ind);
  403. emit_reg_reg(A_MOVZX,S_BL,ind,hr);
  404. ind:=hr;
  405. end;
  406. 2:
  407. begin
  408. hr:=reg16toreg32(ind);
  409. emit_reg_reg(A_MOVZX,S_WL,ind,hr);
  410. ind:=hr;
  411. end;
  412. end;
  413. end;
  414. LOC_CREGISTER:
  415. begin
  416. ind:=getregister32;
  417. case p^.right^.resulttype^.size of
  418. 1:
  419. emit_reg_reg(A_MOVZX,S_BL,p^.right^.location.register,ind);
  420. 2:
  421. emit_reg_reg(A_MOVZX,S_WL,p^.right^.location.register,ind);
  422. 4:
  423. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,ind);
  424. end;
  425. end;
  426. LOC_FLAGS:
  427. begin
  428. ind:=getregister32;
  429. exprasmlist^.concat(new(pai386,op_reg(flag_2_set[p^.right^.location.resflags],S_B,reg32toreg8(ind))));
  430. emit_reg_reg(A_MOVZX,S_BL,reg32toreg8(ind),ind);
  431. end
  432. else
  433. begin
  434. del_reference(p^.right^.location.reference);
  435. ind:=getregister32;
  436. { Booleans are stored in an 8 bit memory location, so
  437. the use of MOVL is not correct }
  438. case p^.right^.resulttype^.size of
  439. 1:
  440. tai:=new(pai386,op_ref_reg(A_MOVZX,S_BL,newreference(p^.right^.location.reference),ind));
  441. 2:
  442. tai:=new(Pai386,op_ref_reg(A_MOVZX,S_WL,newreference(p^.right^.location.reference),ind));
  443. 4:
  444. tai:=new(Pai386,op_ref_reg(A_MOV,S_L,newreference(p^.right^.location.reference),ind));
  445. end;
  446. exprasmlist^.concat(tai);
  447. end;
  448. end;
  449. { produce possible range check code: }
  450. if cs_check_range in aktlocalswitches then
  451. begin
  452. if p^.left^.resulttype^.deftype=arraydef then
  453. begin
  454. hp:=new_reference(R_NO,0);
  455. parraydef(p^.left^.resulttype)^.genrangecheck;
  456. hp^.symbol:=stringdup('R_'+tostr(parraydef(p^.left^.resulttype)^.rangenr));
  457. exprasmlist^.concat(new(pai386,op_reg_ref(A_BOUND,S_L,ind,hp)));
  458. end;
  459. end;
  460. if p^.location.reference.index=R_NO then
  461. begin
  462. p^.location.reference.index:=ind;
  463. calc_emit_mul;
  464. end
  465. else
  466. begin
  467. if p^.location.reference.base=R_NO then
  468. begin
  469. case p^.location.reference.scalefactor of
  470. 2 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,1,p^.location.reference.index)));
  471. 4 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,2,p^.location.reference.index)));
  472. 8 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,3,p^.location.reference.index)));
  473. end;
  474. calc_emit_mul;
  475. p^.location.reference.base:=p^.location.reference.index;
  476. p^.location.reference.index:=ind;
  477. end
  478. else
  479. begin
  480. exprasmlist^.concat(new(pai386,op_ref_reg(
  481. A_LEA,S_L,newreference(p^.location.reference),
  482. p^.location.reference.index)));
  483. ungetregister32(p^.location.reference.base);
  484. { the symbol offset is loaded, }
  485. { so release the symbol name and set symbol }
  486. { to nil }
  487. stringdispose(p^.location.reference.symbol);
  488. p^.location.reference.offset:=0;
  489. calc_emit_mul;
  490. p^.location.reference.base:=p^.location.reference.index;
  491. p^.location.reference.index:=ind;
  492. end;
  493. end;
  494. if p^.memseg then
  495. p^.location.reference.segment:=R_FS;
  496. end;
  497. end;
  498. {*****************************************************************************
  499. SecondSelfN
  500. *****************************************************************************}
  501. procedure secondselfn(var p : ptree);
  502. begin
  503. clear_reference(p^.location.reference);
  504. if (p^.resulttype^.deftype=classrefdef) or
  505. ((p^.resulttype^.deftype=objectdef)
  506. and pobjectdef(p^.resulttype)^.isclass
  507. ) then
  508. p^.location.register:=R_ESI
  509. else
  510. p^.location.reference.base:=R_ESI;
  511. end;
  512. {*****************************************************************************
  513. SecondWithN
  514. *****************************************************************************}
  515. procedure secondwith(var p : ptree);
  516. var
  517. ref : treference;
  518. symtable : psymtable;
  519. i : longint;
  520. begin
  521. if assigned(p^.left) then
  522. begin
  523. secondpass(p^.left);
  524. ref.symbol:=nil;
  525. gettempofsizereference(4,ref);
  526. exprasmlist^.concat(new(pai386,op_ref_reg(A_LEA,S_L,
  527. newreference(p^.left^.location.reference),R_EDI)));
  528. exprasmlist^.concat(new(pai386,op_reg_ref(A_MOV,S_L,
  529. R_EDI,newreference(ref))));
  530. del_reference(p^.left^.location.reference);
  531. { the offset relative to (%ebp) is only needed here! }
  532. symtable:=p^.withsymtable;
  533. for i:=1 to p^.tablecount do
  534. begin
  535. symtable^.datasize:=ref.offset;
  536. symtable:=symtable^.next;
  537. end;
  538. { p^.right can be optimize out !!! }
  539. if p^.right<>nil then
  540. secondpass(p^.right);
  541. { clear some stuff }
  542. ungetiftemp(ref);
  543. end;
  544. end;
  545. end.
  546. {
  547. $Log$
  548. Revision 1.6 1998-08-10 14:49:49 peter
  549. + localswitches, moduleswitches, globalswitches splitting
  550. Revision 1.5 1998/07/26 21:58:58 florian
  551. + better support for switch $H
  552. + index access to ansi strings added
  553. + assigment of data (records/arrays) containing ansi strings
  554. Revision 1.4 1998/07/24 22:16:55 florian
  555. * internal error 10 together with array access fixed. I hope
  556. that's the final fix.
  557. Revision 1.3 1998/06/25 08:48:09 florian
  558. * first version of rtti support
  559. Revision 1.2 1998/06/08 13:13:35 pierre
  560. + temporary variables now in temp_gen.pas unit
  561. because it is processor independent
  562. * mppc68k.bat modified to undefine i386 and support_mmx
  563. (which are defaults for i386)
  564. Revision 1.1 1998/06/05 17:44:13 peter
  565. * splitted cgi386
  566. }