ptconst.pas 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729
  1. {
  2. $Id$
  3. Copyright (c) 1998 by Florian Klaempfl
  4. Reads typed constants
  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 ptconst;
  19. interface
  20. uses symtable;
  21. { this procedure reads typed constants }
  22. { sym is only needed for ansi strings }
  23. { the assembler label is in the middle (PM) }
  24. procedure readtypedconst(def : pdef;sym : ptypedconstsym);
  25. implementation
  26. uses
  27. cobjects,globals,scanner,aasm,tree,pass_1,
  28. hcodegen,types,verbose
  29. { parser specific stuff }
  30. ,pbase,pexpr
  31. { processor specific stuff }
  32. {$ifdef i386}
  33. ,i386
  34. {$endif}
  35. {$ifdef m68k}
  36. ,m68k
  37. {$endif}
  38. ;
  39. { this procedure reads typed constants }
  40. procedure readtypedconst(def : pdef;sym : ptypedconstsym);
  41. var
  42. {$ifdef m68k}
  43. j : longint;
  44. {$endif m68k}
  45. len : longint;
  46. p,hp : ptree;
  47. i,l,offset,
  48. strlength : longint;
  49. lsym : pvarsym;
  50. ll : plabel;
  51. s : string;
  52. ca : pchar;
  53. aktpos : longint;
  54. pd : pprocdef;
  55. obj : pobjectdef;
  56. symt : psymtable;
  57. hp1,hp2 : pdefcoll;
  58. value : bestreal;
  59. procedure check_range;
  60. begin
  61. if ((p^.value>porddef(def)^.high) or
  62. (p^.value<porddef(def)^.low)) then
  63. begin
  64. if (cs_check_range in aktlocalswitches) then
  65. Message(parser_e_range_check_error)
  66. else
  67. Message(parser_w_range_check_error);
  68. end;
  69. end;
  70. function is_po_equal(o1,o2:longint):boolean;
  71. begin
  72. { assembler does not affect }
  73. is_po_equal:=(o1 and not(poassembler))=
  74. (o2 and not(poassembler));
  75. end;
  76. {$R-} {Range check creates problem with init_8bit(-1) !!}
  77. begin
  78. case def^.deftype of
  79. orddef:
  80. begin
  81. p:=comp_expr(true);
  82. do_firstpass(p);
  83. case porddef(def)^.typ of
  84. s8bit,
  85. u8bit : begin
  86. if not is_constintnode(p) then
  87. { is't an int expected }
  88. Message(cg_e_illegal_expression)
  89. else
  90. begin
  91. datasegment^.concat(new(pai_const,init_8bit(p^.value)));
  92. check_range;
  93. end;
  94. end;
  95. s32bit : begin
  96. if not is_constintnode(p) then
  97. Message(cg_e_illegal_expression)
  98. else
  99. begin
  100. datasegment^.concat(new(pai_const,init_32bit(p^.value)));
  101. check_range;
  102. end;
  103. end;
  104. u32bit : begin
  105. if not is_constintnode(p) then
  106. Message(cg_e_illegal_expression)
  107. else
  108. datasegment^.concat(new(pai_const,init_32bit(p^.value)));
  109. end;
  110. bool8bit : begin
  111. if not is_constboolnode(p) then
  112. Message(cg_e_illegal_expression);
  113. datasegment^.concat(new(pai_const,init_8bit(p^.value)));
  114. end;
  115. uchar : begin
  116. if not is_constcharnode(p) then
  117. Message(cg_e_illegal_expression);
  118. datasegment^.concat(new(pai_const,init_8bit(p^.value)));
  119. end;
  120. u16bit,
  121. s16bit : begin
  122. if not is_constintnode(p) then
  123. Message(cg_e_illegal_expression);
  124. datasegment^.concat(new(pai_const,init_16bit(p^.value)));
  125. check_range;
  126. end;
  127. end;
  128. disposetree(p);
  129. end;
  130. floatdef:
  131. begin
  132. p:=comp_expr(true);
  133. do_firstpass(p);
  134. if is_constrealnode(p) then
  135. value:=p^.value_real
  136. else if is_constintnode(p) then
  137. value:=p^.value
  138. else
  139. Message(cg_e_illegal_expression);
  140. case pfloatdef(def)^.typ of
  141. s64real : datasegment^.concat(new(pai_double,init(value)));
  142. s32real : datasegment^.concat(new(pai_single,init(value)));
  143. s80real : datasegment^.concat(new(pai_extended,init(value)));
  144. s64bit : datasegment^.concat(new(pai_comp,init(value)));
  145. f32bit : datasegment^.concat(new(pai_const,init_32bit(trunc(value*65536))));
  146. else internalerror(18);
  147. end;
  148. disposetree(p);
  149. end;
  150. pointerdef:
  151. begin
  152. p:=comp_expr(true);
  153. do_firstpass(p);
  154. { allows horrible ofs(typeof(TButton)^) code !! }
  155. if (p^.treetype=addrn) and (p^.left^.treetype=derefn) then
  156. begin
  157. hp:=p^.left^.left;
  158. p^.left^.left:=nil;
  159. disposetree(p);
  160. p:=hp;
  161. end;
  162. { nil pointer ? }
  163. if p^.treetype=niln then
  164. datasegment^.concat(new(pai_const,init_32bit(0)))
  165. { maybe pchar ? }
  166. else
  167. if (ppointerdef(def)^.definition^.deftype=orddef) and
  168. (porddef(ppointerdef(def)^.definition)^.typ=uchar) then
  169. begin
  170. getdatalabel(ll);
  171. datasegment^.concat(new(pai_const,init_symbol(strpnew(lab2str(ll)))));
  172. consts^.concat(new(pai_label,init(ll)));
  173. if p^.treetype=stringconstn then
  174. begin
  175. getmem(ca,p^.length+2);
  176. move(p^.value_str^,ca^,p^.length+1);
  177. generate_pascii(consts,ca,p^.length+1);
  178. end
  179. else
  180. if is_constcharnode(p) then
  181. consts^.concat(new(pai_string,init(char(byte(p^.value))+#0)))
  182. else
  183. Message(cg_e_illegal_expression);
  184. end
  185. else
  186. if p^.treetype=addrn then
  187. begin
  188. if (is_equal(ppointerdef(p^.resulttype)^.definition,ppointerdef(def)^.definition) or
  189. (is_equal(ppointerdef(p^.resulttype)^.definition,voiddef)) or
  190. (is_equal(ppointerdef(def)^.definition,voiddef))) and
  191. (p^.left^.treetype = loadn) then
  192. begin
  193. if token=POINT then
  194. begin
  195. offset:=0;
  196. while token=POINT do
  197. begin
  198. consume(POINT);
  199. lsym:=pvarsym(precdef(
  200. ppointerdef(p^.resulttype)^.definition)^.symtable^.search(pattern));
  201. if assigned(sym) then
  202. offset:=offset+lsym^.address
  203. else
  204. begin
  205. Message1(sym_e_illegal_field,pattern);
  206. end;
  207. consume(ID);
  208. end;
  209. datasegment^.concat(new(pai_const_symbol_offset,init(
  210. strpnew(p^.left^.symtableentry^.mangledname),offset)));
  211. end
  212. else
  213. begin
  214. datasegment^.concat(new(pai_const,init_symbol(
  215. strpnew(p^.left^.symtableentry^.mangledname))));
  216. end;
  217. maybe_concat_external(p^.left^.symtableentry^.owner,
  218. p^.left^.symtableentry^.mangledname);
  219. end
  220. else
  221. Message(cg_e_illegal_expression);
  222. end
  223. else
  224. { allow typeof(Object type)}
  225. if (p^.treetype=inlinen) and
  226. (p^.inlinenumber=in_typeof_x) then
  227. begin
  228. if (p^.left^.treetype=typen) then
  229. begin
  230. datasegment^.concat(new(pai_const,init_symbol(
  231. strpnew(pobjectdef(p^.left^.resulttype)^.vmt_mangledname))));
  232. if pobjectdef(p^.left^.resulttype)^.owner^.symtabletype=unitsymtable then
  233. concat_external(pobjectdef(p^.left^.resulttype)^.vmt_mangledname,EXT_NEAR);
  234. end
  235. else
  236. Message(cg_e_illegal_expression);
  237. end
  238. else
  239. Message(cg_e_illegal_expression);
  240. disposetree(p);
  241. end;
  242. setdef:
  243. begin
  244. p:=comp_expr(true);
  245. do_firstpass(p);
  246. if p^.treetype=setconstn then
  247. begin
  248. { we only allow const sets }
  249. if assigned(p^.left) then
  250. Message(cg_e_illegal_expression)
  251. else
  252. begin
  253. {$ifdef i386}
  254. for l:=0 to def^.savesize-1 do
  255. datasegment^.concat(new(pai_const,init_8bit(p^.value_set^[l])));
  256. {$endif}
  257. {$ifdef m68k}
  258. j:=0;
  259. for l:=0 to ((def^.savesize-1) div 4) do
  260. { HORRIBLE HACK because of endian }
  261. { now use intel endian for constant sets }
  262. begin
  263. datasegment^.concat(new(pai_const,init_8bit(p^.value_set^[j+3])));
  264. datasegment^.concat(new(pai_const,init_8bit(p^.value_set^[j+2])));
  265. datasegment^.concat(new(pai_const,init_8bit(p^.value_set^[j+1])));
  266. datasegment^.concat(new(pai_const,init_8bit(p^.value_set^[j])));
  267. Inc(j,4);
  268. end;
  269. {$endif}
  270. end;
  271. end
  272. else
  273. Message(cg_e_illegal_expression);
  274. disposetree(p);
  275. end;
  276. enumdef:
  277. begin
  278. p:=comp_expr(true);
  279. do_firstpass(p);
  280. if p^.treetype=ordconstn then
  281. begin
  282. if is_equal(p^.resulttype,def) then
  283. datasegment^.concat(new(pai_const,init_32bit(p^.value)))
  284. else
  285. Message(cg_e_illegal_expression);
  286. end
  287. else
  288. Message(cg_e_illegal_expression);
  289. disposetree(p);
  290. end;
  291. stringdef:
  292. begin
  293. p:=comp_expr(true);
  294. do_firstpass(p);
  295. { first take care of prefixes for long and ansi strings }
  296. case pstringdef(def)^.string_typ of
  297. st_shortstring:
  298. begin
  299. if p^.treetype=stringconstn then
  300. begin
  301. if p^.length>=def^.size then
  302. strlength:=def^.size-1
  303. else
  304. strlength:=p^.length;
  305. datasegment^.concat(new(pai_const,init_8bit(strlength)));
  306. { this can also handle longer strings }
  307. getmem(ca,strlength+1);
  308. move(p^.value_str^,ca^,strlength+1);
  309. generate_pascii(datasegment,ca,strlength);
  310. end
  311. else if is_constcharnode(p) then
  312. begin
  313. datasegment^.concat(new(pai_string,init(#1+char(byte(p^.value)))));
  314. strlength:=1;
  315. end
  316. else Message(cg_e_illegal_expression);
  317. if def^.size>strlength then
  318. begin
  319. getmem(ca,def^.size-strlength);
  320. { def^.size contains also the leading length, so we }
  321. { we have to subtract one }
  322. fillchar(ca[0],def^.size-strlength-1,' ');
  323. ca[def^.size-strlength-1]:=#0;
  324. { this can also handle longer strings }
  325. generate_pascii(datasegment,ca,def^.size-strlength-1);
  326. end;
  327. end;
  328. {$ifdef UseLongString}
  329. st_longstring:
  330. begin
  331. if is_constcharnode(p) then
  332. strlength:=1
  333. else
  334. strlength:=p^.length;
  335. { first write the maximum size }
  336. datasegment^.concat(new(pai_const,init_32bit(strlength)))));
  337. { fill byte }
  338. datasegment^.concat(new(pai_const,init_8bit(0)));
  339. if p^.treetype=stringconstn then
  340. begin
  341. getmem(ca,strlength+1);
  342. move(p^.value_str^,ca^,strlength);
  343. ca[strlength]:=#0;
  344. generate_pascii(consts,ca,strlength);
  345. end
  346. else if is_constcharnode(p) then
  347. begin
  348. consts^.concat(new(pai_const,init_8bit(p^.value)));
  349. end
  350. else Message(cg_e_illegal_expression);
  351. datasegment^.concat(new(pai_const,init_8bit(0)));
  352. end;
  353. {$endif UseLongString}
  354. st_ansistring:
  355. begin
  356. { an empty ansi string is nil! }
  357. if (p^.treetype=stringconstn) and (p^.length=0) then
  358. datasegment^.concat(new(pai_const,init_32bit(0)))
  359. else
  360. begin
  361. if is_constcharnode(p) then
  362. strlength:=1
  363. else
  364. strlength:=p^.length;
  365. getdatalabel(ll);
  366. datasegment^.concat(new(pai_const,init_symbol(strpnew(lab2str(ll)))));
  367. { first write the maximum size }
  368. consts^.concat(new(pai_const,init_32bit(strlength)));
  369. { second write the real length }
  370. consts^.concat(new(pai_const,init_32bit(strlength)));
  371. { redondent with maxlength but who knows ... (PM) }
  372. { third write use count (set to -1 for safety ) }
  373. consts^.concat(new(pai_const,init_32bit(-1)));
  374. { not longer necessary, because it insert_indata
  375. if assigned(sym) then
  376. sym^.really_insert_in_data;
  377. }
  378. consts^.concat(new(pai_label,init(ll)));
  379. if p^.treetype=stringconstn then
  380. begin
  381. getmem(ca,strlength+1);
  382. move(p^.value_str^,ca^,strlength);
  383. ca[strlength]:=#0;
  384. generate_pascii(consts,ca,strlength);
  385. end
  386. else if is_constcharnode(p) then
  387. begin
  388. consts^.concat(new(pai_const,init_8bit(p^.value)));
  389. end
  390. else Message(cg_e_illegal_expression);
  391. consts^.concat(new(pai_const,init_8bit(0)));
  392. end;
  393. end;
  394. end;
  395. disposetree(p);
  396. end;
  397. arraydef:
  398. begin
  399. if token=LKLAMMER then
  400. begin
  401. consume(LKLAMMER);
  402. for l:=parraydef(def)^.lowrange to parraydef(def)^.highrange-1 do
  403. begin
  404. readtypedconst(parraydef(def)^.definition,nil);
  405. consume(COMMA);
  406. end;
  407. readtypedconst(parraydef(def)^.definition,nil);
  408. consume(RKLAMMER);
  409. end
  410. else
  411. begin
  412. p:=comp_expr(true);
  413. do_firstpass(p);
  414. if p^.treetype=stringconstn then
  415. begin
  416. if p^.length>255 then
  417. len:=255
  418. else
  419. len:=p^.length;
  420. s[0]:=chr(len);
  421. move(p^.value_str^,s[1],len);
  422. end
  423. else
  424. if is_constcharnode(p) then
  425. s:=char(byte(p^.value))
  426. else
  427. Message(cg_e_illegal_expression);
  428. disposetree(p);
  429. l:=length(s);
  430. for i:=Parraydef(def)^.lowrange to Parraydef(def)^.highrange do
  431. begin
  432. if i+1-Parraydef(def)^.lowrange<=l then
  433. begin
  434. datasegment^.concat(new(pai_const,init_8bit(byte(s[1]))));
  435. delete(s,1,1);
  436. end
  437. else
  438. {Fill the remaining positions with #0.}
  439. datasegment^.concat(new(pai_const,init_8bit(0)));
  440. end;
  441. if length(s)>0 then
  442. Message(parser_e_string_too_long);
  443. end;
  444. end;
  445. procvardef:
  446. begin
  447. { Procvars and pointers are no longer compatible. }
  448. { under tp: =nil or =var under fpc: =nil or =@var }
  449. if token=_NIL then
  450. begin
  451. datasegment^.concat(new(pai_const,init_32bit(0)));
  452. consume(_NIL);
  453. exit;
  454. end
  455. else
  456. if not(m_tp_procvar in aktmodeswitches) then
  457. if token=KLAMMERAFFE then
  458. consume(KLAMMERAFFE);
  459. getsym(pattern,true);
  460. consume(ID);
  461. if srsym^.typ=unitsym then
  462. begin
  463. consume(POINT);
  464. getsymonlyin(punitsym(srsym)^.unitsymtable,pattern);
  465. consume(ID);
  466. end;
  467. if srsym^.typ<>procsym then
  468. Message(cg_e_illegal_expression)
  469. else
  470. begin
  471. pd:=pprocsym(srsym)^.definition;
  472. if assigned(pd^.nextoverloaded) then
  473. Message(parser_e_no_overloaded_procvars);
  474. if is_po_equal(pprocvardef(def)^.options,pd^.options) and
  475. is_equal(pprocvardef(def)^.retdef,pd^.retdef) then
  476. begin
  477. hp1:=pprocvardef(def)^.para1;
  478. hp2:=pd^.para1;
  479. while assigned(hp1) and assigned(hp2) do
  480. begin
  481. if not(is_equal(hp1^.data,hp2^.data)) or
  482. not(hp1^.paratyp=hp2^.paratyp) then
  483. begin
  484. Message(type_e_mismatch);
  485. break;
  486. end;
  487. hp1:=hp1^.next;
  488. hp2:=hp2^.next;
  489. end;
  490. if not((hp1=nil) and (hp2=nil)) then
  491. Message(type_e_mismatch);
  492. end
  493. else
  494. Message(type_e_mismatch);
  495. datasegment^.concat(new(pai_const,init_symbol(strpnew(pd^.mangledname))));
  496. if pd^.owner^.symtabletype=unitsymtable then
  497. concat_external(pd^.mangledname,EXT_NEAR);
  498. end;
  499. end;
  500. { reads a typed constant record }
  501. recorddef:
  502. begin
  503. consume(LKLAMMER);
  504. aktpos:=0;
  505. while token<>RKLAMMER do
  506. begin
  507. s:=pattern;
  508. consume(ID);
  509. consume(COLON);
  510. srsym:=precdef(def)^.symtable^.search(s);
  511. if srsym=nil then
  512. begin
  513. Message1(sym_e_id_not_found,s);
  514. consume_all_until(SEMICOLON);
  515. end
  516. else
  517. begin
  518. { check position }
  519. if pvarsym(srsym)^.address<aktpos then
  520. Message(parser_e_invalid_record_const);
  521. { if needed fill }
  522. if pvarsym(srsym)^.address>aktpos then
  523. for i:=1 to pvarsym(srsym)^.address-aktpos do
  524. datasegment^.concat(new(pai_const,init_8bit(0)));
  525. { new position }
  526. aktpos:=pvarsym(srsym)^.address+pvarsym(srsym)^.definition^.size;
  527. { read the data }
  528. readtypedconst(pvarsym(srsym)^.definition,nil);
  529. if token=SEMICOLON then
  530. consume(SEMICOLON)
  531. else break;
  532. end;
  533. end;
  534. for i:=1 to def^.size-aktpos do
  535. datasegment^.concat(new(pai_const,init_8bit(0)));
  536. consume(RKLAMMER);
  537. end;
  538. { reads a typed object }
  539. objectdef:
  540. begin
  541. if (pobjectdef(def)^.options and (oo_hasvmt or oo_is_class))<>0 then
  542. begin
  543. Message(parser_e_type_const_not_possible);
  544. consume_all_until(RKLAMMER);
  545. end
  546. else
  547. begin
  548. consume(LKLAMMER);
  549. aktpos:=0;
  550. while token<>RKLAMMER do
  551. begin
  552. s:=pattern;
  553. consume(ID);
  554. consume(COLON);
  555. srsym:=nil;
  556. obj:=pobjectdef(def);
  557. symt:=obj^.publicsyms;
  558. while (srsym=nil) and assigned(symt) do
  559. begin
  560. srsym:=symt^.search(s);
  561. if assigned(obj) then
  562. obj:=obj^.childof;
  563. if assigned(obj) then
  564. symt:=obj^.publicsyms
  565. else
  566. symt:=nil;
  567. end;
  568. if srsym=nil then
  569. begin
  570. Message1(sym_e_id_not_found,s);
  571. consume_all_until(SEMICOLON);
  572. end
  573. else
  574. begin
  575. { check position }
  576. if pvarsym(srsym)^.address<aktpos then
  577. Message(parser_e_invalid_record_const);
  578. { if needed fill }
  579. if pvarsym(srsym)^.address>aktpos then
  580. for i:=1 to pvarsym(srsym)^.address-aktpos do
  581. datasegment^.concat(new(pai_const,init_8bit(0)));
  582. { new position }
  583. aktpos:=pvarsym(srsym)^.address+pvarsym(srsym)^.definition^.size;
  584. { read the data }
  585. readtypedconst(pvarsym(srsym)^.definition,nil);
  586. if token=SEMICOLON then
  587. consume(SEMICOLON)
  588. else break;
  589. end;
  590. end;
  591. for i:=1 to def^.size-aktpos do
  592. datasegment^.concat(new(pai_const,init_8bit(0)));
  593. consume(RKLAMMER);
  594. end;
  595. end;
  596. else Message(parser_e_type_const_not_possible);
  597. end;
  598. end;
  599. end.
  600. {
  601. $Log$
  602. Revision 1.26 1998-11-10 17:53:06 peter
  603. * fixed const string
  604. Revision 1.25 1998/11/10 16:10:47 peter
  605. * fixed const pchar
  606. Revision 1.24 1998/11/05 12:02:55 peter
  607. * released useansistring
  608. * removed -Sv, its now available in fpc modes
  609. Revision 1.23 1998/11/04 10:11:45 peter
  610. * ansistring fixes
  611. Revision 1.22 1998/10/20 08:06:56 pierre
  612. * several memory corruptions due to double freemem solved
  613. => never use p^.loc.location:=p^.left^.loc.location;
  614. + finally I added now by default
  615. that ra386dir translates global and unit symbols
  616. + added a first field in tsymtable and
  617. a nextsym field in tsym
  618. (this allows to obtain ordered type info for
  619. records and objects in gdb !)
  620. Revision 1.21 1998/10/19 08:55:03 pierre
  621. * wrong stabs info corrected once again !!
  622. + variable vmt offset with vmt field only if required
  623. implemented now !!!
  624. Revision 1.20 1998/10/16 08:51:49 peter
  625. + target_os.stackalignment
  626. + stack can be aligned at 2 or 4 byte boundaries
  627. Revision 1.19 1998/10/12 12:20:58 pierre
  628. + added tai_const_symbol_offset
  629. for r : pointer = @var.field;
  630. * better message for different arg names on implementation
  631. of function
  632. Revision 1.18 1998/10/12 09:50:05 florian
  633. + support of <procedure var type>:=<pointer> in delphi mode added
  634. Revision 1.17 1998/10/09 08:56:29 pierre
  635. * several memory leaks fixed
  636. Revision 1.16 1998/09/24 23:49:18 peter
  637. + aktmodeswitches
  638. Revision 1.15 1998/09/07 18:46:11 peter
  639. * update smartlinking, uses getdatalabel
  640. * renamed ptree.value vars to value_str,value_real,value_set
  641. Revision 1.14 1998/09/04 08:42:07 peter
  642. * updated some error messages
  643. Revision 1.13 1998/09/01 09:05:36 peter
  644. * fixed string[4]='.library'
  645. Revision 1.12 1998/08/31 12:26:32 peter
  646. * m68k and palmos updates from surebugfixes
  647. Revision 1.11 1998/08/10 14:50:20 peter
  648. + localswitches, moduleswitches, globalswitches splitting
  649. Revision 1.10 1998/07/21 11:16:25 florian
  650. * bug0147 fixed
  651. Revision 1.9 1998/07/20 22:17:16 florian
  652. * hex constants in numeric char (#$54#$43 ...) are now allowed
  653. * there was a bug in record_var_dec which prevents the used
  654. of nested variant records (for example drivers.tevent of tv)
  655. Revision 1.8 1998/07/20 18:40:15 florian
  656. * handling of ansi string constants should now work
  657. Revision 1.7 1998/07/18 22:54:29 florian
  658. * some ansi/wide/longstring support fixed:
  659. o parameter passing
  660. o returning as result from functions
  661. Revision 1.6 1998/06/08 22:59:52 peter
  662. * smartlinking works for win32
  663. * some defines to exclude some compiler parts
  664. Revision 1.5 1998/06/03 22:49:01 peter
  665. + wordbool,longbool
  666. * rename bis,von -> high,low
  667. * moved some systemunit loading/creating to psystem.pas
  668. Revision 1.4 1998/05/05 12:05:42 florian
  669. * problems with properties fixed
  670. * crash fixed: i:=l when i and l are undefined, was a problem with
  671. implementation of private/protected
  672. Revision 1.3 1998/04/29 10:34:00 pierre
  673. + added some code for ansistring (not complete nor working yet)
  674. * corrected operator overloading
  675. * corrected nasm output
  676. + started inline procedures
  677. + added starstarn : use ** for exponentiation (^ gave problems)
  678. + started UseTokenInfo cond to get accurate positions
  679. }