cg386mem.pas 22 KB

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