m68k.inc 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798
  1. {
  2. $Id$
  3. This file is part of the Free Pascal run time library.
  4. Copyright (c) 1993,97 by Carl-Eric Codere,
  5. member of the Free Pascal development team.
  6. See the file COPYING.FPC, included in this distribution,
  7. for details about the copyright.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  11. **********************************************************************}
  12. {****************************************************************************
  13. m68k.inc : Processor dependent implementation of system unit
  14. For Motorola 680x0 Processor.
  15. *****************************************************************************}
  16. {****************************************************************************}
  17. { This include file contains as little assembler as possible, to make }
  18. { porting to other systems easier. }
  19. { Port to the Motorola 680x0 compiler by: }
  20. { }
  21. { Carl-Eric Codere - port of non-system specific stuff. }
  22. { }
  23. { Some routines taken from the Atari freeware dlib source code, created by: }
  24. { Dale Schumacher 399 Beacon Ave. }
  25. { (alias: Dalnefre') St. Paul, MN 55104 }
  26. { [email protected] United States of America }
  27. { Some routines taken from the freeware Atari Sozobon C compiler, created by:}
  28. { 1988 by Sozobon, Limited. Author: Johann Ruegg (freeware) }
  29. { Thanks to all these people wherever they maybe today! }
  30. { BUGS in sqr and abs for return values. Only longint seems supported. }
  31. { }
  32. { Still left to do: }
  33. { mod_rr routine to convert to pascal format. }
  34. { }
  35. { ALL routines in set.inc, system.inc and real2str.inc are system independant.}
  36. {****************************************************************************}
  37. { Don't call the following routines directly. }
  38. Procedure Hlt;[public,alias: 'HALT_ERROR'];
  39. { called by code generator on run-time errors. }
  40. { on entry contains d0 = error code. }
  41. var
  42. b:byte; { only byte is used... }
  43. begin
  44. asm
  45. move.b d0,b
  46. end;
  47. RunError(b);
  48. end;
  49. Procedure FillChar(var x; count: longint; value: byte);[alias: 'L_FILL_OBJECT'];
  50. begin
  51. asm
  52. move.l 8(a6), a0 { destination }
  53. move.l 12(a6), d1 { number of bytes to fill }
  54. move.w 16(a6),d0 { fill data }
  55. cmpi.l #65535, d1 { check, if this is a word move }
  56. ble @LMEMSET3 { use fast dbra mode }
  57. bra @LMEMSET2
  58. @LMEMSET1:
  59. move.b d0,(a0)+
  60. @LMEMSET2:
  61. subq.l #1,d1
  62. cmp.b #-1,d1
  63. bne @LMEMSET1
  64. bra @LMEMSET5 { finished slow mode , exit }
  65. @LMEMSET4: { fast loop mode section 68010+ }
  66. move.b d0,(a0)+
  67. @LMEMSET3:
  68. dbra d1,@LMEMSET4
  69. @LMEMSET5:
  70. end ['d0','d1','a0'];
  71. end;
  72. Procedure FillObject(var x; count: longint; value: byte);
  73. begin
  74. asm
  75. move.l 8(a6), a0 { destination }
  76. move.l 12(a6), d1 { number of bytes to fill }
  77. move.w 16(a6),d0 { fill data }
  78. cmp.l #65535, d1 { check, if this is a word move }
  79. ble @LMEMSET3 { use fast dbra mode }
  80. bra @LMEMSET2
  81. @LMEMSET1:
  82. move.b d0,(a0)+
  83. @LMEMSET2:
  84. subq.l #1,d1
  85. cmp.b #-1,d1
  86. bne @LMEMSET1
  87. bra @LMEMSET5 { finished slow mode , exit }
  88. @LMEMSET4: { fast loop mode section 68010+ }
  89. move.b d0,(a0)+
  90. @LMEMSET3:
  91. dbra d1,@LMEMSET4
  92. @LMEMSET5:
  93. end ['d0','d1','a0'];
  94. end;
  95. procedure int_help_constructor;
  96. begin
  97. asm
  98. XDEF HELP_CONSTRUCTOR
  99. { Entry without preamble, since we need the ESP of the
  100. constructor }
  101. { Stack (relative to %ebp):
  102. 12 Self
  103. 8 VMT-Address
  104. 4 main programm-Addr
  105. 0 %ebp
  106. }
  107. { initialise self ? }
  108. move.l a5,d0
  109. tst.l d0 { set flags }
  110. bne @LHC_4
  111. { get memory, but save register first }
  112. { temporary variable }
  113. subq.l #4,sp
  114. move.l sp,a5
  115. { Save Registers }
  116. movem.l d0-a7,-(sp)
  117. { Memory size }
  118. move.l 8(a6),a0
  119. move.l (a0),-(sp)
  120. { push method pointer }
  121. move.l a5,-(sp)
  122. jsr GETMEM
  123. { Restore all registers in the correct order }
  124. movem.l (sp)+,d0-a7
  125. { Memory size to a5 }
  126. move.l (a5),a5
  127. add.l #4,sp
  128. { If no memory available : fail() }
  129. move.l a5,d0
  130. tst.l d0 { set flags for a5 }
  131. beq @LHC_5
  132. { init self for the constructor }
  133. move.l a5,12(a6)
  134. @LHC_4:
  135. { is there a VMT address ? }
  136. move.l 8(a6),d0
  137. or.l d0,d0
  138. bne @LHC_7
  139. { In case the constructor doesn't do anything, the Zero-Flag }
  140. { can't be put, because this calls Fail() }
  141. add.l #1,d0
  142. rts
  143. @LHC_7:
  144. { set zero inside the object }
  145. { Save Registers }
  146. movem.l d0-a7,-(sp)
  147. move.w #0,-(sp)
  148. move.l 8(a6),a0
  149. move.l (a0),-(sp)
  150. move.l a5,-(sp)
  151. { }
  152. jsr FILLOBJECT
  153. { Restore all registers in the correct order }
  154. movem.l (sp)+,d0-a7
  155. { set the VMT address for the new created object }
  156. move.l 8(a6),d0
  157. move.l d0,(a5)
  158. or.l d0,d0
  159. @LHC_5:
  160. rts
  161. end;
  162. end;
  163. procedure help_fail;
  164. begin
  165. asm
  166. end;
  167. end;
  168. procedure int_help_destructor;
  169. begin
  170. asm
  171. { Stack (relative to %ebp):
  172. 12 Self
  173. 8 VMT-Address
  174. 4 Main program-Addr
  175. 0 %ebp
  176. }
  177. { temporary Variable }
  178. XDEF HELP_DESTRUCTOR
  179. subq.l #4,sp
  180. move.l sp,d6
  181. { Save Registers }
  182. movem.l d0-a7,-(sp)
  183. { Should the object be resolved ? }
  184. move.l 8(a6),d0
  185. or.l d0,d0
  186. beq @LHD_3
  187. { Yes, get size from SELF! }
  188. move.l 12(a6),a0
  189. { get VMT-pointer (from Self) to %ebx }
  190. move.l (a0),a1
  191. { And put size on the Stack }
  192. move.l (a1),-(sp)
  193. { SELF }
  194. { I think for precaution }
  195. { that we should clear the VMT here }
  196. clr.l (a0)
  197. { get address of local variable into }
  198. { address register }
  199. move.l d6,a1
  200. move.l a0,(a1)
  201. move.l a1,-(sp)
  202. jsr FREEMEM
  203. @LHD_3:
  204. { Restore all registers in the correct order }
  205. movem.l (sp)+,d0-a7
  206. add.l #4,sp
  207. rts
  208. end;
  209. end;
  210. procedure new_class;assembler;
  211. asm
  212. XDEF NEW_CLASS
  213. { create class ? }
  214. move.l 8(a6), d0
  215. tst.l d0
  216. { check for nil... }
  217. beq @NEW_CLASS1
  218. { a5 contains vmt }
  219. move.l a5,-(sp)
  220. { call newinstance (class method!) }
  221. jsr 16(a5)
  222. { new instance returns a pointer to the new created }
  223. { instance in d0 }
  224. { load a5 and insert self }
  225. move.l d0,8(a6)
  226. move.l d0,a5
  227. bra @end
  228. @NEW_CLASS1:
  229. move.l a5,8(a6)
  230. @end:
  231. end;
  232. procedure dispose_class;assembler;
  233. asm
  234. XDEF DISPOSE_CLASS
  235. { destroy class ? }
  236. move.l 8(a6),d0
  237. { save self }
  238. move.l a5,8(a6)
  239. tst.l d0
  240. beq @DISPOSE_CLASS
  241. { no inherited call }
  242. move.l (a5),d0
  243. { push self }
  244. move.l a5,-(sp)
  245. { call freeinstance }
  246. move.l d0,a0
  247. jsr 20(a0)
  248. @DISPOSE_CLASS:
  249. { load self }
  250. move.l 8(a6),a5
  251. end;
  252. { checks for a correct vmt pointer }
  253. procedure co;assembler;
  254. { Entry code: On Stack --> pointer to check }
  255. asm
  256. XDEF CHECK_OBJECT
  257. { save important registers }
  258. move.l a0/d0,-(sp)
  259. { check if pointer is nil.... before trying to access it }
  260. { offset is 12 contrary to i386 because we save two registers }
  261. move.l 12(sp),a0
  262. { z flag set by move }
  263. beq @co_re
  264. move.l (a0),d0
  265. add.l 4(a0),d0
  266. bne @co_re
  267. { restore registers }
  268. movem.l (sp)+,a0/d0
  269. bra @end
  270. @co_re:
  271. { restore registers }
  272. movem.l (sp)+,a0/d0
  273. move.b #210,d0
  274. jsr HALT_ERROR
  275. @end:
  276. end;
  277. function get_addr(BP : longint) : longint;
  278. begin
  279. asm
  280. move.l BP,a0
  281. cmp.l #0,a0
  282. beq @Lnul_address
  283. move.l 4(a0),a0
  284. @Lnul_address:
  285. move.l a0,@RESULT
  286. end ['a0'];
  287. end;
  288. function get_next_frame(bp : longint) : longint;
  289. begin
  290. asm
  291. move.l bp,a0
  292. cmp.l #0,a0
  293. beq @Lnul_frame
  294. move.l (a0),a0
  295. @Lnul_frame:
  296. move.l a0,@RESULT
  297. end ['a0'];
  298. end;
  299. procedure runerror(w : word);
  300. function get_addr : longint;
  301. begin
  302. asm
  303. move.l (a6),a0
  304. move.l 4(a0),a0
  305. move.l a0,@RESULT
  306. end ['a0'];
  307. end;
  308. function get_error_bp : longint;
  309. begin
  310. asm
  311. { get base pointer of error }
  312. move.l (a6),d0
  313. move.l d0,@RESULT
  314. end ['d0'];
  315. end;
  316. begin
  317. errorcode:=w;
  318. exitcode:=w;
  319. erroraddr:=pointer(get_addr);
  320. DoError:=True;
  321. ErrorBase:=get_error_bp;
  322. halt(errorcode);
  323. end;
  324. procedure io1(addr : longint);[public,alias: 'IOCHECK'];
  325. var
  326. l : longint;
  327. begin
  328. { Since IOCHECK is called directly and only later the optimiser }
  329. { Maybe also save global registers }
  330. asm
  331. movem.l d0-a7,-(sp)
  332. end;
  333. l:=ioresult;
  334. if l<>0 then
  335. begin
  336. writeln('IO-Error ',l,' at ',addr);
  337. halt(byte(l));
  338. end;
  339. asm
  340. { the register are put back in the correct order }
  341. movem.l (sp)+,d0-a7
  342. end;
  343. end;
  344. procedure re_overflow;[public,alias: 'RE_OVERFLOW'];
  345. var
  346. addr : longint;
  347. begin
  348. { Overflow was shortly before the return address }
  349. asm
  350. move.l 4(a6),d0
  351. move.l d0,addr
  352. end;
  353. writeln('Overflow at ',addr);
  354. RunError(215);
  355. end;
  356. { Copies Strings }
  357. procedure strcopy(dstr,sstr : pointer;len : longint);[public,alias: 'STRCOPY'];
  358. begin
  359. asm
  360. move.l 12(a6),a0
  361. move.l 16(a6),a1 { Load pointer to strings }
  362. move.l 8(a6),d1 { Get length }
  363. move.b (a0)+,d0 { Get source length }
  364. cmp.b d0,d1
  365. ble @LM4
  366. move.b d1,d0 { If longer than maximum size of target, cut
  367. source length }
  368. @LM4:
  369. andi.l #$ff,d0 { zero extend d0-byte }
  370. move.l d0,d1 { save length to copy }
  371. move.b d0,(a1)+ { save new length }
  372. bra @LMSTRCOPY55
  373. @LMSTRCOPY56:
  374. move.b (a0)+,(a1)+
  375. @LMSTRCOPY55:
  376. dbra d1,@LMSTRCOPY56
  377. end;
  378. end;
  379. { Concatenate Strings }
  380. procedure strconcat(s1,s2 : pointer);[public,alias: 'STRCONCAT'];
  381. begin
  382. asm
  383. move.b #255,d0
  384. move.l s1,a0
  385. move.l s2,a1
  386. sub.b (a0),d0 { copyl:= 255 -length(s1) }
  387. move.b (a1),d6
  388. cmp.b d0,d6 { if copyl > length(s2) then }
  389. ble @Lcontinue
  390. move.b (a1),d0 { copyl:=length(s2) }
  391. @Lcontinue:
  392. move.b (a0),d6
  393. and.l #$ff,d6
  394. lea 1(a0,d6),a0 { s1[length(s1)+1] }
  395. add.l #1,a1 { s2[1] }
  396. move.b d0,d6
  397. @Loop:
  398. move.b (a1)+,(a0)+ { s1[i] := s2[i]; }
  399. dbra d6,@Loop
  400. move.l s1,a0
  401. add.b d0,(a0) { change to new string length }
  402. end ['d0','d1','a0','a1','d6'];
  403. end;
  404. { Compares strings }
  405. procedure strcmp(dstr,sstr : pointer);[public,alias: 'STRCMP'];
  406. begin
  407. asm
  408. move.l 12(a6),a0
  409. move.l 8(a6),a1 { Get address of both strings }
  410. move.b (a0)+,d0 { Get length of first string }
  411. move.b (a1)+,d6 { Get length of 2nd string }
  412. move.b d0,d1
  413. cmp.b d6,d1 { Get shortest string length }
  414. ble @LSTRCONCAT1
  415. move.b d6,d1
  416. @LSTRCONCAT1:
  417. tst.b d1 { Both strings have a length of zero, exit }
  418. beq @LSTRCONCAT2
  419. andi.l #$ff,d6
  420. or.l d1,d1 { Make sure to set Zerfo flag to 0 }
  421. bra @LSTRCONCAT4
  422. @LSTRCONCAT5:
  423. { Workaroung for GAS v.134 bug }
  424. { old: cmp.b (a1)+,(a0)+ }
  425. cmpm.b (a1)+,(a0)+
  426. @LSTRCONCAT4:
  427. dbne d6,@LSTRCONCAT5 { Repeat until not equal }
  428. bne @LSTRCONCAT3
  429. @LSTRCONCAT2:
  430. cmp.b d6,d0 { Compare length - set flag if equal length strings }
  431. @LSTRCONCAT3:
  432. end;
  433. end;
  434. Function strpas(p: pchar): string;
  435. { only 255 first characters are actually copied. }
  436. var
  437. counter : byte;
  438. str: string;
  439. Begin
  440. counter := 0;
  441. str := '';
  442. while (ord(p[counter]) <> 0) and (counter < 255) do
  443. begin
  444. counter:=counter+1;
  445. str[counter] := char(p[counter-1]);
  446. end;
  447. str[0] := char(counter);
  448. strpas := str;
  449. end;
  450. function strlen(p : pchar) : longint;
  451. var
  452. counter : longint;
  453. Begin
  454. counter := 0;
  455. repeat
  456. counter:=counter+1;
  457. until ord(p[counter]) = 0;
  458. strlen := counter;
  459. end;
  460. procedure move(var source;var dest;count : longint);
  461. { base pointer+8 = source }
  462. { base pointer+12 = destination }
  463. { base pointer+16 = number of bytes to move}
  464. begin
  465. asm
  466. clr.l d0
  467. move.l 16(a6),d0 { number of bytes }
  468. @LMOVE0:
  469. move.l 12(a6),a1 { destination }
  470. move.l 8(a6),a0 { source }
  471. cmpi.l #65535, d0 { check, if this is a word move }
  472. ble @LMEMSET00 { use fast dbra mode 68010+ }
  473. cmp.l a0,a1 { check copy direction }
  474. bls @LMOVE4
  475. add.l d0,a0 { move pointers to end }
  476. add.l d0,a1
  477. bra @LMOVE2
  478. @LMOVE1:
  479. move.b -(a0),-(a1) { (s < d) copy loop }
  480. @LMOVE2:
  481. subq.l #1,d0
  482. cmpi.l #-1,d0
  483. bne @LMOVE1
  484. bra @LMOVE5
  485. @LMOVE3:
  486. move.b (a0)+,(a1)+ { (s >= d) copy loop }
  487. @LMOVE4:
  488. subq.l #1,d0
  489. cmpi.l #-1,d0
  490. bne @LMOVE3
  491. bra @LMOVE5
  492. @LMEMSET00: { use fast loop mode 68010+ }
  493. cmp.l a0,a1 { check copy direction }
  494. bls @LMOVE04
  495. add.l d0,a0 { move pointers to end }
  496. add.l d0,a1
  497. bra @LMOVE02
  498. @LMOVE01:
  499. move.b -(a0),-(a1) { (s < d) copy loop }
  500. @LMOVE02:
  501. dbra d0,@LMOVE01
  502. bra @LMOVE5
  503. @LMOVE03:
  504. move.b (a0)+,(a1)+ { (s >= d) copy loop }
  505. @LMOVE04:
  506. dbra d0,@LMOVE03
  507. { end fast loop mode }
  508. @LMOVE5:
  509. end ['d0','a0','a1'];
  510. end;
  511. procedure fillword(var x;count : longint;value : word);
  512. begin
  513. asm
  514. move.l 8(a6), a0 { destination }
  515. move.l 12(a6), d1 { number of bytes to fill }
  516. move.w 16(a6),d0 { fill data }
  517. bra @LMEMSET21
  518. @LMEMSET11:
  519. move.w d0,(a0)+
  520. @LMEMSET21:
  521. subq.l #1,d1
  522. cmp.b #-1,d1
  523. bne @LMEMSET11
  524. end ['d0','d1','a0'];
  525. end;
  526. {$ifndef ordintern}
  527. {!!!!!! not very fast, but easy. }
  528. function ord(b : boolean) : byte;
  529. begin
  530. ord:=byte(b);
  531. end;
  532. {$endif ordintern}
  533. function abs(l : longint) : longint;
  534. begin
  535. asm
  536. move.l 8(a6),d0
  537. tst.l d0
  538. bpl @LMABS1
  539. neg.l d0
  540. @LMABS1:
  541. move.l d0,@RESULT
  542. end ['d0'];
  543. end;
  544. function odd(l : longint) : boolean;
  545. begin
  546. if (l and $01) = $01 then
  547. odd := TRUE
  548. else
  549. odd := FALSE;
  550. end;
  551. function sqr(l : longint) : longint;
  552. begin
  553. sqr := l*l;
  554. end;
  555. {$ifndef str_intern }
  556. procedure str(l : longint;var s : string);
  557. {$else str_intern }
  558. procedure int_str(l : longint;var s : string);
  559. {$endif str_intern }
  560. var
  561. value: longint;
  562. negative: boolean;
  563. begin
  564. negative := false;
  565. s:='';
  566. { Workaround: }
  567. if l=$80000000 then
  568. begin
  569. s:='-2147483648';
  570. exit;
  571. end;
  572. { handle case where l = 0 }
  573. if l = 0 then
  574. begin
  575. s:='0';
  576. exit;
  577. end;
  578. If l < 0 then
  579. begin
  580. negative := true;
  581. value:=abs(l);
  582. end
  583. else
  584. value:=l;
  585. { handle non-zero case }
  586. while value>0 do
  587. begin
  588. s:=char((value mod 10)+ord('0'))+s;
  589. value := value div 10;
  590. end;
  591. if negative then
  592. s := '-' + s;
  593. end;
  594. procedure f1;[public,alias: 'FLUSH_STDOUT'];
  595. begin
  596. asm
  597. { Save Registers }
  598. movem.l d0-a7,-(sp)
  599. end;
  600. FileFunc(textrec(output).flushfunc)(textrec(output));
  601. asm
  602. { Restore all registers in the correct order }
  603. movem.l (sp)+,d0-a7
  604. end;
  605. end;
  606. Function Sptr : Longint;
  607. begin
  608. asm
  609. move.l sp,d0
  610. add.l #8,d0
  611. move.l d0,@RESULT
  612. end ['d0'];
  613. end;
  614. Procedure BoundsCheck;assembler;
  615. { called by code generator with R+ state to }
  616. { determine if a range check occured. }
  617. { Only in 68000 mode, in 68020 mode this is }
  618. { inline. }
  619. { On Entry: }
  620. { A1 = address contaning min and max indexes }
  621. { D0 = value of current index to check. }
  622. asm
  623. XDEF RE_BOUNDS_CHECK
  624. cmp.l (A1),D0 { lower bound ... }
  625. bmi @rebounderr { is index lower ... }
  626. add.l #4,A1
  627. cmp.l (A1),D0
  628. bmi @reboundend
  629. beq @reboundend
  630. @rebounderr:
  631. move.l #201,d0
  632. jsr HALT_ERROR
  633. @reboundend:
  634. end;
  635. {
  636. $Log$
  637. Revision 1.4 1998-05-25 12:18:48 carl
  638. * strcopy bugfix
  639. * co bugfix with stack
  640. Revision 1.2 1998/03/27 23:48:06 carl
  641. * bugfix of STRCONCAT alignment problem
  642. Revision 1.18 1998/03/02 04:17:24 carl
  643. * problem with CHECK_OBJECT fixed, will probably only work with
  644. GNU tools, as the VMT pointer is an .lcomm and might not be
  645. zeroed automatically by other loaders.
  646. * CHECK_OBJECT was not jumping on right condition
  647. Revision 1.17 1998/02/23 02:26:06 carl
  648. * bugfix to make it link without problems
  649. Revision 1.13 1998/02/06 16:35:35 carl
  650. * oops commited wrong file
  651. Revision 1.11 1998/01/26 12:01:32 michael
  652. + Added log at the end
  653. Working file: rtl/m68k/m68k.inc
  654. description:
  655. ----------------------------
  656. revision 1.10
  657. date: 1998/01/19 10:21:36; author: michael; state: Exp; lines: +1 -12
  658. * moved Fillchar t(..,char) to system.inc
  659. ----------------------------
  660. revision 1.9
  661. date: 1998/01/13 03:47:39; author: carl; state: Exp; lines: +3 -3
  662. * bugfix of BoundsCheck invalid opcodes
  663. ----------------------------
  664. revision 1.8
  665. date: 1998/01/13 03:24:58; author: carl; state: Exp; lines: +2 -2
  666. * moveq.l #201 bugfix (This is of course an impossible opcode)
  667. ----------------------------
  668. revision 1.7
  669. date: 1998/01/12 15:24:47; author: carl; state: Exp; lines: +1 -20
  670. * bugfix, a function was being duplicated.
  671. ----------------------------
  672. revision 1.6
  673. date: 1998/01/12 03:40:11; author: carl; state: Exp; lines: +2 -2
  674. * bugfix of RE_OVERFLOW, now gives out a runerror(215)
  675. ----------------------------
  676. revision 1.5
  677. date: 1998/01/05 00:31:43; author: carl; state: Exp; lines: +206 -119
  678. * Bugfix of syntax errors
  679. ----------------------------
  680. revision 1.4
  681. date: 1998/01/01 16:50:16; author: michael; state: Exp; lines: +1 -21
  682. - Moved Do_exit to system.inc. Now processor independent.
  683. ----------------------------
  684. revision 1.3
  685. date: 1997/12/10 12:15:05; author: michael; state: Exp; lines: +2 -2
  686. * changed dateifunc to FileFunc.
  687. ----------------------------
  688. revision 1.2
  689. date: 1997/12/01 12:37:21; author: michael; state: Exp; lines: +14 -0
  690. + added copyright reference in header.
  691. ----------------------------
  692. revision 1.1
  693. date: 1997/11/27 08:33:48; author: michael; state: Exp;
  694. Initial revision
  695. ----------------------------
  696. revision 1.1.1.1
  697. date: 1997/11/27 08:33:48; author: michael; state: Exp; lines: +0 -0
  698. FPC RTL CVS start
  699. =============================================================================
  700. }