m68k.inc 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809
  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. movem.l a0/d0,-(sp)
  259. { check if pointer is nil.... before trying to access it }
  260. move.l 8(sp),a0
  261. { z flag set by move }
  262. beq @co_re
  263. move.l (a0),d0
  264. add.l 4(a0),d0
  265. bne @co_re
  266. { restore registers }
  267. movem.l (sp)+,a0/d0
  268. bra @end
  269. @co_re:
  270. { restore registers }
  271. movem.l (sp)+,a0/d0
  272. move.b #210,d0
  273. jsr HALT_ERROR
  274. @end:
  275. end;
  276. function get_addr(BP : longint) : longint;
  277. begin
  278. asm
  279. move.l BP,a0
  280. cmp.l #0,a0
  281. beq @Lnul_address
  282. move.l 4(a0),a0
  283. @Lnul_address:
  284. move.l a0,@RESULT
  285. end ['a0'];
  286. end;
  287. function get_next_frame(bp : longint) : longint;
  288. begin
  289. asm
  290. move.l bp,a0
  291. cmp.l #0,a0
  292. beq @Lnul_frame
  293. move.l (a0),a0
  294. @Lnul_frame:
  295. move.l a0,@RESULT
  296. end ['a0'];
  297. end;
  298. procedure runerror(w : word);
  299. function get_addr : longint;
  300. begin
  301. asm
  302. move.l (a6),a0
  303. move.l 4(a0),a0
  304. move.l a0,@RESULT
  305. end ['a0'];
  306. end;
  307. function get_error_bp : longint;
  308. begin
  309. asm
  310. { get base pointer of error }
  311. move.l (a6),d0
  312. move.l d0,@RESULT
  313. end ['d0'];
  314. end;
  315. begin
  316. errorcode:=w;
  317. exitcode:=w;
  318. erroraddr:=pointer(get_addr);
  319. DoError:=True;
  320. ErrorBase:=get_error_bp;
  321. halt(errorcode);
  322. end;
  323. procedure io1(addr : longint);[public,alias: 'IOCHECK'];
  324. var
  325. l : longint;
  326. begin
  327. { Since IOCHECK is called directly and only later the optimiser }
  328. { Maybe also save global registers }
  329. asm
  330. movem.l d0-a7,-(sp)
  331. end;
  332. l:=ioresult;
  333. if l<>0 then
  334. begin
  335. writeln('IO-Error ',l,' at ',addr);
  336. halt(byte(l));
  337. end;
  338. asm
  339. { the register are put back in the correct order }
  340. movem.l (sp)+,d0-a7
  341. end;
  342. end;
  343. procedure re_overflow;[public,alias: 'RE_OVERFLOW'];
  344. var
  345. addr : longint;
  346. begin
  347. { Overflow was shortly before the return address }
  348. asm
  349. move.l 4(a6),d0
  350. move.l d0,addr
  351. end;
  352. writeln('Overflow at ',addr);
  353. RunError(215);
  354. end;
  355. { Copies Strings }
  356. procedure strcopy(dstr,sstr : pointer;len : longint);[public,alias: 'STRCOPY'];
  357. begin
  358. asm
  359. move.l 12(a6),a0
  360. move.l 16(a6),a1 { Load pointer to strings }
  361. move.l 8(a6),d1 { Get length }
  362. move.b (a0)+,d0 { Get source length }
  363. cmp.b d1,d0
  364. ble @LM4
  365. move.b d1,d0 { If longer than maximum size of target, cut
  366. source length }
  367. @LM4:
  368. andi.l #$ff,d0 { zero extend d0-byte }
  369. move.l d0,d1 { save length to copy }
  370. move.b d0,(a1)+ { save new length }
  371. bra @LMSTRCOPY55
  372. @LMSTRCOPY56:
  373. move.b (a0)+,(a1)+
  374. @LMSTRCOPY55:
  375. dbra d1,@LMSTRCOPY56
  376. end;
  377. end;
  378. { Concatenate Strings }
  379. procedure strconcat(s1,s2 : pointer);[public,alias: 'STRCONCAT'];
  380. begin
  381. asm
  382. move.b #255,d0
  383. move.l s1,a0
  384. move.l s1,a1
  385. sub.b (a0),d0 { copyl:= 255 -length(s1) }
  386. move.b (a1),d6
  387. cmp.b d0,d6 { if copyl > length(s2) then }
  388. ble @Lcontinue
  389. move.b (a1),d0 { copyl:=length(s2) }
  390. @Lcontinue:
  391. move.b (a0),d6
  392. and.l #$ff,d6
  393. lea 1(a0,d6),a0 { s1[length(s1)+1] }
  394. add.l #1,a1 { s2[1] }
  395. move.b d0,d6
  396. @Loop:
  397. move.b (a1)+,(a0)+ { s1[i] := s2[i]; }
  398. dbra d6,@Loop
  399. move.l s1,a0
  400. add.b d0,(a0) { change to new string length }
  401. end ['d0','d1','a0','a1','d6'];
  402. end;
  403. { Compares strings }
  404. procedure strcmp(dstr,sstr : pointer);[public,alias: 'STRCMP'];
  405. begin
  406. asm
  407. move.l 12(a6),a0
  408. move.l 8(a6),a1 { Get address of both strings }
  409. move.b (a0)+,d0 { Get length of first string }
  410. move.b (a1)+,d6 { Get length of 2nd string }
  411. move.b d0,d1
  412. cmp.b d6,d1 { Get shortest string length }
  413. ble @LSTRCONCAT1
  414. move.b d6,d1
  415. @LSTRCONCAT1:
  416. tst.b d1 { Both strings have a length of zero, exit }
  417. beq @LSTRCONCAT2
  418. andi.l #$ff,d6
  419. or.l d1,d1 { Make sure to set Zerfo flag to 0 }
  420. bra @LSTRCONCAT4
  421. @LSTRCONCAT5:
  422. { Workaroung for GAS v.134 bug }
  423. { old: cmp.b (a1)+,(a0)+ }
  424. cmpm.b (a1)+,(a0)+
  425. @LSTRCONCAT4:
  426. dbne d6,@LSTRCONCAT5 { Repeat until not equal }
  427. bne @LSTRCONCAT3
  428. @LSTRCONCAT2:
  429. cmp.b d6,d0 { Compare length - set flag if equal length strings }
  430. @LSTRCONCAT3:
  431. end;
  432. end;
  433. Function strpas(p: pchar): string;
  434. { only 255 first characters are actually copied. }
  435. var
  436. counter : byte;
  437. str: string;
  438. Begin
  439. counter := 0;
  440. str := '';
  441. while (ord(p[counter]) <> 0) and (counter < 255) do
  442. begin
  443. counter:=counter+1;
  444. str[counter] := char(p[counter-1]);
  445. end;
  446. str[0] := char(counter);
  447. strpas := str;
  448. end;
  449. function strlen(p : pchar) : longint;
  450. var
  451. counter : longint;
  452. Begin
  453. counter := 0;
  454. repeat
  455. counter:=counter+1;
  456. until ord(p[counter]) = 0;
  457. strlen := counter;
  458. end;
  459. procedure move(var source;var dest;count : longint);
  460. { base pointer+8 = source }
  461. { base pointer+12 = destination }
  462. { base pointer+16 = number of bytes to move}
  463. begin
  464. asm
  465. clr.l d0
  466. move.l 16(a6),d0 { number of bytes }
  467. @LMOVE0:
  468. move.l 12(a6),a1 { destination }
  469. move.l 8(a6),a0 { source }
  470. cmpi.l #65535, d0 { check, if this is a word move }
  471. ble @LMEMSET00 { use fast dbra mode 68010+ }
  472. cmp.l a0,a1 { check copy direction }
  473. bls @LMOVE4
  474. add.l d0,a0 { move pointers to end }
  475. add.l d0,a1
  476. bra @LMOVE2
  477. @LMOVE1:
  478. move.b -(a0),-(a1) { (s < d) copy loop }
  479. @LMOVE2:
  480. subq.l #1,d0
  481. cmpi.l #-1,d0
  482. bne @LMOVE1
  483. bra @LMOVE5
  484. @LMOVE3:
  485. move.b (a0)+,(a1)+ { (s >= d) copy loop }
  486. @LMOVE4:
  487. subq.l #1,d0
  488. cmpi.l #-1,d0
  489. bne @LMOVE3
  490. bra @LMOVE5
  491. @LMEMSET00: { use fast loop mode 68010+ }
  492. cmp.l a0,a1 { check copy direction }
  493. bls @LMOVE04
  494. add.l d0,a0 { move pointers to end }
  495. add.l d0,a1
  496. bra @LMOVE02
  497. @LMOVE01:
  498. move.b -(a0),-(a1) { (s < d) copy loop }
  499. @LMOVE02:
  500. dbra d0,@LMOVE01
  501. bra @LMOVE5
  502. @LMOVE03:
  503. move.b (a0)+,(a1)+ { (s >= d) copy loop }
  504. @LMOVE04:
  505. dbra d0,@LMOVE03
  506. { end fast loop mode }
  507. @LMOVE5:
  508. end ['d0','a0','a1'];
  509. end;
  510. procedure fillword(var x;count : longint;value : word);
  511. begin
  512. asm
  513. move.l 8(a6), a0 { destination }
  514. move.l 12(a6), d1 { number of bytes to fill }
  515. move.w 16(a6),d0 { fill data }
  516. bra @LMEMSET21
  517. @LMEMSET11:
  518. move.w d0,(a0)+
  519. @LMEMSET21:
  520. subq.l #1,d1
  521. cmp.b #-1,d1
  522. bne @LMEMSET11
  523. end ['d0','d1','a0'];
  524. end;
  525. {$ifndef ordintern}
  526. {!!!!!! not very fast, but easy. }
  527. function ord(b : boolean) : byte;
  528. begin
  529. ord:=byte(b);
  530. end;
  531. {$endif ordintern}
  532. function abs(l : longint) : longint;
  533. begin
  534. asm
  535. move.l 8(a6),d0
  536. tst.l d0
  537. bpl @LMABS1
  538. neg.l d0
  539. @LMABS1:
  540. move.l d0,@RESULT
  541. end ['d0'];
  542. end;
  543. function odd(l : longint) : boolean;
  544. begin
  545. if (l and $01) = $01 then
  546. odd := TRUE
  547. else
  548. odd := FALSE;
  549. end;
  550. function sqr(l : longint) : longint;
  551. begin
  552. sqr := l*l;
  553. end;
  554. {$ifndef str_intern }
  555. procedure str(l : longint;var s : string);
  556. {$else str_intern }
  557. procedure int_str(l : longint;var s : string);
  558. {$endif str_intern }
  559. var
  560. value: longint;
  561. negative: boolean;
  562. begin
  563. negative := false;
  564. s:='';
  565. { Workaround: }
  566. if l=$80000000 then
  567. begin
  568. s:='-2147483648';
  569. exit;
  570. end;
  571. { handle case where l = 0 }
  572. if l = 0 then
  573. begin
  574. s:='0';
  575. exit;
  576. end;
  577. If l < 0 then
  578. begin
  579. negative := true;
  580. value:=abs(l);
  581. end
  582. else
  583. value:=l;
  584. { handle non-zero case }
  585. while value>0 do
  586. begin
  587. s:=char((value mod 10)+ord('0'))+s;
  588. value := value div 10;
  589. end;
  590. if negative then
  591. s := '-' + s;
  592. end;
  593. procedure f1;[public,alias: 'FLUSH_STDOUT'];
  594. begin
  595. asm
  596. { Save Registers }
  597. movem.l d0-a7,-(sp)
  598. end;
  599. FileFunc(textrec(output).flushfunc)(textrec(output));
  600. asm
  601. { Restore all registers in the correct order }
  602. movem.l (sp)+,d0-a7
  603. end;
  604. end;
  605. Function Sptr : Longint;
  606. begin
  607. asm
  608. move.l sp,d0
  609. add.l #8,d0
  610. move.l d0,@RESULT
  611. end ['d0'];
  612. end;
  613. Procedure BoundsCheck;assembler;
  614. { called by code generator with R+ state to }
  615. { determine if a range check occured. }
  616. { Only in 68000 mode, in 68020 mode this is }
  617. { inline. }
  618. { On Entry: }
  619. { A1 = address contaning min and max indexes }
  620. { D0 = value of current index to check. }
  621. asm
  622. XDEF RE_BOUNDS_CHECK
  623. cmp.l (A1),D0 { lower bound ... }
  624. bmi @rebounderr { is index lower ... }
  625. add.l #4,A1
  626. cmp.l (A1),D0
  627. bmi @reboundend
  628. beq @reboundend
  629. @rebounderr:
  630. move.l #201,d0
  631. jsr HALT_ERROR
  632. @reboundend:
  633. end;
  634. Function Random(l : Longint) : Longint
  635. {
  636. the problem Wwth this Function is if l is maxLongint*3/4 then the
  637. probability to obtain a number in the range maxlongint*1/4 to maxlongint*1/2
  638. is two times smaller than the probability for other numbers !
  639. }
  640. Begin
  641. Randseed:=Randseed*134775813+1;
  642. Random:=abs(Randseed mod l);
  643. End;
  644. {
  645. $Log$
  646. Revision 1.3 1998-04-08 07:53:32 michael
  647. + Changed Random() function. Moved from system to processor dependent files (from Pedro Gimeno)
  648. Revision 1.2 1998/03/27 23:48:06 carl
  649. * bugfix of STRCONCAT alignment problem
  650. Revision 1.18 1998/03/02 04:17:24 carl
  651. * problem with CHECK_OBJECT fixed, will probably only work with
  652. GNU tools, as the VMT pointer is an .lcomm and might not be
  653. zeroed automatically by other loaders.
  654. * CHECK_OBJECT was not jumping on right condition
  655. Revision 1.17 1998/02/23 02:26:06 carl
  656. * bugfix to make it link without problems
  657. Revision 1.13 1998/02/06 16:35:35 carl
  658. * oops commited wrong file
  659. Revision 1.11 1998/01/26 12:01:32 michael
  660. + Added log at the end
  661. Working file: rtl/m68k/m68k.inc
  662. description:
  663. ----------------------------
  664. revision 1.10
  665. date: 1998/01/19 10:21:36; author: michael; state: Exp; lines: +1 -12
  666. * moved Fillchar t(..,char) to system.inc
  667. ----------------------------
  668. revision 1.9
  669. date: 1998/01/13 03:47:39; author: carl; state: Exp; lines: +3 -3
  670. * bugfix of BoundsCheck invalid opcodes
  671. ----------------------------
  672. revision 1.8
  673. date: 1998/01/13 03:24:58; author: carl; state: Exp; lines: +2 -2
  674. * moveq.l #201 bugfix (This is of course an impossible opcode)
  675. ----------------------------
  676. revision 1.7
  677. date: 1998/01/12 15:24:47; author: carl; state: Exp; lines: +1 -20
  678. * bugfix, a function was being duplicated.
  679. ----------------------------
  680. revision 1.6
  681. date: 1998/01/12 03:40:11; author: carl; state: Exp; lines: +2 -2
  682. * bugfix of RE_OVERFLOW, now gives out a runerror(215)
  683. ----------------------------
  684. revision 1.5
  685. date: 1998/01/05 00:31:43; author: carl; state: Exp; lines: +206 -119
  686. * Bugfix of syntax errors
  687. ----------------------------
  688. revision 1.4
  689. date: 1998/01/01 16:50:16; author: michael; state: Exp; lines: +1 -21
  690. - Moved Do_exit to system.inc. Now processor independent.
  691. ----------------------------
  692. revision 1.3
  693. date: 1997/12/10 12:15:05; author: michael; state: Exp; lines: +2 -2
  694. * changed dateifunc to FileFunc.
  695. ----------------------------
  696. revision 1.2
  697. date: 1997/12/01 12:37:21; author: michael; state: Exp; lines: +14 -0
  698. + added copyright reference in header.
  699. ----------------------------
  700. revision 1.1
  701. date: 1997/11/27 08:33:48; author: michael; state: Exp;
  702. Initial revision
  703. ----------------------------
  704. revision 1.1.1.1
  705. date: 1997/11/27 08:33:48; author: michael; state: Exp; lines: +0 -0
  706. FPC RTL CVS start
  707. =============================================================================
  708. }