tccal.pas 59 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 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. unit tccal;
  19. interface
  20. uses
  21. symtable,tree;
  22. procedure gen_high_tree(p:ptree;openstring:boolean);
  23. procedure firstcallparan(var p : ptree;defcoll : pdefcoll);
  24. procedure firstcalln(var p : ptree);
  25. procedure firstprocinline(var p : ptree);
  26. implementation
  27. uses
  28. globtype,systems,
  29. cobjects,verbose,globals,
  30. symconst,aasm,types,
  31. hcodegen,htypechk,pass_1,cpubase
  32. {$ifdef i386}
  33. ,tgeni386
  34. {$endif}
  35. ;
  36. {*****************************************************************************
  37. FirstCallParaN
  38. *****************************************************************************}
  39. procedure gen_high_tree(p:ptree;openstring:boolean);
  40. var
  41. len : longint;
  42. st : psymtable;
  43. loadconst : boolean;
  44. begin
  45. if assigned(p^.hightree) then
  46. exit;
  47. len:=-1;
  48. loadconst:=true;
  49. case p^.left^.resulttype^.deftype of
  50. arraydef :
  51. begin
  52. if is_open_array(p^.left^.resulttype) or
  53. is_array_of_const(p^.left^.resulttype) then
  54. begin
  55. st:=p^.left^.symtable;
  56. getsymonlyin(st,'high'+pvarsym(p^.left^.symtableentry)^.name);
  57. p^.hightree:=genloadnode(pvarsym(srsym),st);
  58. loadconst:=false;
  59. end
  60. else
  61. begin
  62. { this is an empty constructor }
  63. len:=parraydef(p^.left^.resulttype)^.highrange-
  64. parraydef(p^.left^.resulttype)^.lowrange;
  65. end;
  66. end;
  67. stringdef :
  68. begin
  69. if openstring then
  70. begin
  71. if is_open_string(p^.left^.resulttype) then
  72. begin
  73. st:=p^.left^.symtable;
  74. getsymonlyin(st,'high'+pvarsym(p^.left^.symtableentry)^.name);
  75. p^.hightree:=genloadnode(pvarsym(srsym),st);
  76. loadconst:=false;
  77. end
  78. else
  79. len:=pstringdef(p^.left^.resulttype)^.len;
  80. end
  81. else
  82. { passing a string to an array of char }
  83. begin
  84. if (p^.left^.treetype=stringconstn) then
  85. begin
  86. len:=str_length(p^.left);
  87. if len>0 then
  88. dec(len);
  89. end
  90. else
  91. begin
  92. p^.hightree:=gennode(subn,geninlinenode(in_length_string,false,getcopy(p^.left)),
  93. genordinalconstnode(1,s32bitdef));
  94. firstpass(p^.hightree);
  95. p^.hightree:=gentypeconvnode(p^.hightree,s32bitdef);
  96. loadconst:=false;
  97. end;
  98. end;
  99. end;
  100. else
  101. len:=0;
  102. end;
  103. if loadconst then
  104. p^.hightree:=genordinalconstnode(len,s32bitdef);
  105. firstpass(p^.hightree);
  106. end;
  107. procedure firstcallparan(var p : ptree;defcoll : pdefcoll);
  108. var
  109. old_get_para_resulttype : boolean;
  110. old_array_constructor : boolean;
  111. store_valid : boolean;
  112. oldtype : pdef;
  113. {convtyp : tconverttype;}
  114. begin
  115. inc(parsing_para_level);
  116. if assigned(p^.right) then
  117. begin
  118. if defcoll=nil then
  119. firstcallparan(p^.right,nil)
  120. else
  121. firstcallparan(p^.right,defcoll^.next);
  122. p^.registers32:=p^.right^.registers32;
  123. p^.registersfpu:=p^.right^.registersfpu;
  124. {$ifdef SUPPORT_MMX}
  125. p^.registersmmx:=p^.right^.registersmmx;
  126. {$endif}
  127. end;
  128. if defcoll=nil then
  129. begin
  130. old_array_constructor:=allow_array_constructor;
  131. old_get_para_resulttype:=get_para_resulttype;
  132. get_para_resulttype:=true;
  133. allow_array_constructor:=true;
  134. if not(assigned(p^.resulttype)) or
  135. (p^.left^.treetype=typeconvn) then
  136. firstpass(p^.left);
  137. get_para_resulttype:=old_get_para_resulttype;
  138. allow_array_constructor:=old_array_constructor;
  139. if codegenerror then
  140. begin
  141. dec(parsing_para_level);
  142. exit;
  143. end;
  144. p^.resulttype:=p^.left^.resulttype;
  145. end
  146. { if we know the routine which is called, then the type }
  147. { conversions are inserted }
  148. else
  149. begin
  150. { Do we need arrayconstructor -> set conversion, then insert
  151. it here before the arrayconstructor node breaks the tree
  152. with its conversions of enum->ord }
  153. if (p^.left^.treetype=arrayconstructn) and
  154. (defcoll^.data^.deftype=setdef) then
  155. p^.left:=gentypeconvnode(p^.left,defcoll^.data);
  156. if count_ref then
  157. begin
  158. { not completly proper, but avoids some warnings }
  159. if (p^.left^.treetype=funcretn) and (defcoll^.paratyp=vs_var) then
  160. procinfo.funcret_is_valid:=true;
  161. store_valid:=must_be_valid;
  162. { protected has nothing to do with read/write
  163. if (defcoll^.paratyp=vs_var) then
  164. test_protected(p^.left);
  165. }
  166. must_be_valid:=(defcoll^.paratyp<>vs_var);
  167. { only process typeconvn and arrayconstructn, else it will
  168. break other trees }
  169. old_array_constructor:=allow_array_constructor;
  170. old_get_para_resulttype:=get_para_resulttype;
  171. allow_array_constructor:=true;
  172. get_para_resulttype:=false;
  173. if (p^.left^.treetype in [arrayconstructn,typeconvn]) then
  174. firstpass(p^.left);
  175. get_para_resulttype:=old_get_para_resulttype;
  176. allow_array_constructor:=old_array_constructor;
  177. must_be_valid:=store_valid;
  178. end;
  179. { check if local proc/func is assigned to procvar }
  180. if p^.left^.resulttype^.deftype=procvardef then
  181. test_local_to_procvar(pprocvardef(p^.left^.resulttype),defcoll^.data);
  182. { generate the high() value tree }
  183. if push_high_param(defcoll^.data) then
  184. gen_high_tree(p,is_open_string(defcoll^.data));
  185. if not(is_shortstring(p^.left^.resulttype) and
  186. is_shortstring(defcoll^.data)) and
  187. (defcoll^.data^.deftype<>formaldef) then
  188. begin
  189. if (defcoll^.paratyp=vs_var) and
  190. { allows conversion from word to integer and
  191. byte to shortint }
  192. (not(
  193. (p^.left^.resulttype^.deftype=orddef) and
  194. (defcoll^.data^.deftype=orddef) and
  195. (p^.left^.resulttype^.size=defcoll^.data^.size)
  196. ) and
  197. { an implicit pointer conversion is allowed }
  198. not(
  199. (p^.left^.resulttype^.deftype=pointerdef) and
  200. (defcoll^.data^.deftype=pointerdef)
  201. ) and
  202. { child classes can be also passed }
  203. not(
  204. (p^.left^.resulttype^.deftype=objectdef) and
  205. (defcoll^.data^.deftype=objectdef) and
  206. pobjectdef(p^.left^.resulttype)^.is_related(pobjectdef(defcoll^.data))
  207. ) and
  208. { passing a single element to a openarray of the same type }
  209. not(
  210. (is_open_array(defcoll^.data) and
  211. is_equal(parraydef(defcoll^.data)^.definition,p^.left^.resulttype))
  212. ) and
  213. { an implicit file conversion is also allowed }
  214. { from a typed file to an untyped one }
  215. not(
  216. (p^.left^.resulttype^.deftype=filedef) and
  217. (defcoll^.data^.deftype=filedef) and
  218. (pfiledef(defcoll^.data)^.filetype = ft_untyped) and
  219. (pfiledef(p^.left^.resulttype)^.filetype = ft_typed)
  220. ) and
  221. not(is_equal(p^.left^.resulttype,defcoll^.data))) then
  222. begin
  223. aktfilepos:=p^.left^.fileinfo;
  224. CGMessage(parser_e_call_by_ref_without_typeconv);
  225. end;
  226. { process cargs arrayconstructor }
  227. if is_array_constructor(p^.left^.resulttype) then
  228. begin
  229. if is_array_of_const(defcoll^.data) then
  230. begin
  231. if assigned(aktcallprocsym) and
  232. (pocall_cdecl in aktcallprocsym^.definition^.proccalloptions) and
  233. (po_external in aktcallprocsym^.definition^.procoptions) then
  234. p^.left^.cargs:=true;
  235. { force variant array }
  236. p^.left^.forcevaria:=true;
  237. end
  238. else
  239. begin
  240. p^.left^.novariaallowed:=true;
  241. p^.left^.constructdef:=parraydef(defcoll^.data)^.definition;
  242. end;
  243. old_array_constructor:=allow_array_constructor;
  244. allow_array_constructor:=true;
  245. firstpass(p^.left);
  246. allow_array_constructor:=old_array_constructor;
  247. end;
  248. { process open parameters }
  249. if push_high_param(defcoll^.data) then
  250. begin
  251. { insert type conv but hold the ranges of the array }
  252. oldtype:=p^.left^.resulttype;
  253. p^.left:=gentypeconvnode(p^.left,defcoll^.data);
  254. firstpass(p^.left);
  255. p^.left^.resulttype:=oldtype;
  256. end
  257. else
  258. begin
  259. p^.left:=gentypeconvnode(p^.left,defcoll^.data);
  260. firstpass(p^.left);
  261. end;
  262. if codegenerror then
  263. begin
  264. dec(parsing_para_level);
  265. exit;
  266. end;
  267. end;
  268. { check var strings }
  269. if (cs_strict_var_strings in aktlocalswitches) and
  270. is_shortstring(p^.left^.resulttype) and
  271. is_shortstring(defcoll^.data) and
  272. (defcoll^.paratyp=vs_var) and
  273. not(is_open_string(defcoll^.data)) and
  274. not(is_equal(p^.left^.resulttype,defcoll^.data)) then
  275. begin
  276. aktfilepos:=p^.left^.fileinfo;
  277. CGMessage(type_e_strict_var_string_violation);
  278. end;
  279. { Variablen for call by reference may not be copied }
  280. { into a register }
  281. { is this usefull here ? }
  282. { this was missing in formal parameter list }
  283. if (defcoll^.data=pdef(cformaldef)) then
  284. begin
  285. if defcoll^.paratyp=vs_var then
  286. if not valid_for_formal_var(p^.left) then
  287. begin
  288. aktfilepos:=p^.left^.fileinfo;
  289. CGMessage(parser_e_illegal_parameter_list);
  290. end;
  291. if defcoll^.paratyp=vs_const then
  292. if not valid_for_formal_const(p^.left) then
  293. begin
  294. aktfilepos:=p^.left^.fileinfo;
  295. CGMessage(parser_e_illegal_parameter_list);
  296. end;
  297. end;
  298. if defcoll^.paratyp=vs_var then
  299. begin
  300. set_unique(p^.left);
  301. make_not_regable(p^.left);
  302. end;
  303. p^.resulttype:=defcoll^.data;
  304. end;
  305. if p^.left^.registers32>p^.registers32 then
  306. p^.registers32:=p^.left^.registers32;
  307. if p^.left^.registersfpu>p^.registersfpu then
  308. p^.registersfpu:=p^.left^.registersfpu;
  309. {$ifdef SUPPORT_MMX}
  310. if p^.left^.registersmmx>p^.registersmmx then
  311. p^.registersmmx:=p^.left^.registersmmx;
  312. {$endif SUPPORT_MMX}
  313. dec(parsing_para_level);
  314. end;
  315. {*****************************************************************************
  316. FirstCallN
  317. *****************************************************************************}
  318. procedure firstcalln(var p : ptree);
  319. type
  320. pprocdefcoll = ^tprocdefcoll;
  321. tprocdefcoll = record
  322. data : pprocdef;
  323. nextpara : pdefcoll;
  324. firstpara : pdefcoll;
  325. next : pprocdefcoll;
  326. end;
  327. var
  328. hp,procs,hp2 : pprocdefcoll;
  329. pd : pprocdef;
  330. oldcallprocsym : pprocsym;
  331. nextprocsym : pprocsym;
  332. def_from,def_to,conv_to : pdef;
  333. hpt,pt,inlinecode : ptree;
  334. exactmatch,inlined : boolean;
  335. paralength,l,lastpara : longint;
  336. lastparatype : pdef;
  337. pdc : pdefcoll;
  338. {$ifdef TEST_PROCSYMS}
  339. symt : psymtable;
  340. {$endif TEST_PROCSYMS}
  341. { only Dummy }
  342. hcvt : tconverttype;
  343. regi : tregister;
  344. store_valid, old_count_ref : boolean;
  345. label
  346. errorexit;
  347. { check if the resulttype from tree p is equal with def, needed
  348. for stringconstn and formaldef }
  349. function is_equal(p:ptree;def:pdef) : boolean;
  350. begin
  351. { safety check }
  352. if not (assigned(def) or assigned(p^.resulttype)) then
  353. begin
  354. is_equal:=false;
  355. exit;
  356. end;
  357. { all types can be passed to a formaldef }
  358. is_equal:=(def^.deftype=formaldef) or
  359. (types.is_equal(p^.resulttype,def))
  360. { to support ansi/long/wide strings in a proper way }
  361. { string and string[10] are assumed as equal }
  362. { when searching the correct overloaded procedure }
  363. or
  364. (
  365. (def^.deftype=stringdef) and (p^.resulttype^.deftype=stringdef) and
  366. (pstringdef(def)^.string_typ=pstringdef(p^.resulttype)^.string_typ)
  367. )
  368. or
  369. (
  370. (p^.left^.treetype=stringconstn) and
  371. (is_ansistring(p^.resulttype) and is_pchar(def))
  372. )
  373. or
  374. (
  375. (p^.left^.treetype=ordconstn) and
  376. (is_char(p^.resulttype) and (is_shortstring(def) or is_ansistring(def)))
  377. )
  378. { set can also be a not yet converted array constructor }
  379. or
  380. (
  381. (def^.deftype=setdef) and (p^.resulttype^.deftype=arraydef) and
  382. (parraydef(p^.resulttype)^.IsConstructor) and not(parraydef(p^.resulttype)^.IsVariant)
  383. )
  384. { in tp7 mode proc -> procvar is allowed }
  385. or
  386. (
  387. (m_tp_procvar in aktmodeswitches) and
  388. (def^.deftype=procvardef) and (p^.left^.treetype=calln) and
  389. (proc_to_procvar_equal(pprocdef(p^.left^.procdefinition),pprocvardef(def)))
  390. )
  391. ;
  392. end;
  393. function is_in_limit(def_from,def_to : pdef) : boolean;
  394. begin
  395. is_in_limit:=(def_from^.deftype = orddef) and
  396. (def_to^.deftype = orddef) and
  397. (porddef(def_from)^.low>porddef(def_to)^.low) and
  398. (porddef(def_from)^.high<porddef(def_to)^.high);
  399. end;
  400. var
  401. is_const : boolean;
  402. begin
  403. { release registers! }
  404. { if procdefinition<>nil then we called firstpass already }
  405. { it seems to be bad because of the registers }
  406. { at least we can avoid the overloaded search !! }
  407. procs:=nil;
  408. { made this global for disposing !! }
  409. store_valid:=must_be_valid;
  410. must_be_valid:=false;
  411. oldcallprocsym:=aktcallprocsym;
  412. aktcallprocsym:=nil;
  413. inlined:=false;
  414. if assigned(p^.procdefinition) and
  415. (pocall_inline in p^.procdefinition^.proccalloptions) then
  416. begin
  417. inlinecode:=p^.right;
  418. if assigned(inlinecode) then
  419. begin
  420. inlined:=true;
  421. {$ifdef INCLUDEOK}
  422. exclude(p^.procdefinition^.proccalloptions,pocall_inline);
  423. {$else}
  424. p^.procdefinition^.proccalloptions:=p^.procdefinition^.proccalloptions-[pocall_inline];
  425. {$endif}
  426. end;
  427. p^.right:=nil;
  428. end;
  429. if assigned(p^.procdefinition) and
  430. (po_containsself in p^.procdefinition^.procoptions) then
  431. message(cg_e_cannot_call_message_direct);
  432. { procedure variable ? }
  433. if assigned(p^.right) then
  434. begin
  435. { procedure does a call }
  436. procinfo.flags:=procinfo.flags or pi_do_call;
  437. { calc the correture value for the register }
  438. {$ifdef i386}
  439. for regi:=R_EAX to R_EDI do
  440. inc(reg_pushes[regi],t_times*2);
  441. {$endif}
  442. {$ifdef m68k}
  443. for regi:=R_D0 to R_A6 do
  444. inc(reg_pushes[regi],t_times*2);
  445. {$endif}
  446. { calculate the type of the parameters }
  447. if assigned(p^.left) then
  448. begin
  449. old_count_ref:=count_ref;
  450. count_ref:=false;
  451. firstcallparan(p^.left,nil);
  452. count_ref:=old_count_ref;
  453. if codegenerror then
  454. goto errorexit;
  455. end;
  456. firstpass(p^.right);
  457. { check the parameters }
  458. pdc:=pprocvardef(p^.right^.resulttype)^.para1;
  459. pt:=p^.left;
  460. while assigned(pdc) and assigned(pt) do
  461. begin
  462. pt:=pt^.right;
  463. pdc:=pdc^.next;
  464. end;
  465. if assigned(pt) or assigned(pdc) then
  466. begin
  467. if assigned(pt) then
  468. aktfilepos:=pt^.fileinfo;
  469. CGMessage(parser_e_illegal_parameter_list);
  470. end;
  471. { insert type conversions }
  472. if assigned(p^.left) then
  473. begin
  474. old_count_ref:=count_ref;
  475. count_ref:=true;
  476. firstcallparan(p^.left,pprocvardef(p^.right^.resulttype)^.para1);
  477. count_ref:=old_count_ref;
  478. if codegenerror then
  479. goto errorexit;
  480. end;
  481. p^.resulttype:=pprocvardef(p^.right^.resulttype)^.retdef;
  482. { this was missing, leads to a bug below if
  483. the procvar is a function }
  484. p^.procdefinition:=pabstractprocdef(p^.right^.resulttype);
  485. end
  486. else
  487. { not a procedure variable }
  488. begin
  489. { determine the type of the parameters }
  490. if assigned(p^.left) then
  491. begin
  492. old_count_ref:=count_ref;
  493. count_ref:=false;
  494. store_valid:=must_be_valid;
  495. must_be_valid:=false;
  496. firstcallparan(p^.left,nil);
  497. count_ref:=old_count_ref;
  498. must_be_valid:=store_valid;
  499. if codegenerror then
  500. goto errorexit;
  501. end;
  502. aktcallprocsym:=pprocsym(p^.symtableprocentry);
  503. { do we know the procedure to call ? }
  504. if not(assigned(p^.procdefinition)) then
  505. begin
  506. {$ifdef TEST_PROCSYMS}
  507. if (p^.unit_specific) or
  508. assigned(p^.methodpointer) then
  509. nextprocsym:=nil
  510. else while not assigned(procs) do
  511. begin
  512. symt:=p^.symtableproc;
  513. srsym:=nil;
  514. while assigned(symt^.next) and not assigned(srsym) do
  515. begin
  516. symt:=symt^.next;
  517. getsymonlyin(symt,actprocsym^.name);
  518. if assigned(srsym) then
  519. if srsym^.typ<>procsym then
  520. begin
  521. { reject all that is not a procedure }
  522. srsym:=nil;
  523. { don't search elsewhere }
  524. while assigned(symt^.next) do
  525. symt:=symt^.next;
  526. end;
  527. end;
  528. nextprocsym:=srsym;
  529. end;
  530. {$else TEST_PROCSYMS}
  531. nextprocsym:=nil;
  532. {$endif TEST_PROCSYMS}
  533. { determine length of parameter list }
  534. pt:=p^.left;
  535. paralength:=0;
  536. while assigned(pt) do
  537. begin
  538. inc(paralength);
  539. pt:=pt^.right;
  540. end;
  541. { link all procedures which have the same # of parameters }
  542. pd:=aktcallprocsym^.definition;
  543. while assigned(pd) do
  544. begin
  545. pdc:=pd^.para1;
  546. l:=0;
  547. while assigned(pdc) do
  548. begin
  549. inc(l);
  550. pdc:=pdc^.next;
  551. end;
  552. { only when the # of parameter are equal }
  553. if (l=paralength) then
  554. begin
  555. new(hp);
  556. hp^.data:=pd;
  557. hp^.next:=procs;
  558. hp^.nextpara:=pd^.para1;
  559. hp^.firstpara:=pd^.para1;
  560. procs:=hp;
  561. end;
  562. pd:=pd^.nextoverloaded;
  563. end;
  564. { no procedures found? then there is something wrong
  565. with the parameter size }
  566. if not assigned(procs) then
  567. begin
  568. { in tp mode we can try to convert to procvar if
  569. there are no parameters specified }
  570. if not(assigned(p^.left)) and
  571. (m_tp_procvar in aktmodeswitches) then
  572. begin
  573. if (p^.symtableprocentry^.owner^.symtabletype=objectsymtable) and
  574. (pobjectdef(p^.symtableprocentry^.owner^.defowner)^.is_class) then
  575. hpt:=genloadmethodcallnode(pprocsym(p^.symtableprocentry),p^.symtableproc,
  576. getcopy(p^.methodpointer))
  577. else
  578. hpt:=genloadcallnode(pprocsym(p^.symtableprocentry),p^.symtableproc);
  579. disposetree(p);
  580. firstpass(hpt);
  581. p:=hpt;
  582. end
  583. else
  584. begin
  585. if assigned(p^.left) then
  586. aktfilepos:=p^.left^.fileinfo;
  587. CGMessage(parser_e_wrong_parameter_size);
  588. aktcallprocsym^.write_parameter_lists;
  589. end;
  590. goto errorexit;
  591. end;
  592. { now we can compare parameter after parameter }
  593. pt:=p^.left;
  594. { we start with the last parameter }
  595. lastpara:=paralength+1;
  596. lastparatype:=nil;
  597. while assigned(pt) do
  598. begin
  599. dec(lastpara);
  600. { walk all procedures and determine how this parameter matches and set:
  601. 1. pt^.exact_match_found if one parameter has an exact match
  602. 2. exactmatch if an equal or exact match is found
  603. 3. para^.argconvtyp to exact,equal or convertable
  604. (when convertable then also convertlevel is set)
  605. 4. pt^.convlevel1found if there is a convertlevel=1
  606. 5. pt^.convlevel2found if there is a convertlevel=2
  607. }
  608. exactmatch:=false;
  609. hp:=procs;
  610. while assigned(hp) do
  611. begin
  612. if is_equal(pt,hp^.nextpara^.data) then
  613. begin
  614. if hp^.nextpara^.data=pt^.resulttype then
  615. begin
  616. pt^.exact_match_found:=true;
  617. hp^.nextpara^.argconvtyp:=act_exact;
  618. end
  619. else
  620. hp^.nextpara^.argconvtyp:=act_equal;
  621. exactmatch:=true;
  622. end
  623. else
  624. begin
  625. hp^.nextpara^.argconvtyp:=act_convertable;
  626. hp^.nextpara^.convertlevel:=isconvertable(pt^.resulttype,hp^.nextpara^.data,
  627. hcvt,pt^.left^.treetype,false);
  628. case hp^.nextpara^.convertlevel of
  629. 1 : pt^.convlevel1found:=true;
  630. 2 : pt^.convlevel2found:=true;
  631. end;
  632. end;
  633. hp:=hp^.next;
  634. end;
  635. { If there was an exactmatch then delete all convertables }
  636. if exactmatch then
  637. begin
  638. hp:=procs;
  639. procs:=nil;
  640. while assigned(hp) do
  641. begin
  642. hp2:=hp^.next;
  643. { keep if not convertable }
  644. if (hp^.nextpara^.argconvtyp<>act_convertable) then
  645. begin
  646. hp^.next:=procs;
  647. procs:=hp;
  648. end
  649. else
  650. dispose(hp);
  651. hp:=hp2;
  652. end;
  653. end
  654. else
  655. { No exact match was found, remove all procedures that are
  656. not convertable (convertlevel=0) }
  657. begin
  658. hp:=procs;
  659. procs:=nil;
  660. while assigned(hp) do
  661. begin
  662. hp2:=hp^.next;
  663. { keep if not convertable }
  664. if (hp^.nextpara^.convertlevel<>0) then
  665. begin
  666. hp^.next:=procs;
  667. procs:=hp;
  668. end
  669. else
  670. begin
  671. { save the type for nice error message }
  672. lastparatype:=hp^.nextpara^.data;
  673. dispose(hp);
  674. end;
  675. hp:=hp2;
  676. end;
  677. end;
  678. { update nextpara for all procedures }
  679. hp:=procs;
  680. while assigned(hp) do
  681. begin
  682. hp^.nextpara:=hp^.nextpara^.next;
  683. hp:=hp^.next;
  684. end;
  685. { load next parameter or quit loop if no procs left }
  686. if assigned(procs) then
  687. pt:=pt^.right
  688. else
  689. break;
  690. end;
  691. { All parameters are checked, check if there are any
  692. procedures left }
  693. if not assigned(procs) then
  694. begin
  695. { there is an error, must be wrong type, because
  696. wrong size is already checked (PFV) }
  697. if (not assigned(lastparatype)) or
  698. (not assigned(pt)) or
  699. (not assigned(pt^.resulttype)) then
  700. internalerror(39393)
  701. else
  702. begin
  703. aktfilepos:=pt^.fileinfo;
  704. CGMessage3(type_e_wrong_parameter_type,tostr(lastpara),
  705. pt^.resulttype^.typename,lastparatype^.typename);
  706. end;
  707. aktcallprocsym^.write_parameter_lists;
  708. goto errorexit;
  709. end;
  710. { if there are several choices left then for orddef }
  711. { if a type is totally included in the other }
  712. { we don't fear an overflow , }
  713. { so we can do as if it is an exact match }
  714. { this will convert integer to longint }
  715. { rather than to words }
  716. { conversion of byte to integer or longint }
  717. {would still not be solved }
  718. if assigned(procs) and assigned(procs^.next) then
  719. begin
  720. hp:=procs;
  721. while assigned(hp) do
  722. begin
  723. hp^.nextpara:=hp^.firstpara;
  724. hp:=hp^.next;
  725. end;
  726. pt:=p^.left;
  727. while assigned(pt) do
  728. begin
  729. { matches a parameter of one procedure exact ? }
  730. exactmatch:=false;
  731. def_from:=pt^.resulttype;
  732. hp:=procs;
  733. while assigned(hp) do
  734. begin
  735. if not is_equal(pt,hp^.nextpara^.data) then
  736. begin
  737. def_to:=hp^.nextpara^.data;
  738. if ((def_from^.deftype=orddef) and (def_to^.deftype=orddef)) and
  739. (is_in_limit(def_from,def_to) or
  740. ((hp^.nextpara^.paratyp=vs_var) and
  741. (def_from^.size=def_to^.size))) then
  742. begin
  743. exactmatch:=true;
  744. conv_to:=def_to;
  745. end;
  746. end;
  747. hp:=hp^.next;
  748. end;
  749. { .... if yes, del all the other procedures }
  750. if exactmatch then
  751. begin
  752. { the first .... }
  753. while (assigned(procs)) and not(is_in_limit(def_from,procs^.nextpara^.data)) do
  754. begin
  755. hp:=procs^.next;
  756. dispose(procs);
  757. procs:=hp;
  758. end;
  759. { and the others }
  760. hp:=procs;
  761. while (assigned(hp)) and assigned(hp^.next) do
  762. begin
  763. if not(is_in_limit(def_from,hp^.next^.nextpara^.data)) then
  764. begin
  765. hp2:=hp^.next^.next;
  766. dispose(hp^.next);
  767. hp^.next:=hp2;
  768. end
  769. else
  770. begin
  771. def_to:=hp^.next^.nextpara^.data;
  772. if (conv_to^.size>def_to^.size) or
  773. ((porddef(conv_to)^.low<porddef(def_to)^.low) and
  774. (porddef(conv_to)^.high>porddef(def_to)^.high)) then
  775. begin
  776. hp2:=procs;
  777. procs:=hp;
  778. conv_to:=def_to;
  779. dispose(hp2);
  780. end
  781. else
  782. hp:=hp^.next;
  783. end;
  784. end;
  785. end;
  786. { update nextpara for all procedures }
  787. hp:=procs;
  788. while assigned(hp) do
  789. begin
  790. hp^.nextpara:=hp^.nextpara^.next;
  791. hp:=hp^.next;
  792. end;
  793. pt:=pt^.right;
  794. end;
  795. end;
  796. { let's try to eliminate equal if there is an exact match
  797. is there }
  798. if assigned(procs) and assigned(procs^.next) then
  799. begin
  800. { reset nextpara for all procs left }
  801. hp:=procs;
  802. while assigned(hp) do
  803. begin
  804. hp^.nextpara:=hp^.firstpara;
  805. hp:=hp^.next;
  806. end;
  807. pt:=p^.left;
  808. while assigned(pt) do
  809. begin
  810. if pt^.exact_match_found then
  811. begin
  812. hp:=procs;
  813. procs:=nil;
  814. while assigned(hp) do
  815. begin
  816. hp2:=hp^.next;
  817. { keep the exact matches, dispose the others }
  818. if (hp^.nextpara^.argconvtyp=act_exact) then
  819. begin
  820. hp^.next:=procs;
  821. procs:=hp;
  822. end
  823. else
  824. dispose(hp);
  825. hp:=hp2;
  826. end;
  827. end;
  828. { update nextpara for all procedures }
  829. hp:=procs;
  830. while assigned(hp) do
  831. begin
  832. hp^.nextpara:=hp^.nextpara^.next;
  833. hp:=hp^.next;
  834. end;
  835. pt:=pt^.right;
  836. end;
  837. end;
  838. { Check if there are convertlevel 1 and 2 differences
  839. left for the parameters, then discard all convertlevel
  840. 2 procedures. The value of convlevelXfound can still
  841. be used, because all convertables are still here or
  842. not }
  843. if assigned(procs) and assigned(procs^.next) then
  844. begin
  845. { reset nextpara for all procs left }
  846. hp:=procs;
  847. while assigned(hp) do
  848. begin
  849. hp^.nextpara:=hp^.firstpara;
  850. hp:=hp^.next;
  851. end;
  852. pt:=p^.left;
  853. while assigned(pt) do
  854. begin
  855. if pt^.convlevel1found and pt^.convlevel2found then
  856. begin
  857. hp:=procs;
  858. procs:=nil;
  859. while assigned(hp) do
  860. begin
  861. hp2:=hp^.next;
  862. { keep all not act_convertable and all convertlevels=1 }
  863. if (hp^.nextpara^.argconvtyp<>act_convertable) or
  864. (hp^.nextpara^.convertlevel=1) then
  865. begin
  866. hp^.next:=procs;
  867. procs:=hp;
  868. end
  869. else
  870. dispose(hp);
  871. hp:=hp2;
  872. end;
  873. end;
  874. { update nextpara for all procedures }
  875. hp:=procs;
  876. while assigned(hp) do
  877. begin
  878. hp^.nextpara:=hp^.nextpara^.next;
  879. hp:=hp^.next;
  880. end;
  881. pt:=pt^.right;
  882. end;
  883. end;
  884. if not(assigned(procs)) or assigned(procs^.next) then
  885. begin
  886. CGMessage(cg_e_cant_choose_overload_function);
  887. aktcallprocsym^.write_parameter_lists;
  888. goto errorexit;
  889. end;
  890. {$ifdef TEST_PROCSYMS}
  891. if (procs=nil) and assigned(nextprocsym) then
  892. begin
  893. p^.symtableprocentry:=nextprocsym;
  894. p^.symtableproc:=symt;
  895. end;
  896. end ; { of while assigned(p^.symtableprocentry) do }
  897. {$endif TEST_PROCSYMS}
  898. if make_ref then
  899. begin
  900. procs^.data^.lastref:=new(pref,init(procs^.data^.lastref,@p^.fileinfo));
  901. inc(procs^.data^.refcount);
  902. if procs^.data^.defref=nil then
  903. procs^.data^.defref:=procs^.data^.lastref;
  904. end;
  905. p^.procdefinition:=procs^.data;
  906. p^.resulttype:=procs^.data^.retdef;
  907. { big error for with statements
  908. p^.symtableproc:=p^.procdefinition^.owner;
  909. but neede for overloaded operators !! }
  910. if p^.symtableproc=nil then
  911. p^.symtableproc:=p^.procdefinition^.owner;
  912. p^.location.loc:=LOC_MEM;
  913. {$ifdef CHAINPROCSYMS}
  914. { object with method read;
  915. call to read(x) will be a usual procedure call }
  916. if assigned(p^.methodpointer) and
  917. (p^.procdefinition^._class=nil) then
  918. begin
  919. { not ok for extended }
  920. case p^.methodpointer^.treetype of
  921. typen,hnewn : fatalerror(no_para_match);
  922. end;
  923. disposetree(p^.methodpointer);
  924. p^.methodpointer:=nil;
  925. end;
  926. {$endif CHAINPROCSYMS}
  927. end; { end of procedure to call determination }
  928. is_const:=(pocall_internconst in p^.procdefinition^.proccalloptions) and
  929. ((block_type=bt_const) or
  930. (assigned(p^.left) and (p^.left^.left^.treetype in [realconstn,ordconstn])));
  931. { handle predefined procedures }
  932. if (pocall_internproc in p^.procdefinition^.proccalloptions) or is_const then
  933. begin
  934. if assigned(p^.left) then
  935. begin
  936. { settextbuf needs two args }
  937. if assigned(p^.left^.right) then
  938. pt:=geninlinenode(pprocdef(p^.procdefinition)^.extnumber,is_const,p^.left)
  939. else
  940. begin
  941. pt:=geninlinenode(pprocdef(p^.procdefinition)^.extnumber,is_const,p^.left^.left);
  942. putnode(p^.left);
  943. end;
  944. end
  945. else
  946. begin
  947. pt:=geninlinenode(pprocdef(p^.procdefinition)^.extnumber,is_const,nil);
  948. end;
  949. putnode(p);
  950. firstpass(pt);
  951. p:=pt;
  952. goto errorexit;
  953. end
  954. else
  955. { no intern procedure => we do a call }
  956. { calc the correture value for the register }
  957. { handle predefined procedures }
  958. if (pocall_inline in p^.procdefinition^.proccalloptions) then
  959. begin
  960. if assigned(p^.methodpointer) then
  961. CGMessage(cg_e_unable_inline_object_methods);
  962. if assigned(p^.right) and (p^.right^.treetype<>procinlinen) then
  963. CGMessage(cg_e_unable_inline_procvar);
  964. { p^.treetype:=procinlinen; }
  965. if not assigned(p^.right) then
  966. begin
  967. if assigned(pprocdef(p^.procdefinition)^.code) then
  968. inlinecode:=genprocinlinenode(p,ptree(pprocdef(p^.procdefinition)^.code))
  969. else
  970. CGMessage(cg_e_no_code_for_inline_stored);
  971. if assigned(inlinecode) then
  972. begin
  973. { consider it has not inlined if called
  974. again inside the args }
  975. {$ifdef INCLUDEOK}
  976. exclude(p^.procdefinition^.proccalloptions,pocall_inline);
  977. {$else}
  978. p^.procdefinition^.proccalloptions:=p^.procdefinition^.proccalloptions-[pocall_inline];
  979. {$endif}
  980. firstpass(inlinecode);
  981. inlined:=true;
  982. end;
  983. end;
  984. end
  985. else
  986. procinfo.flags:=procinfo.flags or pi_do_call;
  987. { work trough all parameters to insert the type conversions }
  988. { !!! done now after internproc !! (PM) }
  989. if assigned(p^.left) then
  990. begin
  991. old_count_ref:=count_ref;
  992. count_ref:=true;
  993. firstcallparan(p^.left,p^.procdefinition^.para1);
  994. count_ref:=old_count_ref;
  995. end;
  996. {$ifdef i386}
  997. for regi:=R_EAX to R_EDI do
  998. begin
  999. if (pprocdef(p^.procdefinition)^.usedregisters and ($80 shr word(regi)))<>0 then
  1000. inc(reg_pushes[regi],t_times*2);
  1001. end;
  1002. {$endif}
  1003. {$ifdef m68k}
  1004. for regi:=R_D0 to R_A6 do
  1005. begin
  1006. if (pprocdef(p^.procdefinition)^.usedregisters and ($800 shr word(regi)))<>0 then
  1007. inc(reg_pushes[regi],t_times*2);
  1008. end;
  1009. {$endif}
  1010. end;
  1011. { ensure that the result type is set }
  1012. p^.resulttype:=p^.procdefinition^.retdef;
  1013. { get a register for the return value }
  1014. if (p^.resulttype<>pdef(voiddef)) then
  1015. begin
  1016. if (p^.procdefinition^.proctypeoption=potype_constructor) then
  1017. begin
  1018. { extra handling of classes }
  1019. { p^.methodpointer should be assigned! }
  1020. if assigned(p^.methodpointer) and assigned(p^.methodpointer^.resulttype) and
  1021. (p^.methodpointer^.resulttype^.deftype=classrefdef) then
  1022. begin
  1023. p^.location.loc:=LOC_REGISTER;
  1024. p^.registers32:=1;
  1025. { the result type depends on the classref }
  1026. p^.resulttype:=pclassrefdef(p^.methodpointer^.resulttype)^.definition;
  1027. end
  1028. { a object constructor returns the result with the flags }
  1029. else
  1030. p^.location.loc:=LOC_FLAGS;
  1031. end
  1032. else
  1033. begin
  1034. {$ifdef SUPPORT_MMX}
  1035. if (cs_mmx in aktlocalswitches) and
  1036. is_mmx_able_array(p^.resulttype) then
  1037. begin
  1038. p^.location.loc:=LOC_MMXREGISTER;
  1039. p^.registersmmx:=1;
  1040. end
  1041. else
  1042. {$endif SUPPORT_MMX}
  1043. if ret_in_acc(p^.resulttype) then
  1044. begin
  1045. p^.location.loc:=LOC_REGISTER;
  1046. if is_64bitint(p^.resulttype) then
  1047. p^.registers32:=2
  1048. else
  1049. p^.registers32:=1;
  1050. { wide- and ansistrings are returned in EAX }
  1051. { but they are imm. moved to a memory location }
  1052. if is_widestring(p^.resulttype) or
  1053. is_ansistring(p^.resulttype) then
  1054. begin
  1055. p^.location.loc:=LOC_MEM;
  1056. { this is wrong we still need one register PM
  1057. p^.registers32:=0; }
  1058. p^.registers32:=1;
  1059. end;
  1060. end
  1061. else if (p^.resulttype^.deftype=floatdef) then
  1062. begin
  1063. p^.location.loc:=LOC_FPU;
  1064. p^.registersfpu:=1;
  1065. end
  1066. end;
  1067. end;
  1068. { a fpu can be used in any procedure !! }
  1069. p^.registersfpu:=p^.procdefinition^.fpu_used;
  1070. { if this is a call to a method calc the registers }
  1071. if (p^.methodpointer<>nil) then
  1072. begin
  1073. case p^.methodpointer^.treetype of
  1074. { but only, if this is not a supporting node }
  1075. typen: ;
  1076. { we need one register for new return value PM }
  1077. hnewn : if p^.registers32=0 then
  1078. p^.registers32:=1;
  1079. else
  1080. begin
  1081. if (p^.procdefinition^.proctypeoption in [potype_constructor,potype_destructor]) and
  1082. assigned(p^.symtable) and (p^.symtable^.symtabletype=withsymtable) and
  1083. not pwithsymtable(p^.symtable)^.direct_with then
  1084. begin
  1085. CGmessage(cg_e_cannot_call_cons_dest_inside_with);
  1086. end; { Is accepted by Delphi !! }
  1087. { this is not a good reason to accept it in FPC if we produce
  1088. wrong code for it !!! (PM) }
  1089. { R.Assign is not a constructor !!! }
  1090. { but for R^.Assign, R must be valid !! }
  1091. if (p^.procdefinition^.proctypeoption=potype_constructor) or
  1092. ((p^.methodpointer^.treetype=loadn) and
  1093. (not(oo_has_virtual in pobjectdef(p^.methodpointer^.resulttype)^.objectoptions))) then
  1094. must_be_valid:=false
  1095. else
  1096. must_be_valid:=true;
  1097. firstpass(p^.methodpointer);
  1098. p^.registersfpu:=max(p^.methodpointer^.registersfpu,p^.registersfpu);
  1099. p^.registers32:=max(p^.methodpointer^.registers32,p^.registers32);
  1100. {$ifdef SUPPORT_MMX}
  1101. p^.registersmmx:=max(p^.methodpointer^.registersmmx,p^.registersmmx);
  1102. {$endif SUPPORT_MMX}
  1103. end;
  1104. end;
  1105. end;
  1106. if inlined then
  1107. p^.right:=inlinecode;
  1108. { determine the registers of the procedure variable }
  1109. { is this OK for inlined procs also ?? (PM) }
  1110. if assigned(p^.right) then
  1111. begin
  1112. p^.registersfpu:=max(p^.right^.registersfpu,p^.registersfpu);
  1113. p^.registers32:=max(p^.right^.registers32,p^.registers32);
  1114. {$ifdef SUPPORT_MMX}
  1115. p^.registersmmx:=max(p^.right^.registersmmx,p^.registersmmx);
  1116. {$endif SUPPORT_MMX}
  1117. end;
  1118. { determine the registers of the procedure }
  1119. if assigned(p^.left) then
  1120. begin
  1121. p^.registersfpu:=max(p^.left^.registersfpu,p^.registersfpu);
  1122. p^.registers32:=max(p^.left^.registers32,p^.registers32);
  1123. {$ifdef SUPPORT_MMX}
  1124. p^.registersmmx:=max(p^.left^.registersmmx,p^.registersmmx);
  1125. {$endif SUPPORT_MMX}
  1126. end;
  1127. errorexit:
  1128. { Reset some settings back }
  1129. if assigned(procs) then
  1130. dispose(procs);
  1131. if inlined then
  1132. {$ifdef INCLUDEOK}
  1133. include(p^.procdefinition^.proccalloptions,pocall_inline);
  1134. {$else}
  1135. p^.procdefinition^.proccalloptions:=p^.procdefinition^.proccalloptions+[pocall_inline];
  1136. {$endif}
  1137. aktcallprocsym:=oldcallprocsym;
  1138. must_be_valid:=store_valid;
  1139. end;
  1140. {*****************************************************************************
  1141. FirstProcInlineN
  1142. *****************************************************************************}
  1143. procedure firstprocinline(var p : ptree);
  1144. begin
  1145. { left contains the code in tree form }
  1146. { but it has already been firstpassed }
  1147. { so firstpass(p^.left); does not seem required }
  1148. { might be required later if we change the arg handling !! }
  1149. end;
  1150. end.
  1151. {
  1152. $Log$
  1153. Revision 1.62 1999-08-23 23:42:52 pierre
  1154. * hnewn reg allocation corrected
  1155. Revision 1.61 1999/08/17 13:26:08 peter
  1156. * arrayconstructor -> arrayofconst fixed when arraycosntructor was not
  1157. variant.
  1158. Revision 1.60 1999/08/16 23:23:39 peter
  1159. * arrayconstructor -> openarray type conversions for element types
  1160. Revision 1.59 1999/08/13 21:33:16 peter
  1161. * support for array constructors extended and more error checking
  1162. Revision 1.58 1999/08/12 14:34:28 peter
  1163. * tp_procvar mode call->loadn fixed
  1164. Revision 1.57 1999/08/05 16:53:19 peter
  1165. * V_Fatal=1, all other V_ are also increased
  1166. * Check for local procedure when assigning procvar
  1167. * fixed comment parsing because directives
  1168. * oldtp mode directives better supported
  1169. * added some messages to errore.msg
  1170. Revision 1.56 1999/08/04 00:23:34 florian
  1171. * renamed i386asm and i386base to cpuasm and cpubase
  1172. Revision 1.55 1999/08/03 22:03:27 peter
  1173. * moved bitmask constants to sets
  1174. * some other type/const renamings
  1175. Revision 1.54 1999/07/01 21:33:58 peter
  1176. * merged
  1177. Revision 1.53 1999/06/29 14:02:33 peter
  1178. * merged file pos fixes
  1179. Revision 1.52 1999/06/29 12:16:22 pierre
  1180. * mereg from fixes-0_99_12
  1181. Revision 1.51.2.3 1999/07/01 21:32:01 peter
  1182. * procvar fixes again
  1183. Revision 1.51.2.2 1999/06/29 12:12:13 pierre
  1184. * fix for bug0272
  1185. Revision 1.51.2.1 1999/06/28 00:33:47 pierre
  1186. * better error position bug0269
  1187. Revision 1.51 1999/06/01 19:27:57 peter
  1188. * better checks for procvar and methodpointer
  1189. Revision 1.50 1999/06/01 14:46:00 peter
  1190. * @procvar is now always needed for FPC
  1191. Revision 1.49 1999/05/31 20:34:51 peter
  1192. * fixed hightree generation when loading highSYM
  1193. Revision 1.48 1999/05/27 19:45:13 peter
  1194. * removed oldasm
  1195. * plabel -> pasmlabel
  1196. * -a switches to source writing automaticly
  1197. * assembler readers OOPed
  1198. * asmsymbol automaticly external
  1199. * jumptables and other label fixes for asm readers
  1200. Revision 1.47 1999/05/23 18:42:19 florian
  1201. * better error recovering in typed constants
  1202. * some problems with arrays of const fixed, some problems
  1203. due my previous
  1204. - the location type of array constructor is now LOC_MEM
  1205. - the pushing of high fixed
  1206. - parameter copying fixed
  1207. - zero temp. allocation removed
  1208. * small problem in the assembler writers fixed:
  1209. ref to nil wasn't written correctly
  1210. Revision 1.46 1999/05/20 14:58:27 peter
  1211. * fixed arrayconstruct->set conversion which didn't work for enum sets
  1212. Revision 1.45 1999/05/19 10:31:54 florian
  1213. * two bugs reported by Romio (bugs 13) are fixed:
  1214. - empty array constructors are now handled correctly (e.g. for sysutils.format)
  1215. - comparsion of ansistrings was sometimes coded wrong
  1216. Revision 1.44 1999/05/18 21:58:33 florian
  1217. * fixed some bugs related to temp. ansistrings and functions results
  1218. which return records/objects/arrays which need init/final.
  1219. Revision 1.43 1999/05/18 14:15:58 peter
  1220. * containsself fixes
  1221. * checktypes()
  1222. Revision 1.42 1999/05/17 23:51:43 peter
  1223. * with temp vars now use a reference with a persistant temp instead
  1224. of setting datasize
  1225. Revision 1.41 1999/05/13 21:59:50 peter
  1226. * removed oldppu code
  1227. * warning if objpas is loaded from uses
  1228. * first things for new deref writing
  1229. Revision 1.40 1999/05/10 09:01:45 peter
  1230. * small message fixes
  1231. Revision 1.39 1999/05/02 09:35:46 florian
  1232. + method message handlers which contain an explicit self can't be called
  1233. directly anymore
  1234. + self is now loaded at the start of the an message handler with an explicit
  1235. self
  1236. + $useoverlay fixed: i386 was renamed to i386base
  1237. Revision 1.38 1999/05/01 13:24:47 peter
  1238. * merged nasm compiler
  1239. * old asm moved to oldasm/
  1240. Revision 1.37 1999/04/26 13:31:57 peter
  1241. * release storenumber,double_checksum
  1242. Revision 1.36 1999/04/26 09:30:46 peter
  1243. * small tp7 fix
  1244. * fix void pointer with formaldef
  1245. Revision 1.35 1999/04/21 21:49:18 pierre
  1246. * previous log corrected
  1247. Revision 1.34 1999/04/21 16:31:46 pierre
  1248. * checks for untyped var or const args
  1249. (refuse procsyms as var, types or voiddef as const)
  1250. Revision 1.33 1999/04/21 09:44:00 peter
  1251. * storenumber works
  1252. * fixed some typos in double_checksum
  1253. + incompatible types type1 and type2 message (with storenumber)
  1254. Revision 1.32 1999/04/14 09:11:22 peter
  1255. * fixed tp proc -> procvar
  1256. Revision 1.31 1999/04/01 21:59:56 peter
  1257. * type error for array constructor with array,record as argument
  1258. Revision 1.30 1999/03/31 13:55:27 peter
  1259. * assembler inlining working for ag386bin
  1260. Revision 1.29 1999/03/24 23:17:34 peter
  1261. * fixed bugs 212,222,225,227,229,231,233
  1262. Revision 1.28 1999/03/23 14:43:03 peter
  1263. * fixed crash with array of const in procvar
  1264. Revision 1.27 1999/03/19 17:31:54 pierre
  1265. * lost reference because refcount not increased fixed
  1266. Revision 1.26 1999/03/02 18:24:22 peter
  1267. * fixed overloading of array of char
  1268. Revision 1.25 1999/02/22 15:09:44 florian
  1269. * behaviaor of PROTECTED and PRIVATE fixed, works now like TP/Delphi
  1270. Revision 1.24 1999/02/22 02:15:45 peter
  1271. * updates for ag386bin
  1272. Revision 1.23 1999/02/09 17:15:52 florian
  1273. * some false warnings "function result doesn't seems to be set" are
  1274. avoided
  1275. Revision 1.22 1999/01/29 11:34:55 pierre
  1276. + better info for impossible type conversion in calln
  1277. Revision 1.21 1999/01/21 22:10:49 peter
  1278. * fixed array of const
  1279. * generic platform independent high() support
  1280. Revision 1.20 1999/01/21 16:41:06 pierre
  1281. * fix for constructor inside with statements
  1282. Revision 1.19 1999/01/19 14:20:16 peter
  1283. * fixed [char] crash
  1284. Revision 1.18 1999/01/12 14:25:40 peter
  1285. + BrowserLog for browser.log generation
  1286. + BrowserCol for browser info in TCollections
  1287. * released all other UseBrowser
  1288. Revision 1.17 1998/12/11 00:03:52 peter
  1289. + globtype,tokens,version unit splitted from globals
  1290. Revision 1.16 1998/12/10 14:57:52 pierre
  1291. * fix for operators
  1292. Revision 1.15 1998/12/10 09:47:32 florian
  1293. + basic operations with int64/qord (compiler with -dint64)
  1294. + rtti of enumerations extended: names are now written
  1295. Revision 1.14 1998/11/27 14:50:52 peter
  1296. + open strings, $P switch support
  1297. Revision 1.13 1998/11/24 17:03:51 peter
  1298. * fixed exactmatch removings
  1299. Revision 1.12 1998/11/16 10:18:10 peter
  1300. * fixes for ansistrings
  1301. Revision 1.11 1998/11/10 10:09:17 peter
  1302. * va_list -> array of const
  1303. Revision 1.10 1998/11/09 11:44:41 peter
  1304. + va_list for printf support
  1305. Revision 1.9 1998/10/28 18:26:22 pierre
  1306. * removed some erros after other errors (introduced by useexcept)
  1307. * stabs works again correctly (for how long !)
  1308. Revision 1.8 1998/10/09 16:36:09 pierre
  1309. * some memory leaks specific to usebrowser define fixed
  1310. * removed tmodule.implsymtable (was like tmodule.localsymtable)
  1311. Revision 1.7 1998/10/06 20:49:09 peter
  1312. * m68k compiler compiles again
  1313. Revision 1.6 1998/10/02 09:24:22 peter
  1314. * more constant expression evaluators
  1315. Revision 1.5 1998/09/28 11:22:17 pierre
  1316. * did not compile for browser
  1317. * merge from fixes
  1318. Revision 1.4 1998/09/27 10:16:24 florian
  1319. * type casts pchar<->ansistring fixed
  1320. * ansistring[..] calls does now an unique call
  1321. Revision 1.3 1998/09/24 14:27:40 peter
  1322. * some better support for openarray
  1323. Revision 1.2 1998/09/24 09:02:16 peter
  1324. * rewritten isconvertable to use case
  1325. * array of .. and single variable are compatible
  1326. Revision 1.1 1998/09/23 20:42:24 peter
  1327. * splitted pass_1
  1328. }