ptconst.pas 29 KB

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