tcinl.pas 56 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386
  1. {
  2. $Id$
  3. Copyright (c) 1998-2000 by Florian Klaempfl
  4. Type checking and register allocation for inline 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 tcinl;
  19. interface
  20. uses
  21. tree;
  22. procedure firstinline(var p : ptree);
  23. implementation
  24. uses
  25. cobjects,verbose,globals,systems,
  26. globtype,
  27. symconst,symtable,aasm,types,
  28. htypechk,pass_1,
  29. tccal,cpubase
  30. {$ifdef newcg}
  31. ,cgbase
  32. ,tgobj
  33. ,tgcpu
  34. {$else newcg}
  35. ,hcodegen
  36. {$ifdef i386}
  37. ,tgeni386
  38. {$endif}
  39. {$endif newcg}
  40. ;
  41. {*****************************************************************************
  42. FirstInLine
  43. *****************************************************************************}
  44. {$ifdef fpc}
  45. {$maxfpuregisters 0}
  46. {$endif fpc}
  47. procedure firstinline(var p : ptree);
  48. var
  49. vl,vl2 : longint;
  50. vr : bestreal;
  51. p1,hp,hpp : ptree;
  52. {$ifndef NOCOLONCHECK}
  53. frac_para,length_para : ptree;
  54. {$endif ndef NOCOLONCHECK}
  55. extra_register,
  56. isreal,
  57. dowrite,
  58. file_is_typed : boolean;
  59. procedure do_lowhigh(adef : pdef);
  60. var
  61. v : longint;
  62. enum : penumsym;
  63. begin
  64. case Adef^.deftype of
  65. orddef:
  66. begin
  67. if p^.inlinenumber=in_low_x then
  68. v:=porddef(Adef)^.low
  69. else
  70. v:=porddef(Adef)^.high;
  71. hp:=genordinalconstnode(v,adef);
  72. firstpass(hp);
  73. disposetree(p);
  74. p:=hp;
  75. end;
  76. enumdef:
  77. begin
  78. enum:=Penumdef(Adef)^.firstenum;
  79. if p^.inlinenumber=in_high_x then
  80. while enum^.nextenum<>nil do
  81. enum:=enum^.nextenum;
  82. hp:=genenumnode(enum);
  83. disposetree(p);
  84. p:=hp;
  85. end;
  86. else
  87. internalerror(87);
  88. end;
  89. end;
  90. function getconstrealvalue : bestreal;
  91. begin
  92. case p^.left^.treetype of
  93. ordconstn:
  94. getconstrealvalue:=p^.left^.value;
  95. realconstn:
  96. getconstrealvalue:=p^.left^.value_real;
  97. else
  98. internalerror(309992);
  99. end;
  100. end;
  101. procedure setconstrealvalue(r : bestreal);
  102. var
  103. hp : ptree;
  104. begin
  105. hp:=genrealconstnode(r,bestrealdef^);
  106. disposetree(p);
  107. p:=hp;
  108. firstpass(p);
  109. end;
  110. procedure handleextendedfunction;
  111. begin
  112. p^.location.loc:=LOC_FPU;
  113. p^.resulttype:=s80floatdef;
  114. { redo firstpass for varstate status PM }
  115. set_varstate(p^.left,true);
  116. if (p^.left^.resulttype^.deftype<>floatdef) or
  117. (pfloatdef(p^.left^.resulttype)^.typ<>s80real) then
  118. begin
  119. p^.left:=gentypeconvnode(p^.left,s80floatdef);
  120. firstpass(p^.left);
  121. end;
  122. p^.registers32:=p^.left^.registers32;
  123. p^.registersfpu:=p^.left^.registersfpu;
  124. {$ifdef SUPPORT_MMX}
  125. p^.registersmmx:=p^.left^.registersmmx;
  126. {$endif SUPPORT_MMX}
  127. end;
  128. begin
  129. { if we handle writeln; p^.left contains no valid address }
  130. if assigned(p^.left) then
  131. begin
  132. if p^.left^.treetype=callparan then
  133. firstcallparan(p^.left,nil,false)
  134. else
  135. firstpass(p^.left);
  136. left_right_max(p);
  137. set_location(p^.location,p^.left^.location);
  138. end;
  139. inc(parsing_para_level);
  140. { handle intern constant functions in separate case }
  141. if p^.inlineconst then
  142. begin
  143. hp:=nil;
  144. { no parameters? }
  145. if not assigned(p^.left) then
  146. begin
  147. case p^.inlinenumber of
  148. in_const_pi :
  149. hp:=genrealconstnode(pi,bestrealdef^);
  150. else
  151. internalerror(89);
  152. end;
  153. end
  154. else
  155. { process constant expression with parameter }
  156. begin
  157. vl:=0;
  158. vl2:=0; { second parameter Ex: ptr(vl,vl2) }
  159. vr:=0;
  160. isreal:=false;
  161. case p^.left^.treetype of
  162. realconstn :
  163. begin
  164. isreal:=true;
  165. vr:=p^.left^.value_real;
  166. end;
  167. ordconstn :
  168. vl:=p^.left^.value;
  169. callparan :
  170. begin
  171. { both exists, else it was not generated }
  172. vl:=p^.left^.left^.value;
  173. vl2:=p^.left^.right^.left^.value;
  174. end;
  175. else
  176. CGMessage(cg_e_illegal_expression);
  177. end;
  178. case p^.inlinenumber of
  179. in_const_trunc :
  180. begin
  181. if isreal then
  182. begin
  183. if (vr>=2147483648.0) or (vr<=-2147483649.0) then
  184. begin
  185. CGMessage(parser_e_range_check_error);
  186. hp:=genordinalconstnode(1,s32bitdef)
  187. end
  188. else
  189. hp:=genordinalconstnode(trunc(vr),s32bitdef)
  190. end
  191. else
  192. hp:=genordinalconstnode(trunc(vl),s32bitdef);
  193. end;
  194. in_const_round :
  195. begin
  196. if isreal then
  197. begin
  198. if (vr>=2147483647.5) or (vr<=-2147483648.5) then
  199. begin
  200. CGMessage(parser_e_range_check_error);
  201. hp:=genordinalconstnode(1,s32bitdef)
  202. end
  203. else
  204. hp:=genordinalconstnode(round(vr),s32bitdef)
  205. end
  206. else
  207. hp:=genordinalconstnode(round(vl),s32bitdef);
  208. end;
  209. in_const_frac :
  210. begin
  211. if isreal then
  212. hp:=genrealconstnode(frac(vr),bestrealdef^)
  213. else
  214. hp:=genrealconstnode(frac(vl),bestrealdef^);
  215. end;
  216. in_const_int :
  217. begin
  218. if isreal then
  219. hp:=genrealconstnode(int(vr),bestrealdef^)
  220. else
  221. hp:=genrealconstnode(int(vl),bestrealdef^);
  222. end;
  223. in_const_abs :
  224. begin
  225. if isreal then
  226. hp:=genrealconstnode(abs(vr),bestrealdef^)
  227. else
  228. hp:=genordinalconstnode(abs(vl),p^.left^.resulttype);
  229. end;
  230. in_const_sqr :
  231. begin
  232. if isreal then
  233. hp:=genrealconstnode(sqr(vr),bestrealdef^)
  234. else
  235. hp:=genordinalconstnode(sqr(vl),p^.left^.resulttype);
  236. end;
  237. in_const_odd :
  238. begin
  239. if isreal then
  240. CGMessage1(type_e_integer_expr_expected,p^.left^.resulttype^.typename)
  241. else
  242. hp:=genordinalconstnode(byte(odd(vl)),booldef);
  243. end;
  244. in_const_swap_word :
  245. begin
  246. if isreal then
  247. CGMessage1(type_e_integer_expr_expected,p^.left^.resulttype^.typename)
  248. else
  249. hp:=genordinalconstnode((vl and $ff) shl 8+(vl shr 8),p^.left^.resulttype);
  250. end;
  251. in_const_swap_long :
  252. begin
  253. if isreal then
  254. CGMessage(type_e_mismatch)
  255. else
  256. hp:=genordinalconstnode((vl and $ffff) shl 16+(vl shr 16),p^.left^.resulttype);
  257. end;
  258. in_const_ptr :
  259. begin
  260. if isreal then
  261. CGMessage(type_e_mismatch)
  262. else
  263. hp:=genordinalconstnode((vl2 shl 16) or vl,voidpointerdef);
  264. end;
  265. in_const_sqrt :
  266. begin
  267. if isreal then
  268. begin
  269. if vr<0.0 then
  270. CGMessage(type_e_wrong_math_argument)
  271. else
  272. hp:=genrealconstnode(sqrt(vr),bestrealdef^)
  273. end
  274. else
  275. begin
  276. if vl<0 then
  277. CGMessage(type_e_wrong_math_argument)
  278. else
  279. hp:=genrealconstnode(sqrt(vl),bestrealdef^);
  280. end;
  281. end;
  282. in_const_arctan :
  283. begin
  284. if isreal then
  285. hp:=genrealconstnode(arctan(vr),bestrealdef^)
  286. else
  287. hp:=genrealconstnode(arctan(vl),bestrealdef^);
  288. end;
  289. in_const_cos :
  290. begin
  291. if isreal then
  292. hp:=genrealconstnode(cos(vr),bestrealdef^)
  293. else
  294. hp:=genrealconstnode(cos(vl),bestrealdef^);
  295. end;
  296. in_const_sin :
  297. begin
  298. if isreal then
  299. hp:=genrealconstnode(sin(vr),bestrealdef^)
  300. else
  301. hp:=genrealconstnode(sin(vl),bestrealdef^);
  302. end;
  303. in_const_exp :
  304. begin
  305. if isreal then
  306. hp:=genrealconstnode(exp(vr),bestrealdef^)
  307. else
  308. hp:=genrealconstnode(exp(vl),bestrealdef^);
  309. end;
  310. in_const_ln :
  311. begin
  312. if isreal then
  313. begin
  314. if vr<=0.0 then
  315. CGMessage(type_e_wrong_math_argument)
  316. else
  317. hp:=genrealconstnode(ln(vr),bestrealdef^)
  318. end
  319. else
  320. begin
  321. if vl<=0 then
  322. CGMessage(type_e_wrong_math_argument)
  323. else
  324. hp:=genrealconstnode(ln(vl),bestrealdef^);
  325. end;
  326. end;
  327. else
  328. internalerror(88);
  329. end;
  330. end;
  331. disposetree(p);
  332. if hp=nil then
  333. hp:=genzeronode(errorn);
  334. firstpass(hp);
  335. p:=hp;
  336. end
  337. else
  338. begin
  339. case p^.inlinenumber of
  340. in_lo_qword,
  341. in_hi_qword,
  342. in_lo_long,
  343. in_hi_long,
  344. in_lo_word,
  345. in_hi_word:
  346. begin
  347. set_varstate(p^.left,true);
  348. if p^.registers32<1 then
  349. p^.registers32:=1;
  350. if p^.inlinenumber in [in_lo_word,in_hi_word] then
  351. p^.resulttype:=u8bitdef
  352. else if p^.inlinenumber in [in_lo_qword,in_hi_qword] then
  353. begin
  354. p^.resulttype:=u32bitdef;
  355. if (m_tp in aktmodeswitches) or
  356. (m_delphi in aktmodeswitches) then
  357. CGMessage(type_w_maybe_wrong_hi_lo);
  358. end
  359. else
  360. begin
  361. p^.resulttype:=u16bitdef;
  362. if (m_tp in aktmodeswitches) or
  363. (m_delphi in aktmodeswitches) then
  364. CGMessage(type_w_maybe_wrong_hi_lo);
  365. end;
  366. p^.location.loc:=LOC_REGISTER;
  367. if not is_integer(p^.left^.resulttype) then
  368. CGMessage(type_e_mismatch)
  369. else
  370. begin
  371. if p^.left^.treetype=ordconstn then
  372. begin
  373. case p^.inlinenumber of
  374. in_lo_word : hp:=genordinalconstnode(p^.left^.value and $ff,p^.left^.resulttype);
  375. in_hi_word : hp:=genordinalconstnode(p^.left^.value shr 8,p^.left^.resulttype);
  376. in_lo_long : hp:=genordinalconstnode(p^.left^.value and $ffff,p^.left^.resulttype);
  377. in_hi_long : hp:=genordinalconstnode(p^.left^.value shr 16,p^.left^.resulttype);
  378. in_lo_qword : hp:=genordinalconstnode(p^.left^.value and $ffffffff,p^.left^.resulttype);
  379. in_hi_qword : hp:=genordinalconstnode(p^.left^.value shr 32,p^.left^.resulttype);
  380. end;
  381. disposetree(p);
  382. firstpass(hp);
  383. p:=hp;
  384. end;
  385. end;
  386. end;
  387. in_sizeof_x:
  388. begin
  389. set_varstate(p^.left,false);
  390. if push_high_param(p^.left^.resulttype) then
  391. begin
  392. getsymonlyin(p^.left^.symtable,'high'+pvarsym(p^.left^.symtableentry)^.name);
  393. hp:=gennode(addn,genloadnode(pvarsym(srsym),p^.left^.symtable),
  394. genordinalconstnode(1,s32bitdef));
  395. if (p^.left^.resulttype^.deftype=arraydef) and
  396. (parraydef(p^.left^.resulttype)^.elesize<>1) then
  397. hp:=gennode(muln,hp,genordinalconstnode(parraydef(p^.left^.resulttype)^.elesize,s32bitdef));
  398. disposetree(p);
  399. p:=hp;
  400. firstpass(p);
  401. end;
  402. if p^.registers32<1 then
  403. p^.registers32:=1;
  404. p^.resulttype:=s32bitdef;
  405. p^.location.loc:=LOC_REGISTER;
  406. end;
  407. in_typeof_x:
  408. begin
  409. set_varstate(p^.left,false);
  410. if p^.registers32<1 then
  411. p^.registers32:=1;
  412. p^.location.loc:=LOC_REGISTER;
  413. p^.resulttype:=voidpointerdef;
  414. end;
  415. in_ord_x:
  416. begin
  417. set_varstate(p^.left,true);
  418. if (p^.left^.treetype=ordconstn) then
  419. begin
  420. hp:=genordinalconstnode(p^.left^.value,s32bitdef);
  421. disposetree(p);
  422. p:=hp;
  423. firstpass(p);
  424. end
  425. else
  426. begin
  427. if (p^.left^.resulttype^.deftype=orddef) then
  428. if (porddef(p^.left^.resulttype)^.typ in [uchar,bool8bit]) then
  429. begin
  430. if porddef(p^.left^.resulttype)^.typ=bool8bit then
  431. begin
  432. hp:=gentypeconvnode(p^.left,u8bitdef);
  433. putnode(p);
  434. p:=hp;
  435. p^.convtyp:=tc_bool_2_int;
  436. p^.explizit:=true;
  437. firstpass(p);
  438. end
  439. else
  440. begin
  441. hp:=gentypeconvnode(p^.left,u8bitdef);
  442. putnode(p);
  443. p:=hp;
  444. p^.explizit:=true;
  445. firstpass(p);
  446. end;
  447. end
  448. { can this happen ? }
  449. else if (porddef(p^.left^.resulttype)^.typ=uvoid) then
  450. CGMessage(type_e_mismatch)
  451. else
  452. { all other orddef need no transformation }
  453. begin
  454. hp:=p^.left;
  455. putnode(p);
  456. p:=hp;
  457. end
  458. else if (p^.left^.resulttype^.deftype=enumdef) then
  459. begin
  460. hp:=gentypeconvnode(p^.left,s32bitdef);
  461. putnode(p);
  462. p:=hp;
  463. p^.explizit:=true;
  464. firstpass(p);
  465. end
  466. else
  467. begin
  468. { can anything else be ord() ?}
  469. CGMessage(type_e_mismatch);
  470. end;
  471. end;
  472. end;
  473. in_chr_byte:
  474. begin
  475. set_varstate(p^.left,true);
  476. hp:=gentypeconvnode(p^.left,cchardef);
  477. putnode(p);
  478. p:=hp;
  479. p^.explizit:=true;
  480. firstpass(p);
  481. end;
  482. in_length_string:
  483. begin
  484. set_varstate(p^.left,true);
  485. if is_ansistring(p^.left^.resulttype) then
  486. p^.resulttype:=s32bitdef
  487. else
  488. p^.resulttype:=u8bitdef;
  489. { we don't need string conversations here }
  490. if (p^.left^.treetype=typeconvn) and
  491. (p^.left^.left^.resulttype^.deftype=stringdef) then
  492. begin
  493. hp:=p^.left^.left;
  494. putnode(p^.left);
  495. p^.left:=hp;
  496. end;
  497. { check the type, must be string or char }
  498. if (p^.left^.resulttype^.deftype<>stringdef) and
  499. (not is_char(p^.left^.resulttype)) then
  500. CGMessage(type_e_mismatch);
  501. { evaluates length of constant strings direct }
  502. if (p^.left^.treetype=stringconstn) then
  503. begin
  504. hp:=genordinalconstnode(p^.left^.length,s32bitdef);
  505. disposetree(p);
  506. firstpass(hp);
  507. p:=hp;
  508. end
  509. { length of char is one allways }
  510. else if is_constcharnode(p^.left) then
  511. begin
  512. hp:=genordinalconstnode(1,s32bitdef);
  513. disposetree(p);
  514. firstpass(hp);
  515. p:=hp;
  516. end;
  517. end;
  518. in_assigned_x:
  519. begin
  520. set_varstate(p^.left,true);
  521. p^.resulttype:=booldef;
  522. p^.location.loc:=LOC_FLAGS;
  523. end;
  524. in_ofs_x,
  525. in_seg_x :
  526. set_varstate(p^.left,false);
  527. in_pred_x,
  528. in_succ_x:
  529. begin
  530. p^.resulttype:=p^.left^.resulttype;
  531. if is_64bitint(p^.resulttype) then
  532. begin
  533. if (p^.registers32<2) then
  534. p^.registers32:=2
  535. end
  536. else
  537. begin
  538. if (p^.registers32<1) then
  539. p^.registers32:=1;
  540. end;
  541. p^.location.loc:=LOC_REGISTER;
  542. set_varstate(p^.left,true);
  543. if not is_ordinal(p^.resulttype) then
  544. CGMessage(type_e_ordinal_expr_expected)
  545. else
  546. begin
  547. if (p^.resulttype^.deftype=enumdef) and
  548. (penumdef(p^.resulttype)^.has_jumps) then
  549. CGMessage(type_e_succ_and_pred_enums_with_assign_not_possible)
  550. else
  551. if p^.left^.treetype=ordconstn then
  552. begin
  553. if p^.inlinenumber=in_succ_x then
  554. hp:=genordinalconstnode(p^.left^.value+1,p^.left^.resulttype)
  555. else
  556. hp:=genordinalconstnode(p^.left^.value-1,p^.left^.resulttype);
  557. disposetree(p);
  558. firstpass(hp);
  559. p:=hp;
  560. end;
  561. end;
  562. end;
  563. in_inc_x,
  564. in_dec_x:
  565. begin
  566. p^.resulttype:=voiddef;
  567. if assigned(p^.left) then
  568. begin
  569. firstcallparan(p^.left,nil,true);
  570. set_varstate(p^.left,true);
  571. if codegenerror then
  572. exit;
  573. { first param must be var }
  574. valid_for_assign(p^.left^.left,false);
  575. { check type }
  576. if (p^.left^.resulttype^.deftype in [enumdef,pointerdef]) or
  577. is_ordinal(p^.left^.resulttype) then
  578. begin
  579. { two paras ? }
  580. if assigned(p^.left^.right) then
  581. begin
  582. { insert a type conversion }
  583. { the second param is always longint }
  584. p^.left^.right^.left:=gentypeconvnode(p^.left^.right^.left,s32bitdef);
  585. { check the type conversion }
  586. firstpass(p^.left^.right^.left);
  587. { need we an additional register ? }
  588. if not(is_constintnode(p^.left^.right^.left)) and
  589. (p^.left^.right^.left^.location.loc in [LOC_MEM,LOC_REFERENCE]) and
  590. (p^.left^.right^.left^.registers32<=1) then
  591. inc(p^.registers32);
  592. { do we need an additional register to restore the first parameter? }
  593. if p^.left^.right^.left^.registers32>=p^.registers32 then
  594. inc(p^.registers32);
  595. if assigned(p^.left^.right^.right) then
  596. CGMessage(cg_e_illegal_expression);
  597. end;
  598. end
  599. else
  600. CGMessage(type_e_ordinal_expr_expected);
  601. end
  602. else
  603. CGMessage(type_e_mismatch);
  604. end;
  605. in_read_x,
  606. in_readln_x,
  607. in_write_x,
  608. in_writeln_x :
  609. begin
  610. { needs a call }
  611. procinfo^.flags:=procinfo^.flags or pi_do_call;
  612. p^.resulttype:=voiddef;
  613. { true, if readln needs an extra register }
  614. extra_register:=false;
  615. { we must know if it is a typed file or not }
  616. { but we must first do the firstpass for it }
  617. file_is_typed:=false;
  618. if assigned(p^.left) then
  619. begin
  620. dowrite:=(p^.inlinenumber in [in_write_x,in_writeln_x]);
  621. firstcallparan(p^.left,nil,true);
  622. set_varstate(p^.left,dowrite);
  623. { now we can check }
  624. hp:=p^.left;
  625. while assigned(hp^.right) do
  626. hp:=hp^.right;
  627. { if resulttype is not assigned, then automatically }
  628. { file is not typed. }
  629. if assigned(hp) and assigned(hp^.resulttype) then
  630. Begin
  631. if (hp^.resulttype^.deftype=filedef) and
  632. (pfiledef(hp^.resulttype)^.filetyp=ft_typed) then
  633. begin
  634. file_is_typed:=true;
  635. { test the type }
  636. hpp:=p^.left;
  637. while (hpp<>hp) do
  638. begin
  639. if (hpp^.left^.treetype=typen) then
  640. CGMessage(type_e_cant_read_write_type);
  641. if not is_equal(hpp^.resulttype,pfiledef(hp^.resulttype)^.typedfiletype.def) then
  642. CGMessage(type_e_mismatch);
  643. { generate the high() value for the shortstring }
  644. if ((not dowrite) and is_shortstring(hpp^.left^.resulttype)) or
  645. (is_chararray(hpp^.left^.resulttype)) then
  646. gen_high_tree(hpp,true);
  647. hpp:=hpp^.right;
  648. end;
  649. end;
  650. end; { endif assigned(hp) }
  651. { insert type conversions for write(ln) }
  652. if (not file_is_typed) then
  653. begin
  654. hp:=p^.left;
  655. while assigned(hp) do
  656. begin
  657. if (hp^.left^.treetype=typen) then
  658. CGMessage(type_e_cant_read_write_type);
  659. if assigned(hp^.left^.resulttype) then
  660. begin
  661. isreal:=false;
  662. { support writeln(procvar) }
  663. if (hp^.left^.resulttype^.deftype=procvardef) then
  664. begin
  665. p1:=gencallnode(nil,nil);
  666. p1^.right:=hp^.left;
  667. p1^.resulttype:=pprocvardef(hp^.left^.resulttype)^.rettype.def;
  668. firstpass(p1);
  669. hp^.left:=p1;
  670. end;
  671. case hp^.left^.resulttype^.deftype of
  672. filedef :
  673. begin
  674. { only allowed as first parameter }
  675. if assigned(hp^.right) then
  676. CGMessage(type_e_cant_read_write_type);
  677. end;
  678. stringdef :
  679. begin
  680. { generate the high() value for the shortstring }
  681. if (not dowrite) and
  682. is_shortstring(hp^.left^.resulttype) then
  683. gen_high_tree(hp,true);
  684. end;
  685. pointerdef :
  686. begin
  687. if not is_pchar(hp^.left^.resulttype) then
  688. CGMessage(type_e_cant_read_write_type);
  689. end;
  690. floatdef :
  691. begin
  692. isreal:=true;
  693. end;
  694. orddef :
  695. begin
  696. case porddef(hp^.left^.resulttype)^.typ of
  697. uchar,
  698. u32bit,s32bit,
  699. u64bit,s64bit:
  700. ;
  701. u8bit,s8bit,
  702. u16bit,s16bit :
  703. if dowrite then
  704. hp^.left:=gentypeconvnode(hp^.left,s32bitdef);
  705. bool8bit,
  706. bool16bit,
  707. bool32bit :
  708. if dowrite then
  709. hp^.left:=gentypeconvnode(hp^.left,booldef)
  710. else
  711. CGMessage(type_e_cant_read_write_type);
  712. else
  713. CGMessage(type_e_cant_read_write_type);
  714. end;
  715. if not(dowrite) and
  716. not(is_64bitint(hp^.left^.resulttype)) then
  717. extra_register:=true;
  718. end;
  719. arraydef :
  720. begin
  721. if is_chararray(hp^.left^.resulttype) then
  722. gen_high_tree(hp,true)
  723. else
  724. CGMessage(type_e_cant_read_write_type);
  725. end;
  726. else
  727. CGMessage(type_e_cant_read_write_type);
  728. end;
  729. { some format options ? }
  730. if hp^.is_colon_para then
  731. begin
  732. if hp^.right^.is_colon_para then
  733. begin
  734. frac_para:=hp;
  735. length_para:=hp^.right;
  736. hp:=hp^.right;
  737. hpp:=hp^.right;
  738. end
  739. else
  740. begin
  741. length_para:=hp;
  742. frac_para:=nil;
  743. hpp:=hp^.right;
  744. end;
  745. isreal:=(hpp^.left^.resulttype^.deftype=floatdef);
  746. if (not is_integer(length_para^.left^.resulttype)) then
  747. CGMessage1(type_e_integer_expr_expected,length_para^.left^.resulttype^.typename)
  748. else
  749. length_para^.left:=gentypeconvnode(length_para^.left,s32bitdef);
  750. if assigned(frac_para) then
  751. begin
  752. if isreal then
  753. begin
  754. if (not is_integer(frac_para^.left^.resulttype)) then
  755. CGMessage1(type_e_integer_expr_expected,frac_para^.left^.resulttype^.typename)
  756. else
  757. frac_para^.left:=gentypeconvnode(frac_para^.left,s32bitdef);
  758. end
  759. else
  760. CGMessage(parser_e_illegal_colon_qualifier);
  761. end;
  762. { do the checking for the colon'd arg }
  763. hp:=length_para;
  764. end;
  765. end;
  766. hp:=hp^.right;
  767. end;
  768. end;
  769. { pass all parameters again for the typeconversions }
  770. if codegenerror then
  771. exit;
  772. firstcallparan(p^.left,nil,true);
  773. set_varstate(p^.left,true);
  774. { calc registers }
  775. left_right_max(p);
  776. if extra_register then
  777. inc(p^.registers32);
  778. end;
  779. end;
  780. in_settextbuf_file_x :
  781. begin
  782. { warning here p^.left is the callparannode
  783. not the argument directly }
  784. { p^.left^.left is text var }
  785. { p^.left^.right^.left is the buffer var }
  786. { firstcallparan(p^.left,nil);
  787. already done in firstcalln }
  788. { now we know the type of buffer }
  789. getsymonlyin(systemunit,'SETTEXTBUF');
  790. hp:=gencallnode(pprocsym(srsym),systemunit);
  791. hp^.left:=gencallparanode(
  792. genordinalconstnode(p^.left^.left^.resulttype^.size,s32bitdef),p^.left);
  793. putnode(p);
  794. p:=hp;
  795. firstpass(p);
  796. end;
  797. { the firstpass of the arg has been done in firstcalln ? }
  798. in_reset_typedfile,
  799. in_rewrite_typedfile :
  800. begin
  801. procinfo^.flags:=procinfo^.flags or pi_do_call;
  802. firstpass(p^.left);
  803. set_varstate(p^.left,true);
  804. p^.resulttype:=voiddef;
  805. end;
  806. in_str_x_string :
  807. begin
  808. procinfo^.flags:=procinfo^.flags or pi_do_call;
  809. p^.resulttype:=voiddef;
  810. { check the amount of parameters }
  811. if not(assigned(p^.left)) or
  812. not(assigned(p^.left^.right)) then
  813. begin
  814. CGMessage(parser_e_wrong_parameter_size);
  815. exit;
  816. end;
  817. { first pass just the string for first local use }
  818. hp:=p^.left^.right;
  819. p^.left^.right:=nil;
  820. firstcallparan(p^.left,nil,true);
  821. set_varstate(p^.left,false);
  822. { remove warning when result is passed }
  823. set_funcret_is_valid(p^.left^.left);
  824. p^.left^.right:=hp;
  825. firstcallparan(p^.left^.right,nil,true);
  826. set_varstate(p^.left^.right,true);
  827. hp:=p^.left;
  828. { valid string ? }
  829. if not assigned(hp) or
  830. (hp^.left^.resulttype^.deftype<>stringdef) or
  831. (hp^.right=nil) then
  832. CGMessage(cg_e_illegal_expression);
  833. { we need a var parameter }
  834. valid_for_assign(hp^.left,false);
  835. { generate the high() value for the shortstring }
  836. if is_shortstring(hp^.left^.resulttype) then
  837. gen_high_tree(hp,true);
  838. { !!!! check length of string }
  839. while assigned(hp^.right) do
  840. hp:=hp^.right;
  841. { check and convert the first param }
  842. if hp^.is_colon_para then
  843. CGMessage(cg_e_illegal_expression);
  844. isreal:=false;
  845. case hp^.resulttype^.deftype of
  846. orddef :
  847. begin
  848. case porddef(hp^.left^.resulttype)^.typ of
  849. u32bit,s32bit,
  850. s64bit,u64bit:
  851. ;
  852. u8bit,s8bit,
  853. u16bit,s16bit:
  854. hp^.left:=gentypeconvnode(hp^.left,s32bitdef);
  855. else
  856. CGMessage(type_e_integer_or_real_expr_expected);
  857. end;
  858. end;
  859. floatdef :
  860. begin
  861. isreal:=true;
  862. end;
  863. else
  864. CGMessage(type_e_integer_or_real_expr_expected);
  865. end;
  866. { some format options ? }
  867. hpp:=p^.left^.right;
  868. if assigned(hpp) and hpp^.is_colon_para then
  869. begin
  870. firstpass(hpp^.left);
  871. set_varstate(hpp^.left,true);
  872. if (not is_integer(hpp^.left^.resulttype)) then
  873. CGMessage1(type_e_integer_expr_expected,hpp^.left^.resulttype^.typename)
  874. else
  875. hpp^.left:=gentypeconvnode(hpp^.left,s32bitdef);
  876. hpp:=hpp^.right;
  877. if assigned(hpp) and hpp^.is_colon_para then
  878. begin
  879. if isreal then
  880. begin
  881. if (not is_integer(hpp^.left^.resulttype)) then
  882. CGMessage1(type_e_integer_expr_expected,hpp^.left^.resulttype^.typename)
  883. else
  884. begin
  885. firstpass(hpp^.left);
  886. set_varstate(hpp^.left,true);
  887. hpp^.left:=gentypeconvnode(hpp^.left,s32bitdef);
  888. end;
  889. end
  890. else
  891. CGMessage(parser_e_illegal_colon_qualifier);
  892. end;
  893. end;
  894. { pass all parameters again for the typeconversions }
  895. if codegenerror then
  896. exit;
  897. firstcallparan(p^.left,nil,true);
  898. { calc registers }
  899. left_right_max(p);
  900. end;
  901. in_val_x :
  902. begin
  903. procinfo^.flags:=procinfo^.flags or pi_do_call;
  904. p^.resulttype:=voiddef;
  905. { check the amount of parameters }
  906. if not(assigned(p^.left)) or
  907. not(assigned(p^.left^.right)) then
  908. begin
  909. CGMessage(parser_e_wrong_parameter_size);
  910. exit;
  911. end;
  912. If Assigned(p^.left^.right^.right) Then
  913. {there is a "code" parameter}
  914. Begin
  915. { first pass just the code parameter for first local use}
  916. hp := p^.left^.right;
  917. p^.left^.right := nil;
  918. make_not_regable(p^.left^.left);
  919. firstcallparan(p^.left, nil,true);
  920. set_varstate(p^.left,false);
  921. if codegenerror then exit;
  922. p^.left^.right := hp;
  923. {code has to be a var parameter}
  924. if valid_for_assign(p^.left^.left,false) then
  925. begin
  926. if (p^.left^.left^.resulttype^.deftype <> orddef) or
  927. not(porddef(p^.left^.left^.resulttype)^.typ in
  928. [u16bit,s16bit,u32bit,s32bit]) then
  929. CGMessage(type_e_mismatch);
  930. end;
  931. hpp := p^.left^.right
  932. End
  933. Else hpp := p^.left;
  934. {now hpp = the destination value tree}
  935. { first pass just the destination parameter for first local use}
  936. hp:=hpp^.right;
  937. hpp^.right:=nil;
  938. {hpp = destination}
  939. make_not_regable(hpp^.left);
  940. firstcallparan(hpp,nil,true);
  941. set_varstate(hpp,false);
  942. if codegenerror then
  943. exit;
  944. { remove warning when result is passed }
  945. set_funcret_is_valid(hpp^.left);
  946. hpp^.right := hp;
  947. if valid_for_assign(hpp^.left,false) then
  948. begin
  949. If Not((hpp^.left^.resulttype^.deftype = floatdef) or
  950. ((hpp^.left^.resulttype^.deftype = orddef) And
  951. (POrdDef(hpp^.left^.resulttype)^.typ in
  952. [u32bit,s32bit,
  953. u8bit,s8bit,u16bit,s16bit,s64bit,u64bit]))) Then
  954. CGMessage(type_e_mismatch);
  955. end;
  956. {hp = source (String)}
  957. { count_ref := false; WHY ?? }
  958. firstcallparan(hp,nil,true);
  959. set_varstate(hp,true);
  960. if codegenerror then
  961. exit;
  962. { if not a stringdef then insert a type conv which
  963. does the other type checking }
  964. If (hp^.left^.resulttype^.deftype<>stringdef) then
  965. begin
  966. hp^.left:=gentypeconvnode(hp^.left,cshortstringdef);
  967. firstpass(hp);
  968. end;
  969. { calc registers }
  970. left_right_max(p);
  971. { val doesn't calculate the registers really }
  972. { correct, we need one register extra (FK) }
  973. if is_64bitint(hpp^.left^.resulttype) then
  974. inc(p^.registers32,2)
  975. else
  976. inc(p^.registers32,1);
  977. end;
  978. in_include_x_y,
  979. in_exclude_x_y:
  980. begin
  981. p^.resulttype:=voiddef;
  982. if assigned(p^.left) then
  983. begin
  984. firstcallparan(p^.left,nil,true);
  985. set_varstate(p^.left,true);
  986. p^.registers32:=p^.left^.registers32;
  987. p^.registersfpu:=p^.left^.registersfpu;
  988. {$ifdef SUPPORT_MMX}
  989. p^.registersmmx:=p^.left^.registersmmx;
  990. {$endif SUPPORT_MMX}
  991. { remove warning when result is passed }
  992. set_funcret_is_valid(p^.left^.left);
  993. { first param must be var }
  994. valid_for_assign(p^.left^.left,false);
  995. { check type }
  996. if (p^.left^.resulttype^.deftype=setdef) then
  997. begin
  998. { two paras ? }
  999. if assigned(p^.left^.right) then
  1000. begin
  1001. { insert a type conversion }
  1002. { to the type of the set elements }
  1003. p^.left^.right^.left:=gentypeconvnode(
  1004. p^.left^.right^.left,
  1005. psetdef(p^.left^.resulttype)^.elementtype.def);
  1006. { check the type conversion }
  1007. firstpass(p^.left^.right^.left);
  1008. { only three parameters are allowed }
  1009. if assigned(p^.left^.right^.right) then
  1010. CGMessage(cg_e_illegal_expression);
  1011. end;
  1012. end
  1013. else
  1014. CGMessage(type_e_mismatch);
  1015. end
  1016. else
  1017. CGMessage(type_e_mismatch);
  1018. end;
  1019. in_low_x,
  1020. in_high_x:
  1021. begin
  1022. set_varstate(p^.left,false);
  1023. if p^.left^.treetype in [typen,loadn,subscriptn] then
  1024. begin
  1025. case p^.left^.resulttype^.deftype of
  1026. orddef,enumdef:
  1027. begin
  1028. do_lowhigh(p^.left^.resulttype);
  1029. firstpass(p);
  1030. end;
  1031. setdef:
  1032. begin
  1033. do_lowhigh(Psetdef(p^.left^.resulttype)^.elementtype.def);
  1034. firstpass(p);
  1035. end;
  1036. arraydef:
  1037. begin
  1038. if p^.inlinenumber=in_low_x then
  1039. begin
  1040. hp:=genordinalconstnode(Parraydef(p^.left^.resulttype)^.lowrange,
  1041. Parraydef(p^.left^.resulttype)^.rangetype.def);
  1042. disposetree(p);
  1043. p:=hp;
  1044. firstpass(p);
  1045. end
  1046. else
  1047. begin
  1048. if is_open_array(p^.left^.resulttype) or
  1049. is_array_of_const(p^.left^.resulttype) then
  1050. begin
  1051. getsymonlyin(p^.left^.symtable,'high'+pvarsym(p^.left^.symtableentry)^.name);
  1052. hp:=genloadnode(pvarsym(srsym),p^.left^.symtable);
  1053. disposetree(p);
  1054. p:=hp;
  1055. firstpass(p);
  1056. end
  1057. else
  1058. begin
  1059. hp:=genordinalconstnode(Parraydef(p^.left^.resulttype)^.highrange,
  1060. Parraydef(p^.left^.resulttype)^.rangetype.def);
  1061. disposetree(p);
  1062. p:=hp;
  1063. firstpass(p);
  1064. end;
  1065. end;
  1066. end;
  1067. stringdef:
  1068. begin
  1069. if p^.inlinenumber=in_low_x then
  1070. begin
  1071. hp:=genordinalconstnode(0,u8bitdef);
  1072. disposetree(p);
  1073. p:=hp;
  1074. firstpass(p);
  1075. end
  1076. else
  1077. begin
  1078. if is_open_string(p^.left^.resulttype) then
  1079. begin
  1080. getsymonlyin(p^.left^.symtable,'high'+pvarsym(p^.left^.symtableentry)^.name);
  1081. hp:=genloadnode(pvarsym(srsym),p^.left^.symtable);
  1082. disposetree(p);
  1083. p:=hp;
  1084. firstpass(p);
  1085. end
  1086. else
  1087. begin
  1088. hp:=genordinalconstnode(Pstringdef(p^.left^.resulttype)^.len,u8bitdef);
  1089. disposetree(p);
  1090. p:=hp;
  1091. firstpass(p);
  1092. end;
  1093. end;
  1094. end;
  1095. else
  1096. CGMessage(type_e_mismatch);
  1097. end;
  1098. end
  1099. else
  1100. CGMessage(type_e_varid_or_typeid_expected);
  1101. end;
  1102. in_cos_extended:
  1103. begin
  1104. if p^.left^.treetype in [ordconstn,realconstn] then
  1105. setconstrealvalue(cos(getconstrealvalue))
  1106. else
  1107. handleextendedfunction;
  1108. end;
  1109. in_sin_extended:
  1110. begin
  1111. if p^.left^.treetype in [ordconstn,realconstn] then
  1112. setconstrealvalue(sin(getconstrealvalue))
  1113. else
  1114. handleextendedfunction;
  1115. end;
  1116. in_arctan_extended:
  1117. begin
  1118. if p^.left^.treetype in [ordconstn,realconstn] then
  1119. setconstrealvalue(arctan(getconstrealvalue))
  1120. else
  1121. handleextendedfunction;
  1122. end;
  1123. in_pi:
  1124. if block_type=bt_const then
  1125. setconstrealvalue(pi)
  1126. else
  1127. begin
  1128. p^.location.loc:=LOC_FPU;
  1129. p^.resulttype:=s80floatdef;
  1130. end;
  1131. in_abs_extended:
  1132. begin
  1133. if p^.left^.treetype in [ordconstn,realconstn] then
  1134. setconstrealvalue(abs(getconstrealvalue))
  1135. else
  1136. handleextendedfunction;
  1137. end;
  1138. in_sqr_extended:
  1139. begin
  1140. if p^.left^.treetype in [ordconstn,realconstn] then
  1141. setconstrealvalue(sqr(getconstrealvalue))
  1142. else
  1143. handleextendedfunction;
  1144. end;
  1145. in_sqrt_extended:
  1146. begin
  1147. if p^.left^.treetype in [ordconstn,realconstn] then
  1148. begin
  1149. vr:=getconstrealvalue;
  1150. if vr<0.0 then
  1151. begin
  1152. CGMessage(type_e_wrong_math_argument);
  1153. setconstrealvalue(0);
  1154. end
  1155. else
  1156. setconstrealvalue(sqrt(vr));
  1157. end
  1158. else
  1159. handleextendedfunction;
  1160. end;
  1161. in_ln_extended:
  1162. begin
  1163. if p^.left^.treetype in [ordconstn,realconstn] then
  1164. begin
  1165. vr:=getconstrealvalue;
  1166. if vr<=0.0 then
  1167. begin
  1168. CGMessage(type_e_wrong_math_argument);
  1169. setconstrealvalue(0);
  1170. end
  1171. else
  1172. setconstrealvalue(ln(vr));
  1173. end
  1174. else
  1175. handleextendedfunction;
  1176. end;
  1177. {$ifdef SUPPORT_MMX}
  1178. in_mmx_pcmpeqb..in_mmx_pcmpgtw:
  1179. begin
  1180. end;
  1181. {$endif SUPPORT_MMX}
  1182. in_assert_x_y :
  1183. begin
  1184. p^.resulttype:=voiddef;
  1185. if assigned(p^.left) then
  1186. begin
  1187. firstcallparan(p^.left,nil,true);
  1188. set_varstate(p^.left,true);
  1189. p^.registers32:=p^.left^.registers32;
  1190. p^.registersfpu:=p^.left^.registersfpu;
  1191. {$ifdef SUPPORT_MMX}
  1192. p^.registersmmx:=p^.left^.registersmmx;
  1193. {$endif SUPPORT_MMX}
  1194. { check type }
  1195. if is_boolean(p^.left^.resulttype) then
  1196. begin
  1197. { must always be a string }
  1198. p^.left^.right^.left:=gentypeconvnode(p^.left^.right^.left,cshortstringdef);
  1199. firstpass(p^.left^.right^.left);
  1200. end
  1201. else
  1202. CGMessage(type_e_mismatch);
  1203. end
  1204. else
  1205. CGMessage(type_e_mismatch);
  1206. { We've checked the whole statement for correctness, now we
  1207. can remove it if assertions are off }
  1208. if not(cs_do_assertion in aktlocalswitches) then
  1209. begin
  1210. disposetree(p^.left);
  1211. putnode(p);
  1212. { we need a valid node, so insert a nothingn }
  1213. p:=genzeronode(nothingn);
  1214. end;
  1215. end;
  1216. else
  1217. internalerror(8);
  1218. end;
  1219. end;
  1220. { generate an error if no resulttype is set }
  1221. if not assigned(p^.resulttype) then
  1222. p^.resulttype:=generrordef;
  1223. dec(parsing_para_level);
  1224. end;
  1225. {$ifdef fpc}
  1226. {$maxfpuregisters default}
  1227. {$endif fpc}
  1228. end.
  1229. {
  1230. $Log$
  1231. Revision 1.67 2000-02-17 14:53:43 florian
  1232. * some updates for the newcg
  1233. Revision 1.66 2000/02/13 14:21:51 jonas
  1234. * modifications to make the compiler functional when compiled with
  1235. -Or
  1236. Revision 1.65 2000/02/09 13:23:07 peter
  1237. * log truncated
  1238. Revision 1.64 2000/01/07 01:14:45 peter
  1239. * updated copyright to 2000
  1240. Revision 1.63 1999/12/30 15:02:10 peter
  1241. * fixed crash with undefined variable
  1242. Revision 1.62 1999/12/02 12:38:45 florian
  1243. + added support for succ/pred(<qword/int64>)
  1244. Revision 1.61 1999/11/30 10:40:58 peter
  1245. + ttype, tsymlist
  1246. Revision 1.60 1999/11/18 15:34:49 pierre
  1247. * Notes/Hints for local syms changed to
  1248. Set_varstate function
  1249. Revision 1.59 1999/11/17 17:05:07 pierre
  1250. * Notes/hints changes
  1251. Revision 1.58 1999/11/06 14:34:30 peter
  1252. * truncated log to 20 revs
  1253. Revision 1.57 1999/10/29 15:28:51 peter
  1254. * fixed assert, the tree is now disposed in firstpass if assertions
  1255. are off.
  1256. Revision 1.56 1999/10/26 12:30:46 peter
  1257. * const parameter is now checked
  1258. * better and generic check if a node can be used for assigning
  1259. * export fixes
  1260. * procvar equal works now (it never had worked at least from 0.99.8)
  1261. * defcoll changed to linkedlist with pparaitem so it can easily be
  1262. walked both directions
  1263. Revision 1.55 1999/10/22 14:37:31 peter
  1264. * error when properties are passed to var parameters
  1265. Revision 1.54 1999/10/21 16:41:41 florian
  1266. * problems with readln fixed: esi wasn't restored correctly when
  1267. reading ordinal fields of objects futher the register allocation
  1268. didn't take care of the extra register when reading ordinal values
  1269. * enumerations can now be used in constant indexes of properties
  1270. Revision 1.53 1999/09/28 20:48:27 florian
  1271. * fixed bug 610
  1272. + added $D- for TP in symtable.pas else it can't be compiled anymore
  1273. (too much symbols :()
  1274. Revision 1.52 1999/09/27 23:45:01 peter
  1275. * procinfo is now a pointer
  1276. * support for result setting in sub procedure
  1277. Revision 1.51 1999/09/15 20:35:46 florian
  1278. * small fix to operator overloading when in MMX mode
  1279. + the compiler uses now fldz and fld1 if possible
  1280. + some fixes to floating point registers
  1281. + some math. functions (arctan, ln, sin, cos, sqrt, sqr, pi) are now inlined
  1282. * .... ???
  1283. Revision 1.50 1999/09/07 14:05:11 pierre
  1284. * halt removed in do_lowhigh
  1285. Revision 1.49 1999/08/28 15:34:21 florian
  1286. * bug 519 fixed
  1287. Revision 1.48 1999/08/23 23:41:04 pierre
  1288. * in_inc_x register allocation corrected
  1289. Revision 1.47 1999/08/06 12:43:13 jonas
  1290. * fix for regvars with the val code
  1291. Revision 1.46 1999/08/05 16:53:23 peter
  1292. * V_Fatal=1, all other V_ are also increased
  1293. * Check for local procedure when assigning procvar
  1294. * fixed comment parsing because directives
  1295. * oldtp mode directives better supported
  1296. * added some messages to errore.msg
  1297. Revision 1.45 1999/08/04 00:23:40 florian
  1298. * renamed i386asm and i386base to cpuasm and cpubase
  1299. }