cg386mem.pas 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764
  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,types,
  38. hcodegen,temp_gen,pass_2,
  39. i386,cgai386,tgeni386;
  40. {*****************************************************************************
  41. SecondLoadVMT
  42. *****************************************************************************}
  43. procedure secondloadvmt(var p : ptree);
  44. begin
  45. p^.location.register:=getregister32;
  46. exprasmlist^.concat(new(pai386,op_csymbol_reg(A_MOV,
  47. S_L,newcsymbol(pobjectdef(pclassrefdef(p^.resulttype)^.definition)^.vmt_mangledname,0),
  48. p^.location.register)));
  49. end;
  50. {*****************************************************************************
  51. SecondHNewN
  52. *****************************************************************************}
  53. procedure secondhnewn(var p : ptree);
  54. begin
  55. end;
  56. {*****************************************************************************
  57. SecondNewN
  58. *****************************************************************************}
  59. procedure secondnewn(var p : ptree);
  60. begin
  61. secondpass(p^.left);
  62. if codegenerror then
  63. exit;
  64. p^.location.register:=p^.left^.location.register;
  65. end;
  66. {*****************************************************************************
  67. SecondDisposeN
  68. *****************************************************************************}
  69. procedure secondhdisposen(var p : ptree);
  70. begin
  71. secondpass(p^.left);
  72. if codegenerror then
  73. exit;
  74. clear_reference(p^.location.reference);
  75. case p^.left^.location.loc of
  76. LOC_REGISTER,
  77. LOC_CREGISTER:
  78. begin
  79. p^.location.reference.index:=getregister32;
  80. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,S_L,
  81. p^.left^.location.register,
  82. p^.location.reference.index)));
  83. end;
  84. LOC_MEM,LOC_REFERENCE :
  85. begin
  86. del_reference(p^.left^.location.reference);
  87. p^.location.reference.index:=getregister32;
  88. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,newreference(p^.left^.location.reference),
  89. p^.location.reference.index)));
  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,$ff);
  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(pai386,op_reg(A_PUSH,S_L,
  110. p^.left^.location.register)));
  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. 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. new(r);
  141. reset_reference(r^);
  142. r^.symbol:=stringdup(lab2str(ppointerdef(p^.left^.resulttype)^.definition^.get_rtti_label));
  143. emitpushreferenceaddr(exprasmlist,r^);
  144. { push pointer adress }
  145. case p^.left^.location.loc of
  146. LOC_CREGISTER : exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,
  147. p^.left^.location.register)));
  148. LOC_REFERENCE:
  149. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  150. end;
  151. emitcall('FPC_INITIALIZE',true);
  152. end;
  153. end;
  154. end;
  155. popusedregisters(pushed);
  156. { may be load ESI }
  157. maybe_loadesi;
  158. end;
  159. {*****************************************************************************
  160. SecondAddr
  161. *****************************************************************************}
  162. procedure secondaddr(var p : ptree);
  163. begin
  164. secondpass(p^.left);
  165. p^.location.loc:=LOC_REGISTER;
  166. del_reference(p^.left^.location.reference);
  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=procvardef) then
  177. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  178. newreference(p^.left^.location.reference),
  179. p^.location.register)))
  180. else
  181. exprasmlist^.concat(new(pai386,op_ref_reg(A_LEA,S_L,
  182. newreference(p^.left^.location.reference),
  183. p^.location.register)));
  184. { for use of other segments }
  185. if p^.left^.location.reference.segment<>R_DEFAULT_SEG then
  186. p^.location.segment:=p^.left^.location.reference.segment;
  187. end;
  188. {*****************************************************************************
  189. SecondDoubleAddr
  190. *****************************************************************************}
  191. procedure seconddoubleaddr(var p : ptree);
  192. begin
  193. secondpass(p^.left);
  194. p^.location.loc:=LOC_REGISTER;
  195. del_reference(p^.left^.location.reference);
  196. p^.location.register:=getregister32;
  197. exprasmlist^.concat(new(pai386,op_ref_reg(A_LEA,S_L,
  198. newreference(p^.left^.location.reference),
  199. p^.location.register)));
  200. end;
  201. {*****************************************************************************
  202. SecondDeRef
  203. *****************************************************************************}
  204. procedure secondderef(var p : ptree);
  205. var
  206. hr : tregister;
  207. begin
  208. secondpass(p^.left);
  209. clear_reference(p^.location.reference);
  210. case p^.left^.location.loc of
  211. LOC_REGISTER:
  212. p^.location.reference.base:=p^.left^.location.register;
  213. LOC_CREGISTER:
  214. begin
  215. { ... and reserve one for the pointer }
  216. hr:=getregister32;
  217. emit_reg_reg(A_MOV,S_L,p^.left^.location.register,hr);
  218. p^.location.reference.base:=hr;
  219. end;
  220. else
  221. begin
  222. { free register }
  223. del_reference(p^.left^.location.reference);
  224. { ...and reserve one for the pointer }
  225. hr:=getregister32;
  226. exprasmlist^.concat(new(pai386,op_ref_reg(
  227. A_MOV,S_L,newreference(p^.left^.location.reference),
  228. hr)));
  229. p^.location.reference.base:=hr;
  230. end;
  231. end;
  232. end;
  233. {*****************************************************************************
  234. SecondSubScriptN
  235. *****************************************************************************}
  236. procedure secondsubscriptn(var p : ptree);
  237. var
  238. hr : tregister;
  239. begin
  240. secondpass(p^.left);
  241. if codegenerror then
  242. exit;
  243. { classes must be dereferenced implicit }
  244. if (p^.left^.resulttype^.deftype=objectdef) and
  245. pobjectdef(p^.left^.resulttype)^.isclass then
  246. begin
  247. clear_reference(p^.location.reference);
  248. case p^.left^.location.loc of
  249. LOC_REGISTER:
  250. p^.location.reference.base:=p^.left^.location.register;
  251. LOC_CREGISTER:
  252. begin
  253. { ... and reserve one for the pointer }
  254. hr:=getregister32;
  255. emit_reg_reg(A_MOV,S_L,p^.left^.location.register,hr);
  256. p^.location.reference.base:=hr;
  257. end;
  258. else
  259. begin
  260. { free register }
  261. del_reference(p^.left^.location.reference);
  262. { ... and reserve one for the pointer }
  263. hr:=getregister32;
  264. exprasmlist^.concat(new(pai386,op_ref_reg(
  265. A_MOV,S_L,newreference(p^.left^.location.reference),
  266. hr)));
  267. p^.location.reference.base:=hr;
  268. end;
  269. end;
  270. end
  271. else
  272. set_location(p^.location,p^.left^.location);
  273. inc(p^.location.reference.offset,p^.vs^.address);
  274. end;
  275. {*****************************************************************************
  276. SecondVecN
  277. *****************************************************************************}
  278. procedure secondvecn(var p : ptree);
  279. var
  280. is_pushed : boolean;
  281. ind,hr : tregister;
  282. _p : ptree;
  283. function get_mul_size:longint;
  284. begin
  285. if p^.memindex then
  286. get_mul_size:=1
  287. else
  288. get_mul_size:=p^.resulttype^.size;
  289. end;
  290. procedure calc_emit_mul;
  291. var
  292. l1,l2 : longint;
  293. begin
  294. l1:=get_mul_size;
  295. case l1 of
  296. 1,2,4,8 : p^.location.reference.scalefactor:=l1;
  297. else
  298. begin
  299. if ispowerof2(l1,l2) then
  300. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,l2,ind)))
  301. else
  302. exprasmlist^.concat(new(pai386,op_const_reg(A_IMUL,S_L,l1,ind)));
  303. end;
  304. end;
  305. end;
  306. var
  307. extraoffset : longint;
  308. t : ptree;
  309. hp : preference;
  310. tai : Pai386;
  311. pushed : tpushed;
  312. begin
  313. secondpass(p^.left);
  314. { we load the array reference to p^.location }
  315. { an ansistring needs to be dereferenced }
  316. if is_ansistring(p^.left^.resulttype) or
  317. is_widestring(p^.left^.resulttype) then
  318. begin
  319. reset_reference(p^.location.reference);
  320. p^.location.loc:=LOC_REFERENCE;
  321. if is_ansistring(p^.left^.resulttype) then
  322. begin
  323. if p^.callunique then
  324. begin
  325. pushusedregisters(pushed,$ff);
  326. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  327. emitcall('FPC_UNIQUE_ANSISTRING',true);
  328. maybe_loadesi;
  329. popusedregisters(pushed);
  330. end;
  331. end
  332. else
  333. begin
  334. if p^.callunique then
  335. begin
  336. pushusedregisters(pushed,$ff);
  337. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  338. emitcall('FPC_UNIQUE_WIDESTRING',true);
  339. maybe_loadesi;
  340. popusedregisters(pushed);
  341. end;
  342. end;
  343. del_reference(p^.left^.location.reference);
  344. p^.location.reference.base:=getregister32;
  345. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  346. newreference(p^.left^.location.reference),
  347. p^.location.reference.base)));
  348. if is_ansistring(p^.left^.resulttype) then
  349. { in ansistrings S[1] is pchar(S)[0] !! }
  350. dec(p^.location.reference.offset)
  351. else
  352. begin
  353. { in widestrings S[1] is pwchar(S)[0] !! }
  354. dec(p^.location.reference.offset,2);
  355. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,
  356. 1,p^.location.reference.base)));
  357. end;
  358. { we've also to keep left up-to-date, because it is used }
  359. { if a constant array index occurs, subject to change (FK) }
  360. set_location(p^.left^.location,p^.location);
  361. end
  362. else
  363. set_location(p^.location,p^.left^.location);
  364. { offset can only differ from 0 if arraydef }
  365. if p^.left^.resulttype^.deftype=arraydef then
  366. dec(p^.location.reference.offset,
  367. get_mul_size*parraydef(p^.left^.resulttype)^.lowrange);
  368. if p^.right^.treetype=ordconstn then
  369. begin
  370. { offset can only differ from 0 if arraydef }
  371. if (p^.left^.resulttype^.deftype=arraydef) then
  372. begin
  373. if not(is_open_array(p^.left^.resulttype)) then
  374. begin
  375. if (p^.right^.value>parraydef(p^.left^.resulttype)^.highrange) or
  376. (p^.right^.value<parraydef(p^.left^.resulttype)^.lowrange) then
  377. begin
  378. if (cs_check_range in aktlocalswitches) then
  379. CGMessage(parser_e_range_check_error)
  380. else
  381. CGMessage(parser_w_range_check_error);
  382. end;
  383. dec(p^.left^.location.reference.offset,
  384. get_mul_size*parraydef(p^.left^.resulttype)^.lowrange);
  385. end
  386. else
  387. begin
  388. { range checking for open arrays !!!! }
  389. end;
  390. end
  391. else if (p^.left^.resulttype^.deftype=stringdef) then
  392. begin
  393. if (p^.right^.value=0) and not(is_shortstring(p^.left^.resulttype)) then
  394. CGMessage(cg_e_can_access_element_zero);
  395. case pstringdef(p^.left^.resulttype)^.string_typ of
  396. st_ansistring:
  397. begin
  398. end;
  399. st_shortstring:
  400. begin
  401. end;
  402. st_longstring:
  403. begin
  404. end;
  405. st_widestring:
  406. begin
  407. end;
  408. end;
  409. end;
  410. inc(p^.left^.location.reference.offset,
  411. get_mul_size*p^.right^.value);
  412. if p^.memseg then
  413. p^.left^.location.reference.segment:=R_FS;
  414. p^.left^.resulttype:=p^.resulttype;
  415. disposetree(p^.right);
  416. _p:=p^.left;
  417. putnode(p);
  418. p:=_p;
  419. end
  420. else
  421. begin
  422. { quick hack, to overcome Delphi 2 }
  423. if (cs_regalloc in aktglobalswitches) and
  424. (p^.left^.resulttype^.deftype=arraydef) then
  425. begin
  426. extraoffset:=0;
  427. if (p^.right^.treetype=addn) then
  428. begin
  429. if p^.right^.right^.treetype=ordconstn then
  430. begin
  431. extraoffset:=p^.right^.right^.value;
  432. t:=p^.right^.left;
  433. putnode(p^.right);
  434. putnode(p^.right^.right);
  435. p^.right:=t
  436. end
  437. else if p^.right^.left^.treetype=ordconstn then
  438. begin
  439. extraoffset:=p^.right^.left^.value;
  440. t:=p^.right^.right;
  441. putnode(p^.right);
  442. putnode(p^.right^.left);
  443. p^.right:=t
  444. end;
  445. end
  446. else if (p^.right^.treetype=subn) then
  447. begin
  448. if p^.right^.right^.treetype=ordconstn then
  449. begin
  450. extraoffset:=p^.right^.right^.value;
  451. t:=p^.right^.left;
  452. putnode(p^.right);
  453. putnode(p^.right^.right);
  454. p^.right:=t
  455. end
  456. else if p^.right^.left^.treetype=ordconstn then
  457. begin
  458. extraoffset:=p^.right^.left^.value;
  459. t:=p^.right^.right;
  460. putnode(p^.right);
  461. putnode(p^.right^.left);
  462. p^.right:=t
  463. end;
  464. end;
  465. inc(p^.location.reference.offset,
  466. get_mul_size*extraoffset);
  467. end;
  468. { calculate from left to right }
  469. if (p^.location.loc<>LOC_REFERENCE) and
  470. (p^.location.loc<>LOC_MEM) then
  471. CGMessage(cg_e_illegal_expression);
  472. is_pushed:=maybe_push(p^.right^.registers32,p);
  473. secondpass(p^.right);
  474. if is_pushed then restore(p);
  475. case p^.right^.location.loc of
  476. LOC_REGISTER:
  477. begin
  478. ind:=p^.right^.location.register;
  479. case p^.right^.resulttype^.size of
  480. 1:
  481. begin
  482. hr:=reg8toreg32(ind);
  483. emit_reg_reg(A_MOVZX,S_BL,ind,hr);
  484. ind:=hr;
  485. end;
  486. 2:
  487. begin
  488. hr:=reg16toreg32(ind);
  489. emit_reg_reg(A_MOVZX,S_WL,ind,hr);
  490. ind:=hr;
  491. end;
  492. end;
  493. end;
  494. LOC_CREGISTER:
  495. begin
  496. ind:=getregister32;
  497. case p^.right^.resulttype^.size of
  498. 1:
  499. emit_reg_reg(A_MOVZX,S_BL,p^.right^.location.register,ind);
  500. 2:
  501. emit_reg_reg(A_MOVZX,S_WL,p^.right^.location.register,ind);
  502. 4:
  503. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,ind);
  504. end;
  505. end;
  506. LOC_FLAGS:
  507. begin
  508. ind:=getregister32;
  509. exprasmlist^.concat(new(pai386,op_reg(flag_2_set[p^.right^.location.resflags],S_B,reg32toreg8(ind))));
  510. emit_reg_reg(A_MOVZX,S_BL,reg32toreg8(ind),ind);
  511. end
  512. else
  513. begin
  514. del_reference(p^.right^.location.reference);
  515. ind:=getregister32;
  516. { Booleans are stored in an 8 bit memory location, so
  517. the use of MOVL is not correct }
  518. case p^.right^.resulttype^.size of
  519. 1:
  520. tai:=new(pai386,op_ref_reg(A_MOVZX,S_BL,newreference(p^.right^.location.reference),ind));
  521. 2:
  522. tai:=new(Pai386,op_ref_reg(A_MOVZX,S_WL,newreference(p^.right^.location.reference),ind));
  523. 4:
  524. tai:=new(Pai386,op_ref_reg(A_MOV,S_L,newreference(p^.right^.location.reference),ind));
  525. end;
  526. exprasmlist^.concat(tai);
  527. end;
  528. end;
  529. { produce possible range check code: }
  530. if cs_check_range in aktlocalswitches then
  531. begin
  532. if p^.left^.resulttype^.deftype=arraydef then
  533. begin
  534. hp:=new_reference(R_NO,0);
  535. parraydef(p^.left^.resulttype)^.genrangecheck;
  536. hp^.symbol:=stringdup(parraydef(p^.left^.resulttype)^.getrangecheckstring);
  537. exprasmlist^.concat(new(pai386,op_reg_ref(A_BOUND,S_L,ind,hp)));
  538. end;
  539. end;
  540. if p^.location.reference.index=R_NO then
  541. begin
  542. p^.location.reference.index:=ind;
  543. calc_emit_mul;
  544. end
  545. else
  546. begin
  547. if p^.location.reference.base=R_NO then
  548. begin
  549. case p^.location.reference.scalefactor of
  550. 2 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,1,p^.location.reference.index)));
  551. 4 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,2,p^.location.reference.index)));
  552. 8 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,3,p^.location.reference.index)));
  553. end;
  554. calc_emit_mul;
  555. p^.location.reference.base:=p^.location.reference.index;
  556. p^.location.reference.index:=ind;
  557. end
  558. else
  559. begin
  560. exprasmlist^.concat(new(pai386,op_ref_reg(
  561. A_LEA,S_L,newreference(p^.location.reference),
  562. p^.location.reference.index)));
  563. ungetregister32(p^.location.reference.base);
  564. { the symbol offset is loaded, }
  565. { so release the symbol name and set symbol }
  566. { to nil }
  567. stringdispose(p^.location.reference.symbol);
  568. p^.location.reference.offset:=0;
  569. calc_emit_mul;
  570. p^.location.reference.base:=p^.location.reference.index;
  571. p^.location.reference.index:=ind;
  572. end;
  573. end;
  574. if p^.memseg then
  575. p^.location.reference.segment:=R_FS;
  576. end;
  577. end;
  578. {*****************************************************************************
  579. SecondSelfN
  580. *****************************************************************************}
  581. procedure secondselfn(var p : ptree);
  582. begin
  583. clear_reference(p^.location.reference);
  584. if (p^.resulttype^.deftype=classrefdef) or
  585. ((p^.resulttype^.deftype=objectdef)
  586. and pobjectdef(p^.resulttype)^.isclass
  587. ) then
  588. p^.location.register:=R_ESI
  589. else
  590. p^.location.reference.base:=R_ESI;
  591. end;
  592. {*****************************************************************************
  593. SecondWithN
  594. *****************************************************************************}
  595. procedure secondwith(var p : ptree);
  596. var
  597. ref : treference;
  598. symtable : psymtable;
  599. i : longint;
  600. begin
  601. if assigned(p^.left) then
  602. begin
  603. secondpass(p^.left);
  604. ref.symbol:=nil;
  605. gettempofsizereference(4,ref);
  606. if (p^.left^.resulttype^.deftype=objectdef) and
  607. pobjectdef(p^.left^.resulttype)^.isclass then
  608. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  609. newreference(p^.left^.location.reference),R_EDI)))
  610. else
  611. exprasmlist^.concat(new(pai386,op_ref_reg(A_LEA,S_L,
  612. newreference(p^.left^.location.reference),R_EDI)));
  613. exprasmlist^.concat(new(pai386,op_reg_ref(A_MOV,S_L,
  614. R_EDI,newreference(ref))));
  615. del_reference(p^.left^.location.reference);
  616. { the offset relative to (%ebp) is only needed here! }
  617. symtable:=p^.withsymtable;
  618. for i:=1 to p^.tablecount do
  619. begin
  620. symtable^.datasize:=ref.offset;
  621. symtable:=symtable^.next;
  622. end;
  623. { p^.right can be optimize out !!! }
  624. if p^.right<>nil then
  625. secondpass(p^.right);
  626. { clear some stuff }
  627. ungetiftemp(ref);
  628. end;
  629. end;
  630. end.
  631. {
  632. $Log$
  633. Revision 1.16 1998-10-21 11:44:42 florian
  634. + check for access to index 0 of long/wide/ansi strings added,
  635. gives now an error
  636. * problem with access to contant index of ansistrings fixed
  637. Revision 1.15 1998/10/12 09:49:53 florian
  638. + support of <procedure var type>:=<pointer> in delphi mode added
  639. Revision 1.14 1998/10/02 07:20:37 florian
  640. * range checking in units doesn't work if the units are smartlinked, fixed
  641. Revision 1.13 1998/09/27 10:16:23 florian
  642. * type casts pchar<->ansistring fixed
  643. * ansistring[..] calls does now an unique call
  644. Revision 1.12 1998/09/23 15:46:36 florian
  645. * problem with with and classes fixed
  646. Revision 1.11 1998/09/17 09:42:18 peter
  647. + pass_2 for cg386
  648. * Message() -> CGMessage() for pass_1/pass_2
  649. Revision 1.10 1998/09/14 10:43:52 peter
  650. * all internal RTL functions start with FPC_
  651. Revision 1.9 1998/09/03 16:03:15 florian
  652. + rtti generation
  653. * init table generation changed
  654. Revision 1.8 1998/08/23 21:04:34 florian
  655. + rtti generation for classes added
  656. + new/dispose do now also a call to INITIALIZE/FINALIZE, if necessaray
  657. Revision 1.7 1998/08/20 11:27:40 michael
  658. * Applied Peters Fix
  659. Revision 1.6 1998/08/10 14:49:49 peter
  660. + localswitches, moduleswitches, globalswitches splitting
  661. Revision 1.5 1998/07/26 21:58:58 florian
  662. + better support for switch $H
  663. + index access to ansi strings added
  664. + assigment of data (records/arrays) containing ansi strings
  665. Revision 1.4 1998/07/24 22:16:55 florian
  666. * internal error 10 together with array access fixed. I hope
  667. that's the final fix.
  668. Revision 1.3 1998/06/25 08:48:09 florian
  669. * first version of rtti support
  670. Revision 1.2 1998/06/08 13:13:35 pierre
  671. + temporary variables now in temp_gen.pas unit
  672. because it is processor independent
  673. * mppc68k.bat modified to undefine i386 and support_mmx
  674. (which are defaults for i386)
  675. Revision 1.1 1998/06/05 17:44:13 peter
  676. * splitted cgi386
  677. }