tcmem.pas 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. Type checking and register allocation for 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 tcmem;
  19. interface
  20. uses
  21. tree;
  22. procedure firstloadvmt(var p : ptree);
  23. procedure firsthnew(var p : ptree);
  24. procedure firstnew(var p : ptree);
  25. procedure firsthdispose(var p : ptree);
  26. procedure firstsimplenewdispose(var p : ptree);
  27. procedure firstaddr(var p : ptree);
  28. procedure firstdoubleaddr(var p : ptree);
  29. procedure firstderef(var p : ptree);
  30. procedure firstsubscript(var p : ptree);
  31. procedure firstvec(var p : ptree);
  32. procedure firstself(var p : ptree);
  33. procedure firstwith(var p : ptree);
  34. implementation
  35. uses
  36. globtype,systems,
  37. cobjects,verbose,globals,
  38. symtable,aasm,types,
  39. hcodegen,htypechk,pass_1
  40. {$ifdef i386}
  41. ,i386base
  42. {$endif}
  43. {$ifdef m68k}
  44. ,m68k
  45. {$endif}
  46. ;
  47. {*****************************************************************************
  48. FirstLoadVMT
  49. *****************************************************************************}
  50. procedure firstloadvmt(var p : ptree);
  51. begin
  52. p^.registers32:=1;
  53. p^.location.loc:=LOC_REGISTER;
  54. end;
  55. {*****************************************************************************
  56. FirstHNew
  57. *****************************************************************************}
  58. procedure firsthnew(var p : ptree);
  59. begin
  60. end;
  61. {*****************************************************************************
  62. FirstNewN
  63. *****************************************************************************}
  64. procedure firstnew(var p : ptree);
  65. begin
  66. { Standardeinleitung }
  67. if assigned(p^.left) then
  68. firstpass(p^.left);
  69. if codegenerror then
  70. exit;
  71. if assigned(p^.left) then
  72. begin
  73. p^.registers32:=p^.left^.registers32;
  74. p^.registersfpu:=p^.left^.registersfpu;
  75. {$ifdef SUPPORT_MMX}
  76. p^.registersmmx:=p^.left^.registersmmx;
  77. {$endif SUPPORT_MMX}
  78. end;
  79. { result type is already set }
  80. procinfo.flags:=procinfo.flags or pi_do_call;
  81. if assigned(p^.left) then
  82. p^.location.loc:=LOC_REGISTER
  83. else
  84. p^.location.loc:=LOC_REFERENCE;
  85. end;
  86. {*****************************************************************************
  87. FirstDispose
  88. *****************************************************************************}
  89. procedure firsthdispose(var p : ptree);
  90. begin
  91. firstpass(p^.left);
  92. if codegenerror then
  93. exit;
  94. p^.registers32:=p^.left^.registers32;
  95. p^.registersfpu:=p^.left^.registersfpu;
  96. {$ifdef SUPPORT_MMX}
  97. p^.registersmmx:=p^.left^.registersmmx;
  98. {$endif SUPPORT_MMX}
  99. if p^.registers32<1 then
  100. p^.registers32:=1;
  101. {
  102. if p^.left^.location.loc<>LOC_REFERENCE then
  103. CGMessage(cg_e_illegal_expression);
  104. }
  105. p^.location.loc:=LOC_REFERENCE;
  106. p^.resulttype:=ppointerdef(p^.left^.resulttype)^.definition;
  107. end;
  108. {*****************************************************************************
  109. FirstSimpleNewDispose
  110. *****************************************************************************}
  111. procedure firstsimplenewdispose(var p : ptree);
  112. begin
  113. { this cannot be in a register !! }
  114. make_not_regable(p^.left);
  115. firstpass(p^.left);
  116. if codegenerror then
  117. exit;
  118. { check the type }
  119. if (p^.left^.resulttype=nil) or (p^.left^.resulttype^.deftype<>pointerdef) then
  120. CGMessage(type_e_pointer_type_expected);
  121. if (p^.left^.location.loc<>LOC_REFERENCE) {and
  122. (p^.left^.location.loc<>LOC_CREGISTER)} then
  123. CGMessage(cg_e_illegal_expression);
  124. p^.registers32:=p^.left^.registers32;
  125. p^.registersfpu:=p^.left^.registersfpu;
  126. {$ifdef SUPPORT_MMX}
  127. p^.registersmmx:=p^.left^.registersmmx;
  128. {$endif SUPPORT_MMX}
  129. p^.resulttype:=voiddef;
  130. procinfo.flags:=procinfo.flags or pi_do_call;
  131. end;
  132. {*****************************************************************************
  133. FirstAddr
  134. *****************************************************************************}
  135. procedure firstaddr(var p : ptree);
  136. var
  137. hp : ptree;
  138. hp2 : pdefcoll;
  139. store_valid : boolean;
  140. hp3 : pabstractprocdef;
  141. begin
  142. make_not_regable(p^.left);
  143. if not(assigned(p^.resulttype)) then
  144. begin
  145. { proc/procvar 2 procvar ? }
  146. if p^.left^.treetype=calln then
  147. begin
  148. { it could also be a procvar, not only pprocsym ! }
  149. if p^.left^.symtableprocentry^.typ=varsym then
  150. hp:=genloadnode(pvarsym(p^.left^.symtableentry),p^.left^.symtableproc)
  151. else
  152. begin
  153. { generate a methodcallnode or proccallnode }
  154. if (p^.left^.symtableprocentry^.owner^.symtabletype=objectsymtable) and
  155. (pobjectdef(p^.left^.symtableprocentry^.owner^.defowner)^.isclass) then
  156. begin
  157. hp:=genloadmethodcallnode(pprocsym(p^.left^.symtableprocentry),p^.left^.symtableproc,
  158. getcopy(p^.left^.methodpointer));
  159. disposetree(p);
  160. firstpass(hp);
  161. p:=hp;
  162. exit;
  163. end
  164. else
  165. hp:=genloadcallnode(pprocsym(p^.left^.symtableprocentry),p^.left^.symtableproc);
  166. end;
  167. { result is a procedure variable }
  168. { No, to be TP compatible, you must return a pointer to
  169. the procedure that is stored in the procvar.}
  170. if not(m_tp_procvar in aktmodeswitches) then
  171. begin
  172. p^.resulttype:=new(pprocvardef,init);
  173. { it could also be a procvar, not only pprocsym ! }
  174. if p^.left^.symtableprocentry^.typ=varsym then
  175. hp3:=pabstractprocdef(pvarsym(p^.left^.symtableentry)^.definition)
  176. else
  177. hp3:=pabstractprocdef(pprocsym(p^.left^.symtableprocentry)^.definition);
  178. pprocvardef(p^.resulttype)^.options:=hp3^.options;
  179. pprocvardef(p^.resulttype)^.retdef:=hp3^.retdef;
  180. { method ? then set the methodpointer flag }
  181. if (hp3^.owner^.symtabletype=objectsymtable) and
  182. (pobjectdef(hp3^.owner^.defowner)^.isclass) then
  183. pprocvardef(p^.resulttype)^.options:=pprocvardef(p^.resulttype)^.options or pomethodpointer;
  184. hp2:=hp3^.para1;
  185. while assigned(hp2) do
  186. begin
  187. pprocvardef(p^.resulttype)^.concatdef(hp2^.data,hp2^.paratyp);
  188. hp2:=hp2^.next;
  189. end;
  190. end
  191. else
  192. p^.resulttype:=voidpointerdef;
  193. disposetree(p^.left);
  194. p^.left:=hp;
  195. end
  196. else
  197. begin
  198. { what are we getting the address from an absolute sym? }
  199. hp:=p^.left;
  200. while assigned(hp) and (hp^.treetype in [vecn,subscriptn]) do
  201. hp:=hp^.left;
  202. if assigned(hp) and (hp^.treetype=loadn) and
  203. ((hp^.symtableentry^.typ=absolutesym) and
  204. pabsolutesym(hp^.symtableentry)^.absseg) then
  205. begin
  206. if not(cs_typed_addresses in aktlocalswitches) then
  207. p^.resulttype:=voidfarpointerdef
  208. else
  209. p^.resulttype:=new(ppointerdef,initfar(p^.left^.resulttype));
  210. end
  211. else
  212. begin
  213. if not(cs_typed_addresses in aktlocalswitches) then
  214. p^.resulttype:=voidpointerdef
  215. else
  216. p^.resulttype:=new(ppointerdef,init(p^.left^.resulttype));
  217. end;
  218. end;
  219. end;
  220. store_valid:=must_be_valid;
  221. must_be_valid:=false;
  222. firstpass(p^.left);
  223. must_be_valid:=store_valid;
  224. if codegenerror then
  225. exit;
  226. { don't allow constants }
  227. if is_constnode(p^.left) then
  228. begin
  229. aktfilepos:=p^.left^.fileinfo;
  230. CGMessage(type_e_no_addr_of_constant);
  231. end
  232. else
  233. begin
  234. { we should allow loc_mem for @string }
  235. if not(p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE]) then
  236. begin
  237. aktfilepos:=p^.left^.fileinfo;
  238. CGMessage(cg_e_illegal_expression);
  239. end;
  240. end;
  241. p^.registers32:=p^.left^.registers32;
  242. p^.registersfpu:=p^.left^.registersfpu;
  243. {$ifdef SUPPORT_MMX}
  244. p^.registersmmx:=p^.left^.registersmmx;
  245. {$endif SUPPORT_MMX}
  246. if p^.registers32<1 then
  247. p^.registers32:=1;
  248. p^.location.loc:=LOC_REGISTER;
  249. end;
  250. {*****************************************************************************
  251. FirstDoubleAddr
  252. *****************************************************************************}
  253. procedure firstdoubleaddr(var p : ptree);
  254. begin
  255. make_not_regable(p^.left);
  256. firstpass(p^.left);
  257. if p^.resulttype=nil then
  258. p^.resulttype:=voidpointerdef;
  259. if codegenerror then
  260. exit;
  261. if (p^.left^.resulttype^.deftype)<>procvardef then
  262. CGMessage(cg_e_illegal_expression);
  263. if (p^.left^.location.loc<>LOC_REFERENCE) then
  264. CGMessage(cg_e_illegal_expression);
  265. p^.registers32:=p^.left^.registers32;
  266. p^.registersfpu:=p^.left^.registersfpu;
  267. {$ifdef SUPPORT_MMX}
  268. p^.registersmmx:=p^.left^.registersmmx;
  269. {$endif SUPPORT_MMX}
  270. if p^.registers32<1 then
  271. p^.registers32:=1;
  272. p^.location.loc:=LOC_REGISTER;
  273. end;
  274. {*****************************************************************************
  275. FirstDeRef
  276. *****************************************************************************}
  277. procedure firstderef(var p : ptree);
  278. begin
  279. firstpass(p^.left);
  280. if codegenerror then
  281. begin
  282. p^.resulttype:=generrordef;
  283. exit;
  284. end;
  285. p^.registers32:=max(p^.left^.registers32,1);
  286. p^.registersfpu:=p^.left^.registersfpu;
  287. {$ifdef SUPPORT_MMX}
  288. p^.registersmmx:=p^.left^.registersmmx;
  289. {$endif SUPPORT_MMX}
  290. if p^.left^.resulttype^.deftype<>pointerdef then
  291. CGMessage(cg_e_invalid_qualifier);
  292. p^.resulttype:=ppointerdef(p^.left^.resulttype)^.definition;
  293. p^.location.loc:=LOC_REFERENCE;
  294. end;
  295. {*****************************************************************************
  296. FirstSubScript
  297. *****************************************************************************}
  298. procedure firstsubscript(var p : ptree);
  299. begin
  300. firstpass(p^.left);
  301. if codegenerror then
  302. begin
  303. p^.resulttype:=generrordef;
  304. exit;
  305. end;
  306. p^.resulttype:=p^.vs^.definition;
  307. { this must be done in the parser
  308. if count_ref and not must_be_valid then
  309. if (p^.vs^.properties and sp_protected)<>0 then
  310. CGMessage(parser_e_cant_write_protected_member);
  311. }
  312. p^.registers32:=p^.left^.registers32;
  313. p^.registersfpu:=p^.left^.registersfpu;
  314. {$ifdef SUPPORT_MMX}
  315. p^.registersmmx:=p^.left^.registersmmx;
  316. {$endif SUPPORT_MMX}
  317. { classes must be dereferenced implicit }
  318. if (p^.left^.resulttype^.deftype=objectdef) and
  319. pobjectdef(p^.left^.resulttype)^.isclass then
  320. begin
  321. if p^.registers32=0 then
  322. p^.registers32:=1;
  323. p^.location.loc:=LOC_REFERENCE;
  324. end
  325. else
  326. begin
  327. if (p^.left^.location.loc<>LOC_MEM) and
  328. (p^.left^.location.loc<>LOC_REFERENCE) then
  329. CGMessage(cg_e_illegal_expression);
  330. set_location(p^.location,p^.left^.location);
  331. end;
  332. end;
  333. {*****************************************************************************
  334. FirstVec
  335. *****************************************************************************}
  336. procedure firstvec(var p : ptree);
  337. var
  338. harr : pdef;
  339. ct : tconverttype;
  340. {$ifdef consteval}
  341. tcsym : ptypedconstsym;
  342. {$endif}
  343. begin
  344. firstpass(p^.left);
  345. firstpass(p^.right);
  346. if codegenerror then
  347. exit;
  348. { range check only for arrays }
  349. if (p^.left^.resulttype^.deftype=arraydef) then
  350. begin
  351. if (isconvertable(p^.right^.resulttype,parraydef(p^.left^.resulttype)^.rangedef,
  352. ct,ordconstn,false)=0) and
  353. not(is_equal(p^.right^.resulttype,parraydef(p^.left^.resulttype)^.rangedef)) then
  354. CGMessage(type_e_mismatch);
  355. end;
  356. { Never convert a boolean or a char !}
  357. { maybe type conversion }
  358. if (p^.right^.resulttype^.deftype<>enumdef) and
  359. not(is_char(p^.right^.resulttype)) and
  360. not(is_boolean(p^.right^.resulttype)) then
  361. begin
  362. p^.right:=gentypeconvnode(p^.right,s32bitdef);
  363. firstpass(p^.right);
  364. if codegenerror then
  365. exit;
  366. end;
  367. { determine return type }
  368. if not assigned(p^.resulttype) then
  369. if p^.left^.resulttype^.deftype=arraydef then
  370. p^.resulttype:=parraydef(p^.left^.resulttype)^.definition
  371. else if (p^.left^.resulttype^.deftype=pointerdef) then
  372. begin
  373. { convert pointer to array }
  374. harr:=new(parraydef,init(0,$7fffffff,s32bitdef));
  375. parraydef(harr)^.definition:=ppointerdef(p^.left^.resulttype)^.definition;
  376. p^.left:=gentypeconvnode(p^.left,harr);
  377. firstpass(p^.left);
  378. if codegenerror then
  379. exit;
  380. p^.resulttype:=parraydef(harr)^.definition
  381. end
  382. else if p^.left^.resulttype^.deftype=stringdef then
  383. begin
  384. { indexed access to strings }
  385. case pstringdef(p^.left^.resulttype)^.string_typ of
  386. {
  387. st_widestring : p^.resulttype:=cwchardef;
  388. }
  389. st_ansistring : p^.resulttype:=cchardef;
  390. st_longstring : p^.resulttype:=cchardef;
  391. st_shortstring : p^.resulttype:=cchardef;
  392. end;
  393. end
  394. else
  395. CGMessage(type_e_mismatch);
  396. { the register calculation is easy if a const index is used }
  397. if p^.right^.treetype=ordconstn then
  398. begin
  399. {$ifdef consteval}
  400. { constant evaluation }
  401. if (p^.left^.treetype=loadn) and
  402. (p^.left^.symtableentry^.typ=typedconstsym) then
  403. begin
  404. tcsym:=ptypedconstsym(p^.left^.symtableentry);
  405. if tcsym^.defintion^.typ=stringdef then
  406. begin
  407. end;
  408. end;
  409. {$endif}
  410. p^.registers32:=p^.left^.registers32;
  411. { for ansi/wide strings, we need at least one register }
  412. if is_ansistring(p^.left^.resulttype) or
  413. is_widestring(p^.left^.resulttype) then
  414. p^.registers32:=max(p^.registers32,1);
  415. end
  416. else
  417. begin
  418. { this rules are suboptimal, but they should give }
  419. { good results }
  420. p^.registers32:=max(p^.left^.registers32,p^.right^.registers32);
  421. { for ansi/wide strings, we need at least one register }
  422. if is_ansistring(p^.left^.resulttype) or
  423. is_widestring(p^.left^.resulttype) then
  424. p^.registers32:=max(p^.registers32,1);
  425. { need we an extra register when doing the restore ? }
  426. if (p^.left^.registers32<=p^.right^.registers32) and
  427. { only if the node needs less than 3 registers }
  428. { two for the right node and one for the }
  429. { left address }
  430. (p^.registers32<3) then
  431. inc(p^.registers32);
  432. { need we an extra register for the index ? }
  433. if (p^.right^.location.loc<>LOC_REGISTER)
  434. { only if the right node doesn't need a register }
  435. and (p^.right^.registers32<1) then
  436. inc(p^.registers32);
  437. { not correct, but what works better ?
  438. if p^.left^.registers32>0 then
  439. p^.registers32:=max(p^.registers32,2)
  440. else
  441. min. one register
  442. p^.registers32:=max(p^.registers32,1);
  443. }
  444. end;
  445. p^.registersfpu:=max(p^.left^.registersfpu,p^.right^.registersfpu);
  446. {$ifdef SUPPORT_MMX}
  447. p^.registersmmx:=max(p^.left^.registersmmx,p^.right^.registersmmx);
  448. {$endif SUPPORT_MMX}
  449. if p^.left^.location.loc in [LOC_CREGISTER,LOC_REFERENCE] then
  450. p^.location.loc:=LOC_REFERENCE
  451. else
  452. p^.location.loc:=LOC_MEM;
  453. end;
  454. {*****************************************************************************
  455. FirstSelf
  456. *****************************************************************************}
  457. procedure firstself(var p : ptree);
  458. begin
  459. if (p^.resulttype^.deftype=classrefdef) or
  460. ((p^.resulttype^.deftype=objectdef)
  461. and pobjectdef(p^.resulttype)^.isclass
  462. ) then
  463. p^.location.loc:=LOC_CREGISTER
  464. else
  465. p^.location.loc:=LOC_REFERENCE;
  466. end;
  467. {*****************************************************************************
  468. FirstWithN
  469. *****************************************************************************}
  470. procedure firstwith(var p : ptree);
  471. var
  472. symtable : pwithsymtable;
  473. i : longint;
  474. begin
  475. if assigned(p^.left) and assigned(p^.right) then
  476. begin
  477. firstpass(p^.left);
  478. if codegenerror then
  479. exit;
  480. symtable:=p^.withsymtable;
  481. for i:=1 to p^.tablecount do
  482. begin
  483. if (p^.left^.treetype=loadn) and
  484. (p^.left^.symtable=aktprocsym^.definition^.localst) then
  485. symtable^.direct_with:=true;
  486. symtable^.withnode:=p;
  487. symtable:=pwithsymtable(symtable^.next);
  488. end;
  489. firstpass(p^.right);
  490. if codegenerror then
  491. exit;
  492. left_right_max(p);
  493. p^.resulttype:=voiddef;
  494. end
  495. else
  496. begin
  497. { optimization }
  498. disposetree(p);
  499. p:=nil;
  500. end;
  501. end;
  502. end.
  503. {
  504. $Log$
  505. Revision 1.20 1999-07-05 20:25:41 peter
  506. * merged
  507. Revision 1.19 1999/07/05 16:24:17 peter
  508. * merged
  509. Revision 1.18.2.3 1999/07/05 20:06:47 peter
  510. * give error instead of warning for ln(0) and sqrt(0)
  511. Revision 1.18.2.2 1999/07/05 16:22:56 peter
  512. * error if @constant
  513. Revision 1.18.2.1 1999/06/28 00:33:53 pierre
  514. * better error position bug0269
  515. Revision 1.18 1999/06/03 09:34:12 peter
  516. * better methodpointer check for proc->procvar
  517. Revision 1.17 1999/05/27 19:45:24 peter
  518. * removed oldasm
  519. * plabel -> pasmlabel
  520. * -a switches to source writing automaticly
  521. * assembler readers OOPed
  522. * asmsymbol automaticly external
  523. * jumptables and other label fixes for asm readers
  524. Revision 1.16 1999/05/18 09:52:21 peter
  525. * procedure of object and addrn fixes
  526. Revision 1.15 1999/05/17 23:51:46 peter
  527. * with temp vars now use a reference with a persistant temp instead
  528. of setting datasize
  529. Revision 1.14 1999/05/01 13:24:57 peter
  530. * merged nasm compiler
  531. * old asm moved to oldasm/
  532. Revision 1.13 1999/04/26 18:30:05 peter
  533. * farpointerdef moved into pointerdef.is_far
  534. Revision 1.12 1999/03/02 18:24:24 peter
  535. * fixed overloading of array of char
  536. Revision 1.11 1999/02/22 02:15:54 peter
  537. * updates for ag386bin
  538. Revision 1.10 1999/02/04 11:44:47 florian
  539. * fixed indexed access of ansistrings to temp. ansistring, i.e.
  540. c:=(s1+s2)[i], the temp is now correctly remove and the generated
  541. code is also fixed
  542. Revision 1.9 1999/01/22 12:18:34 pierre
  543. * with bug introduced with DIRECTWITH removed
  544. Revision 1.8 1999/01/21 16:41:08 pierre
  545. * fix for constructor inside with statements
  546. Revision 1.7 1998/12/30 22:15:59 peter
  547. + farpointer type
  548. * absolutesym now also stores if its far
  549. Revision 1.6 1998/12/15 17:16:02 peter
  550. * fixed const s : ^string
  551. * first things for const pchar : @string[1]
  552. Revision 1.5 1998/12/11 00:03:57 peter
  553. + globtype,tokens,version unit splitted from globals
  554. Revision 1.4 1998/11/25 19:12:53 pierre
  555. * var:=new(pointer_type) support added
  556. Revision 1.3 1998/09/26 15:03:05 florian
  557. * small problems with DOM and excpetions fixed (code generation
  558. of raise was wrong and self was sometimes destroyed :()
  559. Revision 1.2 1998/09/24 23:49:24 peter
  560. + aktmodeswitches
  561. Revision 1.1 1998/09/23 20:42:24 peter
  562. * splitted pass_1
  563. }