tccal.pas 54 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260
  1. {
  2. $Id$
  3. Copyright (c) 1998-2000 by Florian Klaempfl
  4. Type checking and register allocation for call 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. {$ifdef FPC}
  19. {$goto on}
  20. {$endif FPC}
  21. unit tccal;
  22. interface
  23. uses
  24. symtable,tree;
  25. procedure gen_high_tree(p:ptree;openstring:boolean);
  26. procedure firstcallparan(var p : ptree;defcoll : pparaitem;do_count : boolean);
  27. procedure firstcalln(var p : ptree);
  28. procedure firstprocinline(var p : ptree);
  29. implementation
  30. uses
  31. globtype,systems,
  32. cobjects,verbose,globals,
  33. symconst,aasm,types,
  34. htypechk,pass_1,cpubase
  35. {$ifdef newcg}
  36. ,cgbase
  37. ,tgobj
  38. {$else newcg}
  39. ,hcodegen
  40. {$ifdef i386}
  41. ,tgeni386
  42. {$endif}
  43. {$ifdef m68k}
  44. ,tgen68k
  45. {$endif m68k}
  46. {$endif newcg}
  47. ;
  48. {*****************************************************************************
  49. FirstCallParaN
  50. *****************************************************************************}
  51. procedure gen_high_tree(p:ptree;openstring:boolean);
  52. var
  53. len : longint;
  54. st : psymtable;
  55. loadconst : boolean;
  56. begin
  57. if assigned(p^.hightree) then
  58. exit;
  59. len:=-1;
  60. loadconst:=true;
  61. case p^.left^.resulttype^.deftype of
  62. arraydef :
  63. begin
  64. if is_open_array(p^.left^.resulttype) or
  65. is_array_of_const(p^.left^.resulttype) then
  66. begin
  67. st:=p^.left^.symtable;
  68. getsymonlyin(st,'high'+pvarsym(p^.left^.symtableentry)^.name);
  69. p^.hightree:=genloadnode(pvarsym(srsym),st);
  70. loadconst:=false;
  71. end
  72. else
  73. begin
  74. { this is an empty constructor }
  75. len:=parraydef(p^.left^.resulttype)^.highrange-
  76. parraydef(p^.left^.resulttype)^.lowrange;
  77. end;
  78. end;
  79. stringdef :
  80. begin
  81. if openstring then
  82. begin
  83. if is_open_string(p^.left^.resulttype) then
  84. begin
  85. st:=p^.left^.symtable;
  86. getsymonlyin(st,'high'+pvarsym(p^.left^.symtableentry)^.name);
  87. p^.hightree:=genloadnode(pvarsym(srsym),st);
  88. loadconst:=false;
  89. end
  90. else
  91. len:=pstringdef(p^.left^.resulttype)^.len;
  92. end
  93. else
  94. { passing a string to an array of char }
  95. begin
  96. if (p^.left^.treetype=stringconstn) then
  97. begin
  98. len:=str_length(p^.left);
  99. if len>0 then
  100. dec(len);
  101. end
  102. else
  103. begin
  104. p^.hightree:=gennode(subn,geninlinenode(in_length_string,false,getcopy(p^.left)),
  105. genordinalconstnode(1,s32bitdef));
  106. firstpass(p^.hightree);
  107. p^.hightree:=gentypeconvnode(p^.hightree,s32bitdef);
  108. loadconst:=false;
  109. end;
  110. end;
  111. end;
  112. else
  113. len:=0;
  114. end;
  115. if loadconst then
  116. p^.hightree:=genordinalconstnode(len,s32bitdef);
  117. firstpass(p^.hightree);
  118. end;
  119. procedure firstcallparan(var p : ptree;defcoll : pparaitem;do_count : boolean);
  120. var
  121. old_get_para_resulttype : boolean;
  122. old_array_constructor : boolean;
  123. oldtype : pdef;
  124. {$ifdef extdebug}
  125. store_count_ref : boolean;
  126. {$endif def extdebug}
  127. {convtyp : tconverttype;}
  128. begin
  129. inc(parsing_para_level);
  130. {$ifdef extdebug}
  131. if do_count then
  132. begin
  133. store_count_ref:=count_ref;
  134. count_ref:=true;
  135. end;
  136. {$endif def extdebug}
  137. if assigned(p^.right) then
  138. begin
  139. if defcoll=nil then
  140. firstcallparan(p^.right,nil,do_count)
  141. else
  142. firstcallparan(p^.right,pparaitem(defcoll^.next),do_count);
  143. p^.registers32:=p^.right^.registers32;
  144. p^.registersfpu:=p^.right^.registersfpu;
  145. {$ifdef SUPPORT_MMX}
  146. p^.registersmmx:=p^.right^.registersmmx;
  147. {$endif}
  148. end;
  149. if defcoll=nil then
  150. begin
  151. old_array_constructor:=allow_array_constructor;
  152. old_get_para_resulttype:=get_para_resulttype;
  153. get_para_resulttype:=true;
  154. allow_array_constructor:=true;
  155. firstpass(p^.left);
  156. get_para_resulttype:=old_get_para_resulttype;
  157. allow_array_constructor:=old_array_constructor;
  158. if codegenerror then
  159. begin
  160. dec(parsing_para_level);
  161. exit;
  162. end;
  163. p^.resulttype:=p^.left^.resulttype;
  164. end
  165. { if we know the routine which is called, then the type }
  166. { conversions are inserted }
  167. else
  168. begin
  169. { Do we need arrayconstructor -> set conversion, then insert
  170. it here before the arrayconstructor node breaks the tree
  171. with its conversions of enum->ord }
  172. if (p^.left^.treetype=arrayconstructn) and
  173. (defcoll^.paratype.def^.deftype=setdef) then
  174. p^.left:=gentypeconvnode(p^.left,defcoll^.paratype.def);
  175. { set some settings needed for arrayconstructor }
  176. if is_array_constructor(p^.left^.resulttype) then
  177. begin
  178. if is_array_of_const(defcoll^.paratype.def) then
  179. begin
  180. if assigned(aktcallprocsym) and
  181. (pocall_cdecl in aktcallprocsym^.definition^.proccalloptions) and
  182. (po_external in aktcallprocsym^.definition^.procoptions) then
  183. p^.left^.cargs:=true;
  184. { force variant array }
  185. p^.left^.forcevaria:=true;
  186. end
  187. else
  188. begin
  189. p^.left^.novariaallowed:=true;
  190. p^.left^.constructdef:=parraydef(defcoll^.paratype.def)^.elementtype.def;
  191. end;
  192. end;
  193. if do_count then
  194. begin
  195. { not completly proper, but avoids some warnings }
  196. if (defcoll^.paratyp=vs_var) then
  197. set_funcret_is_valid(p^.left);
  198. { protected has nothing to do with read/write
  199. if (defcoll^.paratyp=vs_var) then
  200. test_protected(p^.left);
  201. }
  202. { set_varstate(p^.left,defcoll^.paratyp<>vs_var);
  203. must only be done after typeconv PM }
  204. { only process typeconvn and arrayconstructn, else it will
  205. break other trees }
  206. { But this is need to get correct varstate !! PM }
  207. old_array_constructor:=allow_array_constructor;
  208. old_get_para_resulttype:=get_para_resulttype;
  209. allow_array_constructor:=true;
  210. get_para_resulttype:=false;
  211. if (p^.left^.treetype in [arrayconstructn,typeconvn]) then
  212. firstpass(p^.left);
  213. if not assigned(p^.resulttype) then
  214. p^.resulttype:=p^.left^.resulttype;
  215. get_para_resulttype:=old_get_para_resulttype;
  216. allow_array_constructor:=old_array_constructor;
  217. end;
  218. { check if local proc/func is assigned to procvar }
  219. if p^.left^.resulttype^.deftype=procvardef then
  220. test_local_to_procvar(pprocvardef(p^.left^.resulttype),defcoll^.paratype.def);
  221. { property is not allowed as var parameter }
  222. if (defcoll^.paratyp in [vs_out,vs_var]) and
  223. (p^.left^.isproperty) then
  224. CGMessagePos(p^.left^.fileinfo,type_e_argument_cant_be_assigned);
  225. { generate the high() value tree }
  226. if push_high_param(defcoll^.paratype.def) then
  227. gen_high_tree(p,is_open_string(defcoll^.paratype.def));
  228. if not(is_shortstring(p^.left^.resulttype) and
  229. is_shortstring(defcoll^.paratype.def)) and
  230. (defcoll^.paratype.def^.deftype<>formaldef) then
  231. begin
  232. if (defcoll^.paratyp in [vs_var,vs_out]) and
  233. { allows conversion from word to integer and
  234. byte to shortint }
  235. (not(
  236. (p^.left^.resulttype^.deftype=orddef) and
  237. (defcoll^.paratype.def^.deftype=orddef) and
  238. (p^.left^.resulttype^.size=defcoll^.paratype.def^.size)
  239. ) and
  240. { an implicit pointer conversion is allowed }
  241. not(
  242. (p^.left^.resulttype^.deftype=pointerdef) and
  243. (defcoll^.paratype.def^.deftype=pointerdef)
  244. ) and
  245. { child classes can be also passed }
  246. not(
  247. (p^.left^.resulttype^.deftype=objectdef) and
  248. (defcoll^.paratype.def^.deftype=objectdef) and
  249. pobjectdef(p^.left^.resulttype)^.is_related(pobjectdef(defcoll^.paratype.def))
  250. ) and
  251. { passing a single element to a openarray of the same type }
  252. not(
  253. (is_open_array(defcoll^.paratype.def) and
  254. is_equal(parraydef(defcoll^.paratype.def)^.elementtype.def,p^.left^.resulttype))
  255. ) and
  256. { an implicit file conversion is also allowed }
  257. { from a typed file to an untyped one }
  258. not(
  259. (p^.left^.resulttype^.deftype=filedef) and
  260. (defcoll^.paratype.def^.deftype=filedef) and
  261. (pfiledef(defcoll^.paratype.def)^.filetyp = ft_untyped) and
  262. (pfiledef(p^.left^.resulttype)^.filetyp = ft_typed)
  263. ) and
  264. not(is_equal(p^.left^.resulttype,defcoll^.paratype.def))) then
  265. begin
  266. CGMessagePos2(p^.left^.fileinfo,parser_e_call_by_ref_without_typeconv,
  267. p^.left^.resulttype^.typename,defcoll^.paratype.def^.typename);
  268. end;
  269. { Process open parameters }
  270. if push_high_param(defcoll^.paratype.def) then
  271. begin
  272. { insert type conv but hold the ranges of the array }
  273. oldtype:=p^.left^.resulttype;
  274. p^.left:=gentypeconvnode(p^.left,defcoll^.paratype.def);
  275. firstpass(p^.left);
  276. p^.left^.resulttype:=oldtype;
  277. end
  278. else
  279. begin
  280. p^.left:=gentypeconvnode(p^.left,defcoll^.paratype.def);
  281. firstpass(p^.left);
  282. end;
  283. if codegenerror then
  284. begin
  285. dec(parsing_para_level);
  286. exit;
  287. end;
  288. end;
  289. { check var strings }
  290. if (cs_strict_var_strings in aktlocalswitches) and
  291. is_shortstring(p^.left^.resulttype) and
  292. is_shortstring(defcoll^.paratype.def) and
  293. (defcoll^.paratyp in [vs_out,vs_var]) and
  294. not(is_open_string(defcoll^.paratype.def)) and
  295. not(is_equal(p^.left^.resulttype,defcoll^.paratype.def)) then
  296. begin
  297. aktfilepos:=p^.left^.fileinfo;
  298. CGMessage(type_e_strict_var_string_violation);
  299. end;
  300. { Variablen for call by reference may not be copied }
  301. { into a register }
  302. { is this usefull here ? }
  303. { this was missing in formal parameter list }
  304. if (defcoll^.paratype.def=pdef(cformaldef)) then
  305. begin
  306. if defcoll^.paratyp=vs_var then
  307. begin
  308. if not valid_for_formal_var(p^.left) then
  309. begin
  310. aktfilepos:=p^.left^.fileinfo;
  311. CGMessage(parser_e_illegal_parameter_list);
  312. end;
  313. end;
  314. if defcoll^.paratyp=vs_const then
  315. begin
  316. if not valid_for_formal_const(p^.left) then
  317. begin
  318. aktfilepos:=p^.left^.fileinfo;
  319. CGMessage(parser_e_illegal_parameter_list);
  320. end;
  321. end;
  322. end;
  323. if defcoll^.paratyp in [vs_var,vs_const] then
  324. begin
  325. { Causes problems with const ansistrings if also }
  326. { done for vs_const (JM) }
  327. if defcoll^.paratyp = vs_var then
  328. set_unique(p^.left);
  329. make_not_regable(p^.left);
  330. end;
  331. { ansistrings out paramaters doesn't need to be }
  332. { unique, they are finalized }
  333. if defcoll^.paratyp=vs_out then
  334. make_not_regable(p^.left);
  335. if do_count then
  336. set_varstate(p^.left,defcoll^.paratyp <> vs_var);
  337. { must only be done after typeconv PM }
  338. p^.resulttype:=defcoll^.paratype.def;
  339. end;
  340. if p^.left^.registers32>p^.registers32 then
  341. p^.registers32:=p^.left^.registers32;
  342. if p^.left^.registersfpu>p^.registersfpu then
  343. p^.registersfpu:=p^.left^.registersfpu;
  344. {$ifdef SUPPORT_MMX}
  345. if p^.left^.registersmmx>p^.registersmmx then
  346. p^.registersmmx:=p^.left^.registersmmx;
  347. {$endif SUPPORT_MMX}
  348. dec(parsing_para_level);
  349. {$ifdef extdebug}
  350. if do_count then
  351. count_ref:=store_count_ref;
  352. {$endif def extdebug}
  353. end;
  354. {*****************************************************************************
  355. FirstCallN
  356. *****************************************************************************}
  357. procedure firstcalln(var p : ptree);
  358. type
  359. pprocdefcoll = ^tprocdefcoll;
  360. tprocdefcoll = record
  361. data : pprocdef;
  362. nextpara : pparaitem;
  363. firstpara : pparaitem;
  364. next : pprocdefcoll;
  365. end;
  366. var
  367. hp,procs,hp2 : pprocdefcoll;
  368. pd : pprocdef;
  369. oldcallprocsym : pprocsym;
  370. def_from,def_to,conv_to : pdef;
  371. hpt,pt,inlinecode : ptree;
  372. exactmatch,inlined : boolean;
  373. paralength,lastpara : longint;
  374. lastparatype : pdef;
  375. pdc : pparaitem;
  376. {$ifdef TEST_PROCSYMS}
  377. nextprocsym : pprocsym;
  378. symt : psymtable;
  379. {$endif TEST_PROCSYMS}
  380. { only Dummy }
  381. hcvt : tconverttype;
  382. {$ifdef m68k}
  383. regi : tregister;
  384. {$endif}
  385. method_must_be_valid : boolean;
  386. label
  387. errorexit;
  388. { check if the resulttype from tree p is equal with def, needed
  389. for stringconstn and formaldef }
  390. function is_equal(p:ptree;def:pdef) : boolean;
  391. begin
  392. { safety check }
  393. if not (assigned(def) or assigned(p^.resulttype)) then
  394. begin
  395. is_equal:=false;
  396. exit;
  397. end;
  398. { all types can be passed to a formaldef }
  399. is_equal:=(def^.deftype=formaldef) or
  400. (types.is_equal(p^.resulttype,def))
  401. { to support ansi/long/wide strings in a proper way }
  402. { string and string[10] are assumed as equal }
  403. { when searching the correct overloaded procedure }
  404. or
  405. (
  406. (def^.deftype=stringdef) and (p^.resulttype^.deftype=stringdef) and
  407. (pstringdef(def)^.string_typ=pstringdef(p^.resulttype)^.string_typ)
  408. )
  409. or
  410. (
  411. (p^.left^.treetype=stringconstn) and
  412. (is_ansistring(p^.resulttype) and is_pchar(def))
  413. )
  414. or
  415. (
  416. (p^.left^.treetype=ordconstn) and
  417. (is_char(p^.resulttype) and (is_shortstring(def) or is_ansistring(def)))
  418. )
  419. { set can also be a not yet converted array constructor }
  420. or
  421. (
  422. (def^.deftype=setdef) and (p^.resulttype^.deftype=arraydef) and
  423. (parraydef(p^.resulttype)^.IsConstructor) and not(parraydef(p^.resulttype)^.IsVariant)
  424. )
  425. { in tp7 mode proc -> procvar is allowed }
  426. or
  427. (
  428. (m_tp_procvar in aktmodeswitches) and
  429. (def^.deftype=procvardef) and (p^.left^.treetype=calln) and
  430. (proc_to_procvar_equal(pprocdef(p^.left^.procdefinition),pprocvardef(def)))
  431. )
  432. ;
  433. end;
  434. function is_in_limit(def_from,def_to : pdef) : boolean;
  435. begin
  436. is_in_limit:=(def_from^.deftype = orddef) and
  437. (def_to^.deftype = orddef) and
  438. (porddef(def_from)^.low>porddef(def_to)^.low) and
  439. (porddef(def_from)^.high<porddef(def_to)^.high);
  440. end;
  441. var
  442. is_const : boolean;
  443. i : longint;
  444. begin
  445. { release registers! }
  446. { if procdefinition<>nil then we called firstpass already }
  447. { it seems to be bad because of the registers }
  448. { at least we can avoid the overloaded search !! }
  449. procs:=nil;
  450. { made this global for disposing !! }
  451. oldcallprocsym:=aktcallprocsym;
  452. aktcallprocsym:=nil;
  453. inlined:=false;
  454. if assigned(p^.procdefinition) and
  455. (pocall_inline in p^.procdefinition^.proccalloptions) then
  456. begin
  457. inlinecode:=p^.right;
  458. if assigned(inlinecode) then
  459. begin
  460. inlined:=true;
  461. exclude(p^.procdefinition^.proccalloptions,pocall_inline);
  462. end;
  463. p^.right:=nil;
  464. end;
  465. if assigned(p^.procdefinition) and
  466. (po_containsself in p^.procdefinition^.procoptions) then
  467. message(cg_e_cannot_call_message_direct);
  468. { procedure variable ? }
  469. if assigned(p^.right) then
  470. begin
  471. { procedure does a call }
  472. procinfo^.flags:=procinfo^.flags or pi_do_call;
  473. {$ifndef newcg}
  474. { calc the correture value for the register }
  475. {$ifdef i386}
  476. incrementregisterpushed($ff);
  477. {$endif}
  478. {$ifdef m68k}
  479. for regi:=R_D0 to R_A6 do
  480. inc(reg_pushes[regi],t_times*2);
  481. {$endif}
  482. {$endif newcg}
  483. { calculate the type of the parameters }
  484. if assigned(p^.left) then
  485. begin
  486. firstcallparan(p^.left,nil,false);
  487. if codegenerror then
  488. goto errorexit;
  489. end;
  490. firstpass(p^.right);
  491. set_varstate(p^.right,true);
  492. { check the parameters }
  493. pdc:=pparaitem(pprocvardef(p^.right^.resulttype)^.para^.first);
  494. pt:=p^.left;
  495. while assigned(pdc) and assigned(pt) do
  496. begin
  497. pt:=pt^.right;
  498. pdc:=pparaitem(pdc^.next);
  499. end;
  500. if assigned(pt) or assigned(pdc) then
  501. begin
  502. if assigned(pt) then
  503. aktfilepos:=pt^.fileinfo;
  504. CGMessage(parser_e_illegal_parameter_list);
  505. end;
  506. { insert type conversions }
  507. if assigned(p^.left) then
  508. begin
  509. firstcallparan(p^.left,pparaitem(pprocvardef(p^.right^.resulttype)^.para^.first),true);
  510. if codegenerror then
  511. goto errorexit;
  512. end;
  513. p^.resulttype:=pprocvardef(p^.right^.resulttype)^.rettype.def;
  514. { this was missing, leads to a bug below if
  515. the procvar is a function }
  516. p^.procdefinition:=pabstractprocdef(p^.right^.resulttype);
  517. end
  518. else
  519. { not a procedure variable }
  520. begin
  521. { determine the type of the parameters }
  522. if assigned(p^.left) then
  523. begin
  524. firstcallparan(p^.left,nil,false);
  525. if codegenerror then
  526. goto errorexit;
  527. end;
  528. aktcallprocsym:=pprocsym(p^.symtableprocentry);
  529. { do we know the procedure to call ? }
  530. if not(assigned(p^.procdefinition)) then
  531. begin
  532. {$ifdef TEST_PROCSYMS}
  533. if (p^.unit_specific) or
  534. assigned(p^.methodpointer) then
  535. nextprocsym:=nil
  536. else while not assigned(procs) do
  537. begin
  538. symt:=p^.symtableproc;
  539. srsym:=nil;
  540. while assigned(symt^.next) and not assigned(srsym) do
  541. begin
  542. symt:=symt^.next;
  543. getsymonlyin(symt,actprocsym^.name);
  544. if assigned(srsym) then
  545. if srsym^.typ<>procsym then
  546. begin
  547. { reject all that is not a procedure }
  548. srsym:=nil;
  549. { don't search elsewhere }
  550. while assigned(symt^.next) do
  551. symt:=symt^.next;
  552. end;
  553. end;
  554. nextprocsym:=srsym;
  555. end;
  556. {$endif TEST_PROCSYMS}
  557. { determine length of parameter list }
  558. pt:=p^.left;
  559. paralength:=0;
  560. while assigned(pt) do
  561. begin
  562. inc(paralength);
  563. pt:=pt^.right;
  564. end;
  565. { link all procedures which have the same # of parameters }
  566. pd:=aktcallprocsym^.definition;
  567. while assigned(pd) do
  568. begin
  569. { only when the # of parameter are supported by the
  570. procedure }
  571. if (paralength>=pd^.minparacount) and (paralength<=pd^.maxparacount) then
  572. begin
  573. new(hp);
  574. hp^.data:=pd;
  575. hp^.next:=procs;
  576. hp^.firstpara:=pparaitem(pd^.para^.first);
  577. { if not all parameters are given, then skip the
  578. default parameters }
  579. for i:=1 to pd^.maxparacount-paralength do
  580. hp^.firstpara:=pparaitem(hp^.firstpara^.next);
  581. hp^.nextpara:=hp^.firstpara;
  582. procs:=hp;
  583. end;
  584. pd:=pd^.nextoverloaded;
  585. end;
  586. { no procedures found? then there is something wrong
  587. with the parameter size }
  588. if not assigned(procs) then
  589. begin
  590. { in tp mode we can try to convert to procvar if
  591. there are no parameters specified }
  592. if not(assigned(p^.left)) and
  593. (m_tp_procvar in aktmodeswitches) then
  594. begin
  595. if (p^.symtableprocentry^.owner^.symtabletype=objectsymtable) and
  596. (pobjectdef(p^.symtableprocentry^.owner^.defowner)^.is_class) then
  597. hpt:=genloadmethodcallnode(pprocsym(p^.symtableprocentry),p^.symtableproc,
  598. getcopy(p^.methodpointer))
  599. else
  600. hpt:=genloadcallnode(pprocsym(p^.symtableprocentry),p^.symtableproc);
  601. disposetree(p);
  602. firstpass(hpt);
  603. p:=hpt;
  604. end
  605. else
  606. begin
  607. if assigned(p^.left) then
  608. aktfilepos:=p^.left^.fileinfo;
  609. CGMessage(parser_e_wrong_parameter_size);
  610. aktcallprocsym^.write_parameter_lists;
  611. end;
  612. goto errorexit;
  613. end;
  614. { now we can compare parameter after parameter }
  615. pt:=p^.left;
  616. { we start with the last parameter }
  617. lastpara:=paralength+1;
  618. lastparatype:=nil;
  619. while assigned(pt) do
  620. begin
  621. dec(lastpara);
  622. { walk all procedures and determine how this parameter matches and set:
  623. 1. pt^.exact_match_found if one parameter has an exact match
  624. 2. exactmatch if an equal or exact match is found
  625. 3. para^.argconvtyp to exact,equal or convertable
  626. (when convertable then also convertlevel is set)
  627. 4. pt^.convlevel1found if there is a convertlevel=1
  628. 5. pt^.convlevel2found if there is a convertlevel=2
  629. }
  630. exactmatch:=false;
  631. hp:=procs;
  632. while assigned(hp) do
  633. begin
  634. if is_equal(pt,hp^.nextpara^.paratype.def) then
  635. begin
  636. if hp^.nextpara^.paratype.def=pt^.resulttype then
  637. begin
  638. pt^.exact_match_found:=true;
  639. hp^.nextpara^.argconvtyp:=act_exact;
  640. end
  641. else
  642. hp^.nextpara^.argconvtyp:=act_equal;
  643. exactmatch:=true;
  644. end
  645. else
  646. begin
  647. hp^.nextpara^.argconvtyp:=act_convertable;
  648. hp^.nextpara^.convertlevel:=isconvertable(pt^.resulttype,hp^.nextpara^.paratype.def,
  649. hcvt,pt^.left^.treetype,false);
  650. case hp^.nextpara^.convertlevel of
  651. 1 : pt^.convlevel1found:=true;
  652. 2 : pt^.convlevel2found:=true;
  653. end;
  654. end;
  655. hp:=hp^.next;
  656. end;
  657. { If there was an exactmatch then delete all convertables }
  658. if exactmatch then
  659. begin
  660. hp:=procs;
  661. procs:=nil;
  662. while assigned(hp) do
  663. begin
  664. hp2:=hp^.next;
  665. { keep if not convertable }
  666. if (hp^.nextpara^.argconvtyp<>act_convertable) then
  667. begin
  668. hp^.next:=procs;
  669. procs:=hp;
  670. end
  671. else
  672. dispose(hp);
  673. hp:=hp2;
  674. end;
  675. end
  676. else
  677. { No exact match was found, remove all procedures that are
  678. not convertable (convertlevel=0) }
  679. begin
  680. hp:=procs;
  681. procs:=nil;
  682. while assigned(hp) do
  683. begin
  684. hp2:=hp^.next;
  685. { keep if not convertable }
  686. if (hp^.nextpara^.convertlevel<>0) then
  687. begin
  688. hp^.next:=procs;
  689. procs:=hp;
  690. end
  691. else
  692. begin
  693. { save the type for nice error message }
  694. lastparatype:=hp^.nextpara^.paratype.def;
  695. dispose(hp);
  696. end;
  697. hp:=hp2;
  698. end;
  699. end;
  700. { update nextpara for all procedures }
  701. hp:=procs;
  702. while assigned(hp) do
  703. begin
  704. hp^.nextpara:=pparaitem(hp^.nextpara^.next);
  705. hp:=hp^.next;
  706. end;
  707. { load next parameter or quit loop if no procs left }
  708. if assigned(procs) then
  709. pt:=pt^.right
  710. else
  711. break;
  712. end;
  713. { All parameters are checked, check if there are any
  714. procedures left }
  715. if not assigned(procs) then
  716. begin
  717. { there is an error, must be wrong type, because
  718. wrong size is already checked (PFV) }
  719. if (not assigned(lastparatype)) or
  720. (not assigned(pt)) or
  721. (not assigned(pt^.resulttype)) then
  722. internalerror(39393)
  723. else
  724. begin
  725. aktfilepos:=pt^.fileinfo;
  726. CGMessage3(type_e_wrong_parameter_type,tostr(lastpara),
  727. pt^.resulttype^.typename,lastparatype^.typename);
  728. end;
  729. aktcallprocsym^.write_parameter_lists;
  730. goto errorexit;
  731. end;
  732. { if there are several choices left then for orddef }
  733. { if a type is totally included in the other }
  734. { we don't fear an overflow , }
  735. { so we can do as if it is an exact match }
  736. { this will convert integer to longint }
  737. { rather than to words }
  738. { conversion of byte to integer or longint }
  739. {would still not be solved }
  740. if assigned(procs) and assigned(procs^.next) then
  741. begin
  742. hp:=procs;
  743. while assigned(hp) do
  744. begin
  745. hp^.nextpara:=hp^.firstpara;
  746. hp:=hp^.next;
  747. end;
  748. pt:=p^.left;
  749. while assigned(pt) do
  750. begin
  751. { matches a parameter of one procedure exact ? }
  752. exactmatch:=false;
  753. def_from:=pt^.resulttype;
  754. hp:=procs;
  755. while assigned(hp) do
  756. begin
  757. if not is_equal(pt,hp^.nextpara^.paratype.def) then
  758. begin
  759. def_to:=hp^.nextpara^.paratype.def;
  760. if ((def_from^.deftype=orddef) and (def_to^.deftype=orddef)) and
  761. (is_in_limit(def_from,def_to) or
  762. ((hp^.nextpara^.paratyp in [vs_var,vs_out]) and
  763. (def_from^.size=def_to^.size))) then
  764. begin
  765. exactmatch:=true;
  766. conv_to:=def_to;
  767. end;
  768. end;
  769. hp:=hp^.next;
  770. end;
  771. { .... if yes, del all the other procedures }
  772. if exactmatch then
  773. begin
  774. { the first .... }
  775. while (assigned(procs)) and not(is_in_limit(def_from,procs^.nextpara^.paratype.def)) do
  776. begin
  777. hp:=procs^.next;
  778. dispose(procs);
  779. procs:=hp;
  780. end;
  781. { and the others }
  782. hp:=procs;
  783. while (assigned(hp)) and assigned(hp^.next) do
  784. begin
  785. if not(is_in_limit(def_from,hp^.next^.nextpara^.paratype.def)) then
  786. begin
  787. hp2:=hp^.next^.next;
  788. dispose(hp^.next);
  789. hp^.next:=hp2;
  790. end
  791. else
  792. begin
  793. def_to:=hp^.next^.nextpara^.paratype.def;
  794. if (conv_to^.size>def_to^.size) or
  795. ((porddef(conv_to)^.low<porddef(def_to)^.low) and
  796. (porddef(conv_to)^.high>porddef(def_to)^.high)) then
  797. begin
  798. hp2:=procs;
  799. procs:=hp;
  800. conv_to:=def_to;
  801. dispose(hp2);
  802. end
  803. else
  804. hp:=hp^.next;
  805. end;
  806. end;
  807. end;
  808. { update nextpara for all procedures }
  809. hp:=procs;
  810. while assigned(hp) do
  811. begin
  812. hp^.nextpara:=pparaitem(hp^.nextpara^.next);
  813. hp:=hp^.next;
  814. end;
  815. pt:=pt^.right;
  816. end;
  817. end;
  818. { let's try to eliminate equal if there is an exact match
  819. is there }
  820. if assigned(procs) and assigned(procs^.next) then
  821. begin
  822. { reset nextpara for all procs left }
  823. hp:=procs;
  824. while assigned(hp) do
  825. begin
  826. hp^.nextpara:=hp^.firstpara;
  827. hp:=hp^.next;
  828. end;
  829. pt:=p^.left;
  830. while assigned(pt) do
  831. begin
  832. if pt^.exact_match_found then
  833. begin
  834. hp:=procs;
  835. procs:=nil;
  836. while assigned(hp) do
  837. begin
  838. hp2:=hp^.next;
  839. { keep the exact matches, dispose the others }
  840. if (hp^.nextpara^.argconvtyp=act_exact) then
  841. begin
  842. hp^.next:=procs;
  843. procs:=hp;
  844. end
  845. else
  846. dispose(hp);
  847. hp:=hp2;
  848. end;
  849. end;
  850. { update nextpara for all procedures }
  851. hp:=procs;
  852. while assigned(hp) do
  853. begin
  854. hp^.nextpara:=pparaitem(hp^.nextpara^.next);
  855. hp:=hp^.next;
  856. end;
  857. pt:=pt^.right;
  858. end;
  859. end;
  860. { Check if there are convertlevel 1 and 2 differences
  861. left for the parameters, then discard all convertlevel
  862. 2 procedures. The value of convlevelXfound can still
  863. be used, because all convertables are still here or
  864. not }
  865. if assigned(procs) and assigned(procs^.next) then
  866. begin
  867. { reset nextpara for all procs left }
  868. hp:=procs;
  869. while assigned(hp) do
  870. begin
  871. hp^.nextpara:=hp^.firstpara;
  872. hp:=hp^.next;
  873. end;
  874. pt:=p^.left;
  875. while assigned(pt) do
  876. begin
  877. if pt^.convlevel1found and pt^.convlevel2found then
  878. begin
  879. hp:=procs;
  880. procs:=nil;
  881. while assigned(hp) do
  882. begin
  883. hp2:=hp^.next;
  884. { keep all not act_convertable and all convertlevels=1 }
  885. if (hp^.nextpara^.argconvtyp<>act_convertable) or
  886. (hp^.nextpara^.convertlevel=1) then
  887. begin
  888. hp^.next:=procs;
  889. procs:=hp;
  890. end
  891. else
  892. dispose(hp);
  893. hp:=hp2;
  894. end;
  895. end;
  896. { update nextpara for all procedures }
  897. hp:=procs;
  898. while assigned(hp) do
  899. begin
  900. hp^.nextpara:=pparaitem(hp^.nextpara^.next);
  901. hp:=hp^.next;
  902. end;
  903. pt:=pt^.right;
  904. end;
  905. end;
  906. if not(assigned(procs)) or assigned(procs^.next) then
  907. begin
  908. CGMessage(cg_e_cant_choose_overload_function);
  909. aktcallprocsym^.write_parameter_lists;
  910. goto errorexit;
  911. end;
  912. {$ifdef TEST_PROCSYMS}
  913. if (procs=nil) and assigned(nextprocsym) then
  914. begin
  915. p^.symtableprocentry:=nextprocsym;
  916. p^.symtableproc:=symt;
  917. end;
  918. end ; { of while assigned(p^.symtableprocentry) do }
  919. {$endif TEST_PROCSYMS}
  920. if make_ref then
  921. begin
  922. procs^.data^.lastref:=new(pref,init(procs^.data^.lastref,@p^.fileinfo));
  923. inc(procs^.data^.refcount);
  924. if procs^.data^.defref=nil then
  925. procs^.data^.defref:=procs^.data^.lastref;
  926. end;
  927. p^.procdefinition:=procs^.data;
  928. p^.resulttype:=procs^.data^.rettype.def;
  929. { big error for with statements
  930. p^.symtableproc:=p^.procdefinition^.owner;
  931. but neede for overloaded operators !! }
  932. if p^.symtableproc=nil then
  933. p^.symtableproc:=p^.procdefinition^.owner;
  934. p^.location.loc:=LOC_MEM;
  935. {$ifdef CHAINPROCSYMS}
  936. { object with method read;
  937. call to read(x) will be a usual procedure call }
  938. if assigned(p^.methodpointer) and
  939. (p^.procdefinition^._class=nil) then
  940. begin
  941. { not ok for extended }
  942. case p^.methodpointer^.treetype of
  943. typen,hnewn : fatalerror(no_para_match);
  944. end;
  945. disposetree(p^.methodpointer);
  946. p^.methodpointer:=nil;
  947. end;
  948. {$endif CHAINPROCSYMS}
  949. end; { end of procedure to call determination }
  950. is_const:=(pocall_internconst in p^.procdefinition^.proccalloptions) and
  951. ((block_type=bt_const) or
  952. (assigned(p^.left) and (p^.left^.left^.treetype in [realconstn,ordconstn])));
  953. { handle predefined procedures }
  954. if (pocall_internproc in p^.procdefinition^.proccalloptions) or is_const then
  955. begin
  956. if assigned(p^.left) then
  957. begin
  958. { settextbuf needs two args }
  959. if assigned(p^.left^.right) then
  960. pt:=geninlinenode(pprocdef(p^.procdefinition)^.extnumber,is_const,p^.left)
  961. else
  962. begin
  963. pt:=geninlinenode(pprocdef(p^.procdefinition)^.extnumber,is_const,p^.left^.left);
  964. putnode(p^.left);
  965. end;
  966. end
  967. else
  968. begin
  969. pt:=geninlinenode(pprocdef(p^.procdefinition)^.extnumber,is_const,nil);
  970. end;
  971. putnode(p);
  972. firstpass(pt);
  973. p:=pt;
  974. goto errorexit;
  975. end
  976. else
  977. { no intern procedure => we do a call }
  978. { calc the correture value for the register }
  979. { handle predefined procedures }
  980. if (pocall_inline in p^.procdefinition^.proccalloptions) then
  981. begin
  982. if assigned(p^.methodpointer) then
  983. CGMessage(cg_e_unable_inline_object_methods);
  984. if assigned(p^.right) and (p^.right^.treetype<>procinlinen) then
  985. CGMessage(cg_e_unable_inline_procvar);
  986. { p^.treetype:=procinlinen; }
  987. if not assigned(p^.right) then
  988. begin
  989. if assigned(pprocdef(p^.procdefinition)^.code) then
  990. inlinecode:=genprocinlinenode(p,ptree(pprocdef(p^.procdefinition)^.code))
  991. else
  992. CGMessage(cg_e_no_code_for_inline_stored);
  993. if assigned(inlinecode) then
  994. begin
  995. { consider it has not inlined if called
  996. again inside the args }
  997. exclude(p^.procdefinition^.proccalloptions,pocall_inline);
  998. firstpass(inlinecode);
  999. inlined:=true;
  1000. end;
  1001. end;
  1002. end
  1003. else
  1004. procinfo^.flags:=procinfo^.flags or pi_do_call;
  1005. { add needed default parameters }
  1006. if assigned(procs) and
  1007. (paralength<p^.procdefinition^.maxparacount) then
  1008. begin
  1009. { add default parameters, just read back the skipped
  1010. paras starting from firstpara^.previous }
  1011. pdc:=pparaitem(procs^.firstpara^.previous);
  1012. while assigned(pdc) do
  1013. begin
  1014. if not assigned(pdc^.defaultvalue) then
  1015. internalerror(751349858);
  1016. p^.left:=gencallparanode(genconstsymtree(pconstsym(pdc^.defaultvalue)),p^.left);
  1017. pdc:=pparaitem(pdc^.previous);
  1018. end;
  1019. end;
  1020. { work trough all parameters to insert the type conversions }
  1021. if assigned(p^.left) then
  1022. begin
  1023. firstcallparan(p^.left,pparaitem(p^.procdefinition^.para^.first),true);
  1024. end;
  1025. {$ifndef newcg}
  1026. {$ifdef i386}
  1027. incrementregisterpushed(pprocdef(p^.procdefinition)^.usedregisters);
  1028. {$endif}
  1029. {$ifdef m68k}
  1030. for regi:=R_D0 to R_A6 do
  1031. begin
  1032. if (pprocdef(p^.procdefinition)^.usedregisters and ($800 shr word(regi)))<>0 then
  1033. inc(reg_pushes[regi],t_times*2);
  1034. end;
  1035. {$endif}
  1036. {$endif newcg}
  1037. end;
  1038. { ensure that the result type is set }
  1039. p^.resulttype:=p^.procdefinition^.rettype.def;
  1040. { get a register for the return value }
  1041. if (p^.resulttype<>pdef(voiddef)) then
  1042. begin
  1043. if (p^.procdefinition^.proctypeoption=potype_constructor) then
  1044. begin
  1045. { extra handling of classes }
  1046. { p^.methodpointer should be assigned! }
  1047. if assigned(p^.methodpointer) and assigned(p^.methodpointer^.resulttype) and
  1048. (p^.methodpointer^.resulttype^.deftype=classrefdef) then
  1049. begin
  1050. p^.location.loc:=LOC_REGISTER;
  1051. p^.registers32:=1;
  1052. { the result type depends on the classref }
  1053. p^.resulttype:=pclassrefdef(p^.methodpointer^.resulttype)^.pointertype.def;
  1054. end
  1055. { a object constructor returns the result with the flags }
  1056. else
  1057. p^.location.loc:=LOC_FLAGS;
  1058. end
  1059. else
  1060. begin
  1061. {$ifdef SUPPORT_MMX}
  1062. if (cs_mmx in aktlocalswitches) and
  1063. is_mmx_able_array(p^.resulttype) then
  1064. begin
  1065. p^.location.loc:=LOC_MMXREGISTER;
  1066. p^.registersmmx:=1;
  1067. end
  1068. else
  1069. {$endif SUPPORT_MMX}
  1070. if ret_in_acc(p^.resulttype) then
  1071. begin
  1072. p^.location.loc:=LOC_REGISTER;
  1073. if is_64bitint(p^.resulttype) then
  1074. p^.registers32:=2
  1075. else
  1076. p^.registers32:=1;
  1077. { wide- and ansistrings are returned in EAX }
  1078. { but they are imm. moved to a memory location }
  1079. if is_widestring(p^.resulttype) or
  1080. is_ansistring(p^.resulttype) then
  1081. begin
  1082. p^.location.loc:=LOC_MEM;
  1083. { this is wrong we still need one register PM
  1084. p^.registers32:=0; }
  1085. { we use ansistrings so no fast exit here }
  1086. procinfo^.no_fast_exit:=true;
  1087. p^.registers32:=1;
  1088. end;
  1089. end
  1090. else if (p^.resulttype^.deftype=floatdef) then
  1091. begin
  1092. p^.location.loc:=LOC_FPU;
  1093. p^.registersfpu:=1;
  1094. end
  1095. else
  1096. p^.location.loc:=LOC_MEM;
  1097. end;
  1098. end;
  1099. { a fpu can be used in any procedure !! }
  1100. p^.registersfpu:=p^.procdefinition^.fpu_used;
  1101. { if this is a call to a method calc the registers }
  1102. if (p^.methodpointer<>nil) then
  1103. begin
  1104. case p^.methodpointer^.treetype of
  1105. { but only, if this is not a supporting node }
  1106. typen: ;
  1107. { we need one register for new return value PM }
  1108. hnewn : if p^.registers32=0 then
  1109. p^.registers32:=1;
  1110. else
  1111. begin
  1112. if (p^.procdefinition^.proctypeoption in [potype_constructor,potype_destructor]) and
  1113. assigned(p^.symtable) and (p^.symtable^.symtabletype=withsymtable) and
  1114. not pwithsymtable(p^.symtable)^.direct_with then
  1115. begin
  1116. CGmessage(cg_e_cannot_call_cons_dest_inside_with);
  1117. end; { Is accepted by Delphi !! }
  1118. { this is not a good reason to accept it in FPC if we produce
  1119. wrong code for it !!! (PM) }
  1120. { R.Assign is not a constructor !!! }
  1121. { but for R^.Assign, R must be valid !! }
  1122. if (p^.procdefinition^.proctypeoption=potype_constructor) or
  1123. ((p^.methodpointer^.treetype=loadn) and
  1124. (not(oo_has_virtual in pobjectdef(p^.methodpointer^.resulttype)^.objectoptions))) then
  1125. method_must_be_valid:=false
  1126. else
  1127. method_must_be_valid:=true;
  1128. firstpass(p^.methodpointer);
  1129. set_varstate(p^.methodpointer,method_must_be_valid);
  1130. { The object is already used ven if it is called once }
  1131. if (p^.methodpointer^.treetype=loadn) and
  1132. (p^.methodpointer^.symtableentry^.typ=varsym) then
  1133. pvarsym(p^.methodpointer^.symtableentry)^.varstate:=vs_used;
  1134. p^.registersfpu:=max(p^.methodpointer^.registersfpu,p^.registersfpu);
  1135. p^.registers32:=max(p^.methodpointer^.registers32,p^.registers32);
  1136. {$ifdef SUPPORT_MMX}
  1137. p^.registersmmx:=max(p^.methodpointer^.registersmmx,p^.registersmmx);
  1138. {$endif SUPPORT_MMX}
  1139. end;
  1140. end;
  1141. end;
  1142. if inlined then
  1143. p^.right:=inlinecode;
  1144. { determine the registers of the procedure variable }
  1145. { is this OK for inlined procs also ?? (PM) }
  1146. if assigned(p^.right) then
  1147. begin
  1148. p^.registersfpu:=max(p^.right^.registersfpu,p^.registersfpu);
  1149. p^.registers32:=max(p^.right^.registers32,p^.registers32);
  1150. {$ifdef SUPPORT_MMX}
  1151. p^.registersmmx:=max(p^.right^.registersmmx,p^.registersmmx);
  1152. {$endif SUPPORT_MMX}
  1153. end;
  1154. { determine the registers of the procedure }
  1155. if assigned(p^.left) then
  1156. begin
  1157. p^.registersfpu:=max(p^.left^.registersfpu,p^.registersfpu);
  1158. p^.registers32:=max(p^.left^.registers32,p^.registers32);
  1159. {$ifdef SUPPORT_MMX}
  1160. p^.registersmmx:=max(p^.left^.registersmmx,p^.registersmmx);
  1161. {$endif SUPPORT_MMX}
  1162. end;
  1163. errorexit:
  1164. { Reset some settings back }
  1165. if assigned(procs) then
  1166. dispose(procs);
  1167. if inlined then
  1168. include(p^.procdefinition^.proccalloptions,pocall_inline);
  1169. aktcallprocsym:=oldcallprocsym;
  1170. end;
  1171. {*****************************************************************************
  1172. FirstProcInlineN
  1173. *****************************************************************************}
  1174. procedure firstprocinline(var p : ptree);
  1175. begin
  1176. { left contains the code in tree form }
  1177. { but it has already been firstpassed }
  1178. { so firstpass(p^.left); does not seem required }
  1179. { might be required later if we change the arg handling !! }
  1180. end;
  1181. end.
  1182. {
  1183. $Log$
  1184. Revision 1.4 2000-08-06 19:39:28 peter
  1185. * default parameters working !
  1186. Revision 1.3 2000/07/13 12:08:28 michael
  1187. + patched to 1.1.0 with former 1.09patch from peter
  1188. Revision 1.2 2000/07/13 11:32:51 michael
  1189. + removed logs
  1190. }