htypechk.pas 37 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011
  1. {
  2. $Id$
  3. Copyright (c) 1998-2000 by Florian Klaempfl
  4. This unit exports some help routines for the type checking
  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 htypechk;
  19. {$i defines.inc}
  20. interface
  21. uses
  22. tokens,
  23. node,
  24. symtype,symdef;
  25. type
  26. Ttok2nodeRec=record
  27. tok : ttoken;
  28. nod : tnodetype;
  29. op_overloading_supported : boolean;
  30. end;
  31. const
  32. tok2nodes=25;
  33. tok2node:array[1..tok2nodes] of ttok2noderec=(
  34. (tok:_PLUS ;nod:addn;op_overloading_supported:true), { binary overloading supported }
  35. (tok:_MINUS ;nod:subn;op_overloading_supported:true), { binary and unary overloading supported }
  36. (tok:_STAR ;nod:muln;op_overloading_supported:true), { binary overloading supported }
  37. (tok:_SLASH ;nod:slashn;op_overloading_supported:true), { binary overloading supported }
  38. (tok:_EQUAL ;nod:equaln;op_overloading_supported:true), { binary overloading supported }
  39. (tok:_GT ;nod:gtn;op_overloading_supported:true), { binary overloading supported }
  40. (tok:_LT ;nod:ltn;op_overloading_supported:true), { binary overloading supported }
  41. (tok:_GTE ;nod:gten;op_overloading_supported:true), { binary overloading supported }
  42. (tok:_LTE ;nod:lten;op_overloading_supported:true), { binary overloading supported }
  43. (tok:_SYMDIF ;nod:symdifn;op_overloading_supported:true), { binary overloading supported }
  44. (tok:_STARSTAR;nod:starstarn;op_overloading_supported:true), { binary overloading supported }
  45. (tok:_OP_AS ;nod:asn;op_overloading_supported:false), { binary overloading NOT supported }
  46. (tok:_OP_IN ;nod:inn;op_overloading_supported:false), { binary overloading NOT supported }
  47. (tok:_OP_IS ;nod:isn;op_overloading_supported:false), { binary overloading NOT supported }
  48. (tok:_OP_OR ;nod:orn;op_overloading_supported:true), { binary overloading supported }
  49. (tok:_OP_AND ;nod:andn;op_overloading_supported:true), { binary overloading supported }
  50. (tok:_OP_DIV ;nod:divn;op_overloading_supported:true), { binary overloading supported }
  51. (tok:_OP_NOT ;nod:notn;op_overloading_supported:true), { unary overloading supported }
  52. (tok:_OP_MOD ;nod:modn;op_overloading_supported:true), { binary overloading supported }
  53. (tok:_OP_SHL ;nod:shln;op_overloading_supported:true), { binary overloading supported }
  54. (tok:_OP_SHR ;nod:shrn;op_overloading_supported:true), { binary overloading supported }
  55. (tok:_OP_XOR ;nod:xorn;op_overloading_supported:true), { binary overloading supported }
  56. (tok:_ASSIGNMENT;nod:assignn;op_overloading_supported:true), { unary overloading supported }
  57. (tok:_CARET ;nod:caretn;op_overloading_supported:false), { binary overloading NOT supported }
  58. (tok:_UNEQUAL ;nod:unequaln;op_overloading_supported:false) { binary overloading NOT supported overload = instead }
  59. );
  60. const
  61. { firstcallparan without varspez we don't count the ref }
  62. {$ifdef extdebug}
  63. count_ref : boolean = true;
  64. {$endif def extdebug}
  65. get_para_resulttype : boolean = false;
  66. allow_array_constructor : boolean = false;
  67. { is overloading of this operator allowed for this
  68. binary operator }
  69. function isbinaryoperatoroverloadable(ld, rd,dd : tdef;
  70. treetyp : tnodetype) : boolean;
  71. { is overloading of this operator allowed for this
  72. unary operator }
  73. function isunaryoperatoroverloadable(rd,dd : tdef;
  74. treetyp : tnodetype) : boolean;
  75. { check operator args and result type }
  76. function isoperatoracceptable(pf : tprocdef; optoken : ttoken) : boolean;
  77. function isbinaryoverloaded(var t : tnode) : boolean;
  78. { Register Allocation }
  79. procedure make_not_regable(p : tnode);
  80. procedure calcregisters(p : tbinarynode;r32,fpu,mmx : word);
  81. { subroutine handling }
  82. procedure test_protected_sym(sym : tsym);
  83. procedure test_protected(p : tnode);
  84. function valid_for_formal_var(p : tnode) : boolean;
  85. function valid_for_formal_const(p : tnode) : boolean;
  86. function is_procsym_load(p:tnode):boolean;
  87. function is_procsym_call(p:tnode):boolean;
  88. procedure test_local_to_procvar(from_def:tprocvardef;to_def:tdef);
  89. function valid_for_assign(p:tnode;allowprop:boolean):boolean;
  90. { sets the callunique flag, if the node is a vecn, }
  91. { takes care of type casts etc. }
  92. procedure set_unique(p : tnode);
  93. { sets funcret_is_valid to true, if p contains a funcref node }
  94. procedure set_funcret_is_valid(p : tnode);
  95. {
  96. type
  97. tvarstaterequire = (vsr_can_be_undefined,vsr_must_be_valid,
  98. vsr_is_used_after,vsr_must_be_valid_and_is_used_after); }
  99. { sets varsym varstate field correctly }
  100. procedure unset_varstate(p : tnode);
  101. procedure set_varstate(p : tnode;must_be_valid : boolean);
  102. implementation
  103. uses
  104. globtype,systems,
  105. cutils,verbose,globals,
  106. symconst,symsym,symtable,
  107. types,cpubase,
  108. ncnv,nld,
  109. nmem,ncal,nmat,
  110. {$ifdef newcg}
  111. cgbase
  112. {$else}
  113. hcodegen
  114. {$endif}
  115. ;
  116. { ld is the left type definition
  117. rd the right type definition
  118. dd the result type definition or voiddef if unkown }
  119. function isbinaryoperatoroverloadable(ld, rd, dd : tdef;
  120. treetyp : tnodetype) : boolean;
  121. begin
  122. isbinaryoperatoroverloadable:=
  123. (treetyp=starstarn) or
  124. (ld.deftype=recorddef) or
  125. (rd.deftype=recorddef) or
  126. (ld.deftype=variantdef) or
  127. (rd.deftype=variantdef) or
  128. ((rd.deftype=pointerdef) and
  129. not(is_pchar(rd) and
  130. (is_chararray(ld) or
  131. (ld.deftype=stringdef) or
  132. (treetyp=addn))) and
  133. (not(ld.deftype in [pointerdef,objectdef,classrefdef,procvardef]) or
  134. not (treetyp in [equaln,unequaln,gtn,gten,ltn,lten,subn])
  135. ) and
  136. (not is_integer(ld) or not (treetyp in [addn,subn]))
  137. ) or
  138. ((ld.deftype=pointerdef) and
  139. not(is_pchar(ld) and
  140. (is_chararray(rd) or
  141. (rd.deftype=stringdef) or
  142. (treetyp=addn))) and
  143. (not(rd.deftype in [stringdef,pointerdef,objectdef,classrefdef,procvardef]) and
  144. ((not is_integer(rd) and (rd.deftype<>objectdef)
  145. and (rd.deftype<>classrefdef)) or
  146. not (treetyp in [equaln,unequaln,gtn,gten,ltn,lten,addn,subn])
  147. )
  148. )
  149. ) or
  150. { array def, but not mmx or chararray+[char,string,chararray] }
  151. ((ld.deftype=arraydef) and
  152. not((cs_mmx in aktlocalswitches) and
  153. is_mmx_able_array(ld)) and
  154. not(is_chararray(ld) and
  155. (is_char(rd) or
  156. is_pchar(rd) or
  157. { char array + int = pchar + int, fix for web bug 1377 (JM) }
  158. is_integer(rd) or
  159. (rd.deftype=stringdef) or
  160. is_chararray(rd)))
  161. ) or
  162. ((rd.deftype=arraydef) and
  163. not((cs_mmx in aktlocalswitches) and
  164. is_mmx_able_array(rd)) and
  165. not(is_chararray(rd) and
  166. (is_char(ld) or
  167. is_pchar(ld) or
  168. (ld.deftype=stringdef) or
  169. is_chararray(ld)))
  170. ) or
  171. { <> and = are defined for classes }
  172. (
  173. (ld.deftype=objectdef) and
  174. not((treetyp in [equaln,unequaln]) and is_class_or_interface(ld))
  175. ) or
  176. (
  177. (rd.deftype=objectdef) and
  178. not((treetyp in [equaln,unequaln]) and is_class_or_interface(rd))
  179. )
  180. or
  181. { allow other operators that + on strings }
  182. (
  183. (is_char(rd) or
  184. is_pchar(rd) or
  185. (rd.deftype=stringdef) or
  186. is_chararray(rd) or
  187. is_char(ld) or
  188. is_pchar(ld) or
  189. (ld.deftype=stringdef) or
  190. is_chararray(ld)
  191. ) and
  192. not(treetyp in [addn,equaln,unequaln,gtn,gten,ltn,lten]) and
  193. not(is_pchar(ld) and
  194. (is_integer(rd) or (rd.deftype=pointerdef)) and
  195. (treetyp=subn)
  196. )
  197. );
  198. end;
  199. function isunaryoperatoroverloadable(rd,dd : tdef;
  200. treetyp : tnodetype) : boolean;
  201. begin
  202. isunaryoperatoroverloadable:=false;
  203. { what assignment overloading should be allowed ?? }
  204. if (treetyp=assignn) then
  205. begin
  206. isunaryoperatoroverloadable:=true;
  207. { this already get tbs0261 to fail
  208. isunaryoperatoroverloadable:=not is_equal(rd,dd); PM }
  209. end
  210. { should we force that rd and dd are equal ?? }
  211. else if (treetyp=subn { unaryminusn }) then
  212. begin
  213. isunaryoperatoroverloadable:=
  214. not is_integer(rd) and not (rd.deftype=floatdef)
  215. {$ifdef SUPPORT_MMX}
  216. and not ((cs_mmx in aktlocalswitches) and
  217. is_mmx_able_array(rd))
  218. {$endif SUPPORT_MMX}
  219. ;
  220. end
  221. else if (treetyp=notn) then
  222. begin
  223. isunaryoperatoroverloadable:=not is_integer(rd) and not is_boolean(rd)
  224. {$ifdef SUPPORT_MMX}
  225. and not ((cs_mmx in aktlocalswitches) and
  226. is_mmx_able_array(rd))
  227. {$endif SUPPORT_MMX}
  228. ;
  229. end;
  230. end;
  231. function isoperatoracceptable(pf : tprocdef; optoken : ttoken) : boolean;
  232. var
  233. ld,rd,dd : tdef;
  234. i : longint;
  235. begin
  236. case pf.parast.symindex.count of
  237. 2 : begin
  238. isoperatoracceptable:=false;
  239. for i:=1 to tok2nodes do
  240. if tok2node[i].tok=optoken then
  241. begin
  242. ld:=tvarsym(pf.parast.symindex.first).vartype.def;
  243. rd:=tvarsym(pf.parast.symindex.first.indexnext).vartype.def;
  244. dd:=pf.rettype.def;
  245. isoperatoracceptable:=
  246. tok2node[i].op_overloading_supported and
  247. isbinaryoperatoroverloadable(ld,rd,dd,tok2node[i].nod);
  248. break;
  249. end;
  250. end;
  251. 1 : begin
  252. rd:=tvarsym(pf.parast.symindex.first).vartype.def;
  253. dd:=pf.rettype.def;
  254. for i:=1 to tok2nodes do
  255. if tok2node[i].tok=optoken then
  256. begin
  257. isoperatoracceptable:=
  258. tok2node[i].op_overloading_supported and
  259. isunaryoperatoroverloadable(rd,dd,tok2node[i].nod);
  260. break;
  261. end;
  262. end;
  263. else
  264. isoperatoracceptable:=false;
  265. end;
  266. end;
  267. function isbinaryoverloaded(var t : tnode) : boolean;
  268. var
  269. rd,ld : tdef;
  270. optoken : ttoken;
  271. ht : tnode;
  272. begin
  273. isbinaryoverloaded:=false;
  274. { overloaded operator ? }
  275. { load easier access variables }
  276. rd:=tbinarynode(t).right.resulttype.def;
  277. ld:=tbinarynode(t).left.resulttype.def;
  278. if isbinaryoperatoroverloadable(ld,rd,voidtype.def,t.nodetype) then
  279. begin
  280. isbinaryoverloaded:=true;
  281. {!!!!!!!!! handle paras }
  282. case t.nodetype of
  283. addn:
  284. optoken:=_PLUS;
  285. subn:
  286. optoken:=_MINUS;
  287. muln:
  288. optoken:=_STAR;
  289. starstarn:
  290. optoken:=_STARSTAR;
  291. slashn:
  292. optoken:=_SLASH;
  293. ltn:
  294. optoken:=tokens._lt;
  295. gtn:
  296. optoken:=tokens._gt;
  297. lten:
  298. optoken:=_lte;
  299. gten:
  300. optoken:=_gte;
  301. equaln,unequaln :
  302. optoken:=_EQUAL;
  303. symdifn :
  304. optoken:=_SYMDIF;
  305. modn :
  306. optoken:=_OP_MOD;
  307. orn :
  308. optoken:=_OP_OR;
  309. xorn :
  310. optoken:=_OP_XOR;
  311. andn :
  312. optoken:=_OP_AND;
  313. divn :
  314. optoken:=_OP_DIV;
  315. shln :
  316. optoken:=_OP_SHL;
  317. shrn :
  318. optoken:=_OP_SHR;
  319. else
  320. exit;
  321. end;
  322. { the nil as symtable signs firstcalln that this is
  323. an overloaded operator }
  324. ht:=ccallnode.create(nil,overloaded_operators[optoken],nil,nil);
  325. { we have to convert p^.left and p^.right into
  326. callparanodes }
  327. if tcallnode(ht).symtableprocentry=nil then
  328. begin
  329. CGMessage(parser_e_operator_not_overloaded);
  330. ht.free;
  331. isbinaryoverloaded:=false;
  332. exit;
  333. end;
  334. inc(tcallnode(ht).symtableprocentry.refs);
  335. { we need copies, because the originals will be destroyed when we give a }
  336. { changed node back to firstpass! (JM) }
  337. if assigned(tbinarynode(t).left) then
  338. if assigned(tbinarynode(t).right) then
  339. tcallnode(ht).left :=
  340. ccallparanode.create(tbinarynode(t).right.getcopy,
  341. ccallparanode.create(tbinarynode(t).left.getcopy,nil))
  342. else
  343. tcallnode(ht).left :=
  344. ccallparanode.create(nil,
  345. ccallparanode.create(tbinarynode(t).left.getcopy,nil))
  346. else if assigned(tbinarynode(t).right) then
  347. tcallnode(ht).left :=
  348. ccallparanode.create(tbinarynode(t).right.getcopy,
  349. ccallparanode.create(nil,nil));
  350. if t.nodetype=unequaln then
  351. ht:=cnotnode.create(ht);
  352. t:=ht;
  353. end;
  354. end;
  355. {****************************************************************************
  356. Register Calculation
  357. ****************************************************************************}
  358. { marks an lvalue as "unregable" }
  359. procedure make_not_regable(p : tnode);
  360. begin
  361. case p.nodetype of
  362. typeconvn :
  363. make_not_regable(ttypeconvnode(p).left);
  364. loadn :
  365. if tloadnode(p).symtableentry.typ=varsym then
  366. tvarsym(tloadnode(p).symtableentry).varoptions:=tvarsym(tloadnode(p).symtableentry).varoptions-[vo_regable,vo_fpuregable];
  367. end;
  368. end;
  369. { calculates the needed registers for a binary operator }
  370. procedure calcregisters(p : tbinarynode;r32,fpu,mmx : word);
  371. begin
  372. p.left_right_max;
  373. { Only when the difference between the left and right registers < the
  374. wanted registers allocate the amount of registers }
  375. if assigned(p.left) then
  376. begin
  377. if assigned(p.right) then
  378. begin
  379. if (abs(p.left.registers32-p.right.registers32)<r32) then
  380. inc(p.registers32,r32);
  381. if (abs(p.left.registersfpu-p.right.registersfpu)<fpu) then
  382. inc(p.registersfpu,fpu);
  383. {$ifdef SUPPORT_MMX}
  384. if (abs(p.left.registersmmx-p.right.registersmmx)<mmx) then
  385. inc(p.registersmmx,mmx);
  386. {$endif SUPPORT_MMX}
  387. { the following is a little bit guessing but I think }
  388. { it's the only way to solve same internalerrors: }
  389. { if the left and right node both uses registers }
  390. { and return a mem location, but the current node }
  391. { doesn't use an integer register we get probably }
  392. { trouble when restoring a node }
  393. if (p.left.registers32=p.right.registers32) and
  394. (p.registers32=p.left.registers32) and
  395. (p.registers32>0) and
  396. (p.left.location.loc in [LOC_REFERENCE,LOC_MEM]) and
  397. (p.right.location.loc in [LOC_REFERENCE,LOC_MEM]) then
  398. inc(p.registers32);
  399. end
  400. else
  401. begin
  402. if (p.left.registers32<r32) then
  403. inc(p.registers32,r32);
  404. if (p.left.registersfpu<fpu) then
  405. inc(p.registersfpu,fpu);
  406. {$ifdef SUPPORT_MMX}
  407. if (p.left.registersmmx<mmx) then
  408. inc(p.registersmmx,mmx);
  409. {$endif SUPPORT_MMX}
  410. end;
  411. end;
  412. { error CGMessage, if more than 8 floating point }
  413. { registers are needed }
  414. if p.registersfpu>maxfpuregs then
  415. CGMessage(cg_e_too_complex_expr);
  416. end;
  417. {****************************************************************************
  418. Subroutine Handling
  419. ****************************************************************************}
  420. { protected field handling
  421. protected field can not appear in
  422. var parameters of function !!
  423. this can only be done after we have determined the
  424. overloaded function
  425. this is the reason why it is not in the parser, PM }
  426. procedure test_protected_sym(sym : tsym);
  427. begin
  428. if (sp_protected in sym.symoptions) and
  429. (
  430. (
  431. (sym.owner.symtabletype=globalsymtable) and
  432. (sym.owner.unitid<>0)
  433. ) or
  434. (
  435. (sym.owner.symtabletype=objectsymtable) and
  436. (tobjectdef(sym.owner.defowner).owner.symtabletype=globalsymtable) and
  437. (tobjectdef(sym.owner.defowner).owner.unitid<>0)
  438. )
  439. ) then
  440. CGMessage(parser_e_cant_access_protected_member);
  441. end;
  442. procedure test_protected(p : tnode);
  443. begin
  444. case p.nodetype of
  445. loadn : test_protected_sym(tloadnode(p).symtableentry);
  446. typeconvn : test_protected(ttypeconvnode(p).left);
  447. derefn : test_protected(tderefnode(p).left);
  448. subscriptn : begin
  449. { test_protected(p.left);
  450. Is a field of a protected var
  451. also protected ??? PM }
  452. test_protected_sym(tsubscriptnode(p).vs);
  453. end;
  454. end;
  455. end;
  456. function valid_for_formal_var(p : tnode) : boolean;
  457. var
  458. v : boolean;
  459. begin
  460. case p.nodetype of
  461. loadn :
  462. v:=(tloadnode(p).symtableentry.typ in [typedconstsym,varsym]);
  463. typeconvn :
  464. v:=valid_for_formal_var(ttypeconvnode(p).left);
  465. derefn,
  466. subscriptn,
  467. vecn,
  468. funcretn,
  469. selfn :
  470. v:=true;
  471. calln : { procvars are callnodes first }
  472. v:=assigned(tcallnode(p).right) and not assigned(tcallnode(p).left);
  473. addrn :
  474. begin
  475. { addrn is not allowed as this generate a constant value,
  476. but a tp procvar are allowed (PFV) }
  477. if nf_procvarload in p.flags then
  478. v:=true
  479. else
  480. v:=false;
  481. end;
  482. else
  483. v:=false;
  484. end;
  485. valid_for_formal_var:=v;
  486. end;
  487. function valid_for_formal_const(p : tnode) : boolean;
  488. var
  489. v : boolean;
  490. begin
  491. { p must have been firstpass'd before }
  492. { accept about anything but not a statement ! }
  493. case p.nodetype of
  494. calln,
  495. statementn,
  496. addrn :
  497. begin
  498. { addrn is not allowed as this generate a constant value,
  499. but a tp procvar are allowed (PFV) }
  500. if nf_procvarload in p.flags then
  501. v:=true
  502. else
  503. v:=false;
  504. end;
  505. else
  506. v:=true;
  507. end;
  508. valid_for_formal_const:=v;
  509. end;
  510. function is_procsym_load(p:tnode):boolean;
  511. begin
  512. is_procsym_load:=((p.nodetype=loadn) and (tloadnode(p).symtableentry.typ=procsym)) or
  513. ((p.nodetype=addrn) and (taddrnode(p).left.nodetype=loadn)
  514. and (tloadnode(taddrnode(p).left).symtableentry.typ=procsym)) ;
  515. end;
  516. { change a proc call to a procload for assignment to a procvar }
  517. { this can only happen for proc/function without arguments }
  518. function is_procsym_call(p:tnode):boolean;
  519. begin
  520. is_procsym_call:=(p.nodetype=calln) and (tcallnode(p).left=nil) and
  521. (((tcallnode(p).symtableprocentry.typ=procsym) and (tcallnode(p).right=nil)) or
  522. (assigned(tcallnode(p).right) and (tcallnode(tcallnode(p).right).symtableprocentry.typ=varsym)));
  523. end;
  524. { local routines can't be assigned to procvars }
  525. procedure test_local_to_procvar(from_def:tprocvardef;to_def:tdef);
  526. begin
  527. if (from_def.symtablelevel>1) and (to_def.deftype=procvardef) then
  528. CGMessage(type_e_cannot_local_proc_to_procvar);
  529. end;
  530. function valid_for_assign(p:tnode;allowprop:boolean):boolean;
  531. var
  532. hp : tnode;
  533. gotwith,
  534. gotsubscript,
  535. gotpointer,
  536. gotclass,
  537. gotderef : boolean;
  538. begin
  539. valid_for_assign:=false;
  540. gotsubscript:=false;
  541. gotderef:=false;
  542. gotclass:=false;
  543. gotpointer:=false;
  544. gotwith:=false;
  545. hp:=p;
  546. if is_void(hp.resulttype.def) then
  547. begin
  548. CGMessagePos(hp.fileinfo,type_e_argument_cant_be_assigned);
  549. exit;
  550. end;
  551. while assigned(hp) do
  552. begin
  553. { property allowed? calln has a property check itself }
  554. if (not allowprop) and
  555. (nf_isproperty in hp.flags) and
  556. (hp.nodetype<>calln) then
  557. begin
  558. CGMessagePos(hp.fileinfo,type_e_argument_cant_be_assigned);
  559. exit;
  560. end;
  561. case hp.nodetype of
  562. derefn :
  563. begin
  564. gotderef:=true;
  565. hp:=tderefnode(hp).left;
  566. end;
  567. typeconvn :
  568. begin
  569. case hp.resulttype.def.deftype of
  570. pointerdef :
  571. gotpointer:=true;
  572. objectdef :
  573. gotclass:=is_class_or_interface(hp.resulttype.def);
  574. classrefdef :
  575. gotclass:=true;
  576. arraydef :
  577. begin
  578. { pointer -> array conversion is done then we need to see it
  579. as a deref, because a ^ is then not required anymore }
  580. if (ttypeconvnode(hp).left.resulttype.def.deftype=pointerdef) then
  581. gotderef:=true;
  582. end;
  583. end;
  584. hp:=ttypeconvnode(hp).left;
  585. end;
  586. vecn,
  587. asn :
  588. hp:=tunarynode(hp).left;
  589. subscriptn :
  590. begin
  591. gotsubscript:=true;
  592. { a class/interface access is an implicit }
  593. { dereferencing }
  594. hp:=tsubscriptnode(hp).left;
  595. if is_class_or_interface(hp.resulttype.def) then
  596. gotderef:=true;
  597. end;
  598. subn,
  599. addn :
  600. begin
  601. { Allow add/sub operators on a pointer, or an integer
  602. and a pointer typecast and deref has been found }
  603. if (hp.resulttype.def.deftype=pointerdef) or
  604. (is_integer(hp.resulttype.def) and gotpointer and gotderef) then
  605. valid_for_assign:=true
  606. else
  607. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  608. exit;
  609. end;
  610. addrn :
  611. begin
  612. if not(gotderef) and
  613. not(nf_procvarload in hp.flags) then
  614. CGMessagePos(hp.fileinfo,type_e_no_assign_to_addr);
  615. exit;
  616. end;
  617. selfn,
  618. funcretn :
  619. begin
  620. valid_for_assign:=true;
  621. exit;
  622. end;
  623. calln :
  624. begin
  625. { check return type }
  626. case hp.resulttype.def.deftype of
  627. pointerdef :
  628. gotpointer:=true;
  629. objectdef :
  630. gotclass:=is_class_or_interface(hp.resulttype.def);
  631. recorddef, { handle record like class it needs a subscription }
  632. classrefdef :
  633. gotclass:=true;
  634. end;
  635. { 1. if it returns a pointer and we've found a deref,
  636. 2. if it returns a class or record and a subscription or with is found,
  637. 3. property is allowed }
  638. if (gotpointer and gotderef) or
  639. (gotclass and (gotsubscript or gotwith)) or
  640. ((nf_isproperty in hp.flags) and allowprop) then
  641. valid_for_assign:=true
  642. else
  643. CGMessagePos(hp.fileinfo,type_e_argument_cant_be_assigned);
  644. exit;
  645. end;
  646. loadn :
  647. begin
  648. case tloadnode(hp).symtableentry.typ of
  649. absolutesym,
  650. varsym :
  651. begin
  652. if (tvarsym(tloadnode(hp).symtableentry).varspez=vs_const) then
  653. begin
  654. { allow p^:= constructions with p is const parameter }
  655. if gotderef then
  656. valid_for_assign:=true
  657. else
  658. CGMessagePos(tloadnode(hp).fileinfo,type_e_no_assign_to_const);
  659. exit;
  660. end;
  661. { Are we at a with symtable, then we need to process the
  662. withrefnode also to check for maybe a const load }
  663. if (tloadnode(hp).symtable.symtabletype=withsymtable) then
  664. begin
  665. { continue with processing the withref node }
  666. hp:=tnode(twithsymtable(tloadnode(hp).symtable).withrefnode);
  667. gotwith:=true;
  668. end
  669. else
  670. begin
  671. { set the assigned flag for varsyms }
  672. if (tvarsym(tloadnode(hp).symtableentry).varstate=vs_declared) then
  673. tvarsym(tloadnode(hp).symtableentry).varstate:=vs_assigned;
  674. valid_for_assign:=true;
  675. exit;
  676. end;
  677. end;
  678. funcretsym,
  679. typedconstsym :
  680. begin
  681. valid_for_assign:=true;
  682. exit;
  683. end;
  684. end;
  685. end;
  686. else
  687. begin
  688. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  689. exit;
  690. end;
  691. end;
  692. end;
  693. end;
  694. procedure set_varstate(p : tnode;must_be_valid : boolean);
  695. var
  696. hsym : tvarsym;
  697. begin
  698. while assigned(p) do
  699. begin
  700. if (nf_varstateset in p.flags) then
  701. exit;
  702. include(p.flags,nf_varstateset);
  703. case p.nodetype of
  704. typeconvn :
  705. begin
  706. case ttypeconvnode(p).convtype of
  707. tc_cchar_2_pchar,
  708. tc_cstring_2_pchar,
  709. tc_array_2_pointer :
  710. must_be_valid:=false;
  711. tc_pchar_2_string,
  712. tc_pointer_2_array :
  713. must_be_valid:=true;
  714. end;
  715. p:=tunarynode(p).left;
  716. end;
  717. subscriptn :
  718. p:=tunarynode(p).left;
  719. vecn:
  720. begin
  721. set_varstate(tbinarynode(p).right,true);
  722. if not(tunarynode(p).left.resulttype.def.deftype in [stringdef,arraydef]) then
  723. must_be_valid:=true;
  724. p:=tunarynode(p).left;
  725. end;
  726. { do not parse calln }
  727. calln :
  728. break;
  729. callparan :
  730. begin
  731. set_varstate(tbinarynode(p).right,must_be_valid);
  732. p:=tunarynode(p).left;
  733. end;
  734. loadn :
  735. begin
  736. if (tloadnode(p).symtableentry.typ=varsym) then
  737. begin
  738. hsym:=tvarsym(tloadnode(p).symtableentry);
  739. if must_be_valid and (nf_first in p.flags) then
  740. begin
  741. if (hsym.varstate=vs_declared_and_first_found) or
  742. (hsym.varstate=vs_set_but_first_not_passed) then
  743. begin
  744. if (assigned(hsym.owner) and
  745. assigned(aktprocsym) and
  746. (hsym.owner = aktprocsym.definition.localst)) then
  747. begin
  748. if tloadnode(p).symtable.symtabletype=localsymtable then
  749. CGMessage1(sym_n_uninitialized_local_variable,hsym.realname)
  750. else
  751. CGMessage1(sym_n_uninitialized_variable,hsym.realname);
  752. end;
  753. end;
  754. end;
  755. if (nf_first in p.flags) then
  756. begin
  757. if hsym.varstate=vs_declared_and_first_found then
  758. begin
  759. { this can only happen at left of an assignment, no ? PM }
  760. if (parsing_para_level=0) and not must_be_valid then
  761. hsym.varstate:=vs_assigned
  762. else
  763. hsym.varstate:=vs_used;
  764. end
  765. else
  766. if hsym.varstate=vs_set_but_first_not_passed then
  767. hsym.varstate:=vs_used;
  768. exclude(p.flags,nf_first);
  769. end
  770. else
  771. begin
  772. if (hsym.varstate=vs_assigned) and
  773. (must_be_valid or (parsing_para_level>0) or
  774. (p.resulttype.def.deftype=procvardef)) then
  775. hsym.varstate:=vs_used;
  776. if (hsym.varstate=vs_declared_and_first_found) and
  777. (must_be_valid or (parsing_para_level>0) or
  778. (p.resulttype.def.deftype=procvardef)) then
  779. hsym.varstate:=vs_set_but_first_not_passed;
  780. end;
  781. end;
  782. break;
  783. end;
  784. funcretn:
  785. begin
  786. { no claim if setting higher return value_str }
  787. if must_be_valid and
  788. (procinfo=pprocinfo(tfuncretnode(p).funcretprocinfo)) and
  789. ((procinfo^.funcret_state=vs_declared) or
  790. ((nf_is_first_funcret in p.flags) and
  791. (procinfo^.funcret_state=vs_declared_and_first_found))) then
  792. begin
  793. CGMessage(sym_w_function_result_not_set);
  794. { avoid multiple warnings }
  795. procinfo^.funcret_state:=vs_assigned;
  796. end;
  797. if (nf_is_first_funcret in p.flags) and not must_be_valid then
  798. pprocinfo(tfuncretnode(p).funcretprocinfo)^.funcret_state:=vs_assigned;
  799. break;
  800. end;
  801. else
  802. break;
  803. end;{case }
  804. end;
  805. end;
  806. procedure unset_varstate(p : tnode);
  807. begin
  808. while assigned(p) do
  809. begin
  810. exclude(p.flags,nf_varstateset);
  811. case p.nodetype of
  812. typeconvn,
  813. subscriptn,
  814. vecn :
  815. p:=tunarynode(p).left;
  816. else
  817. break;
  818. end;
  819. end;
  820. end;
  821. procedure set_unique(p : tnode);
  822. begin
  823. while assigned(p) do
  824. begin
  825. case p.nodetype of
  826. vecn:
  827. begin
  828. include(p.flags,nf_callunique);
  829. break;
  830. end;
  831. typeconvn,
  832. subscriptn,
  833. derefn:
  834. p:=tunarynode(p).left;
  835. else
  836. break;
  837. end;
  838. end;
  839. end;
  840. procedure set_funcret_is_valid(p:tnode);
  841. begin
  842. while assigned(p) do
  843. begin
  844. case p.nodetype of
  845. funcretn:
  846. begin
  847. if (nf_is_first_funcret in p.flags) then
  848. pprocinfo(tfuncretnode(p).funcretprocinfo)^.funcret_state:=vs_assigned;
  849. break;
  850. end;
  851. vecn,
  852. {derefn,}
  853. typeconvn,
  854. subscriptn:
  855. p:=tunarynode(p).left;
  856. else
  857. break;
  858. end;
  859. end;
  860. end;
  861. end.
  862. {
  863. $Log$
  864. Revision 1.27 2001-05-18 22:57:08 peter
  865. * replace constant by cpu dependent value (merged)
  866. Revision 1.26 2001/05/08 08:52:05 jonas
  867. * fix from Peter to avoid excessive number of warnings
  868. Revision 1.25 2001/04/22 22:46:49 florian
  869. * more variant support
  870. Revision 1.24 2001/04/13 01:22:08 peter
  871. * symtable change to classes
  872. * range check generation and errors fixed, make cycle DEBUG=1 works
  873. * memory leaks fixed
  874. Revision 1.23 2001/04/02 21:20:29 peter
  875. * resulttype rewrite
  876. Revision 1.22 2001/02/20 21:46:26 peter
  877. * don't allow assign to void type (merged)
  878. Revision 1.21 2001/02/04 11:12:17 jonas
  879. * fixed web bug 1377 & const pointer arithmtic
  880. Revision 1.20 2000/12/09 13:04:05 florian
  881. * web bug 1207 fixed: field and properties of const classes can be
  882. changed
  883. Revision 1.19 2000/11/29 00:30:31 florian
  884. * unused units removed from uses clause
  885. * some changes for widestrings
  886. Revision 1.18 2000/11/28 17:14:33 jonas
  887. * fixed crash when trying to use an overloaded operator which is nowhere
  888. defined
  889. Revision 1.17 2000/11/28 14:04:03 jonas
  890. * fixed operator overloading problems
  891. Revision 1.16 2000/11/13 11:30:54 florian
  892. * some bugs with interfaces and NIL fixed
  893. Revision 1.15 2000/11/12 22:20:37 peter
  894. * create generic toutputsection for binary writers
  895. Revision 1.14 2000/11/04 14:25:19 florian
  896. + merged Attila's changes for interfaces, not tested yet
  897. Revision 1.13 2000/10/31 22:02:47 peter
  898. * symtable splitted, no real code changes
  899. Revision 1.12 2000/10/14 10:14:47 peter
  900. * moehrendorf oct 2000 rewrite
  901. Revision 1.11 2000/10/01 19:48:23 peter
  902. * lot of compile updates for cg11
  903. Revision 1.10 2000/09/29 15:45:23 florian
  904. * make cycle fixed
  905. Revision 1.9 2000/09/28 19:49:51 florian
  906. *** empty log message ***
  907. Revision 1.8 2000/09/27 18:14:31 florian
  908. * fixed a lot of syntax errors in the n*.pas stuff
  909. Revision 1.7 2000/09/26 20:06:13 florian
  910. * hmm, still a lot of work to get things compilable
  911. Revision 1.6 2000/09/24 15:06:17 peter
  912. * use defines.inc
  913. Revision 1.5 2000/08/27 16:11:51 peter
  914. * moved some util functions from globals,cobjects to cutils
  915. * splitted files into finput,fmodule
  916. Revision 1.4 2000/08/16 18:33:53 peter
  917. * splitted namedobjectitem.next into indexnext and listnext so it
  918. can be used in both lists
  919. * don't allow "word = word" type definitions (merged)
  920. Revision 1.3 2000/08/07 11:31:04 jonas
  921. * fixed bug in type conversions between enum subranges (it didn't take
  922. the packenum directive into account)
  923. + define PACKENUMFIXED symbol in options.pas
  924. (merged from fixes branch)
  925. Revision 1.2 2000/07/13 11:32:41 michael
  926. + removed logs
  927. }