ptconst.pas 28 KB

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