m68k.inc 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825
  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.b 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. { do we have to initialize self }
  108. { we just need to check for zero }
  109. move.l a5,d0
  110. tst.l d0 { set flags }
  111. bne @LHC_4
  112. { get memory, but save register first }
  113. { temporary variable }
  114. subq.l #4,sp
  115. move.l sp,a5
  116. { Save Registers }
  117. movem.l d0-a7,-(sp)
  118. { Memory size }
  119. move.l 8(a6),a0
  120. move.l (a0),-(sp)
  121. { push method pointer }
  122. move.l a5,-(sp)
  123. jsr GETMEM
  124. { Restore all registers in the correct order }
  125. movem.l (sp)+,d0-a7
  126. { Memory size to a5 }
  127. move.l (a5),a5
  128. add.l #4,sp
  129. { If no memory available : fail() }
  130. move.l a5,d0
  131. tst.l d0 { set flags for a5 }
  132. beq @LHC_5
  133. { init self for the constructor }
  134. move.l a5,12(a6)
  135. @LHC_4:
  136. { is there a VMT address ? }
  137. move.l 8(a6),d0
  138. or.l d0,d0
  139. bne @LHC_7
  140. { In case the constructor doesn't do anything, the Zero-Flag }
  141. { can't be put, because this calls Fail() }
  142. add.l #1,d0
  143. rts
  144. @LHC_7:
  145. { set zero inside the object }
  146. { Save Registers }
  147. movem.l d0-a7,-(sp)
  148. move.w #0,-(sp)
  149. move.l 8(a6),a0
  150. move.l (a0),-(sp)
  151. move.l a5,-(sp)
  152. { }
  153. jsr FILLOBJECT
  154. { Restore all registers in the correct order }
  155. movem.l (sp)+,d0-a7
  156. { set the VMT address for the new created object }
  157. move.l 8(a6),d0
  158. move.l d0,(a5)
  159. or.l d0,d0
  160. @LHC_5:
  161. rts
  162. end;
  163. end;
  164. procedure help_fail;
  165. begin
  166. asm
  167. end;
  168. end;
  169. procedure int_help_destructor;
  170. begin
  171. asm
  172. { Stack (relative to %ebp):
  173. 12 Self
  174. 8 VMT-Address
  175. 4 Main program-Addr
  176. 0 %ebp
  177. }
  178. { temporary Variable }
  179. XDEF HELP_DESTRUCTOR
  180. subq.l #4,sp
  181. move.l sp,d6
  182. { Save Registers }
  183. movem.l d0-a7,-(sp)
  184. move.l 8(a6),d0 { Get the address of the vmt }
  185. or.l d0,d0 { Check if there is a vmt }
  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. { ON ENTRY: a0 -> Pointer to the VMT }
  255. { Nota: All registers must be preserved including }
  256. { A0 itself! }
  257. asm
  258. XDEF CHECK_OBJECT
  259. move.l d0,-(sp)
  260. tst.l a0
  261. { z flag set if zero }
  262. beq @co_re
  263. move.l (a0),d0
  264. add.l 4(a0),d0
  265. bne @co_re
  266. bra @end
  267. @co_re:
  268. move.l (sp)+,d0
  269. move.b #210,d0
  270. jsr HALT_ERROR
  271. @end:
  272. move.l (sp)+,d0
  273. end;
  274. function get_addr(BP : longint) : longint;
  275. begin
  276. asm
  277. move.l BP,a0
  278. cmp.l #0,a0
  279. beq @Lnul_address
  280. move.l 4(a0),a0
  281. @Lnul_address:
  282. move.l a0,@RESULT
  283. end ['a0'];
  284. end;
  285. function get_next_frame(bp : longint) : longint;
  286. begin
  287. asm
  288. move.l bp,a0
  289. cmp.l #0,a0
  290. beq @Lnul_frame
  291. move.l (a0),a0
  292. @Lnul_frame:
  293. move.l a0,@RESULT
  294. end ['a0'];
  295. end;
  296. procedure runerror(w : word);
  297. function get_addr : longint;
  298. begin
  299. asm
  300. move.l (a6),a0
  301. move.l 4(a0),a0
  302. move.l a0,@RESULT
  303. end ['a0'];
  304. end;
  305. function get_error_bp : longint;
  306. begin
  307. asm
  308. { get base pointer of error }
  309. move.l (a6),d0
  310. move.l d0,@RESULT
  311. end ['d0'];
  312. end;
  313. begin
  314. errorcode:=w;
  315. exitcode:=w;
  316. erroraddr:=pointer(get_addr);
  317. DoError:=True;
  318. ErrorBase:=get_error_bp;
  319. halt(byte(errorcode));
  320. end;
  321. procedure io1(addr : longint);[public,alias: 'IOCHECK'];
  322. var
  323. l : longint;
  324. begin
  325. { Since IOCHECK is called directly and only later the optimiser }
  326. { Maybe also save global registers }
  327. asm
  328. movem.l d0-a7,-(sp)
  329. end;
  330. l:=ioresult;
  331. if l<>0 then
  332. begin
  333. writeln('IO-Error ',l,' at 0x',HexStr(addr,8));
  334. halt(byte(l));
  335. end;
  336. asm
  337. { the register are put back in the correct order }
  338. movem.l (sp)+,d0-a7
  339. end;
  340. end;
  341. procedure re_overflow;[public,alias: 'RE_OVERFLOW'];
  342. var
  343. addr : longint;
  344. begin
  345. { Overflow was shortly before the return address }
  346. asm
  347. move.l 4(a6),d0
  348. move.l d0,addr
  349. end;
  350. writeln('Overflow at 0x',HexStr(addr,8));
  351. RunError(215);
  352. end;
  353. { procedure strcopy(dstr,sstr : pointer;len : longint);[public,alias: 'STRCOPY'];}
  354. procedure strcopy; assembler;
  355. {---------------------------------------------------}
  356. { Low-level routine to copy a string to another }
  357. { string with maximum length. Never call directly! }
  358. { On Entry: }
  359. { a1.l = string to copy to }
  360. { a0.l = source string }
  361. { d0.l = maximum length of copy }
  362. { registers destroyed: a0,a1,d0,d1 }
  363. {---------------------------------------------------}
  364. asm
  365. XDEF STRCOPY
  366. { move.l 12(a6),a0
  367. move.l 16(a6),a1
  368. move.l 8(a6),d1 }
  369. move.l d0,d1
  370. move.b (a0)+,d0 { Get source length }
  371. and.w #$ff,d0
  372. cmp.w d1,d0 { This is a signed comparison! }
  373. ble @LM4
  374. move.b d1,d0 { If longer than maximum size of target, cut
  375. source length }
  376. @LM4:
  377. andi.l #$ff,d0 { zero extend d0-byte }
  378. move.l d0,d1 { save length to copy }
  379. move.b d0,(a1)+ { save new length }
  380. { Check if copying length is zero - if so then }
  381. { exit without copying anything. }
  382. tst.b d1
  383. beq @Lend
  384. bra @LMSTRCOPY55
  385. @LMSTRCOPY56: { 68010 Fast loop mode }
  386. move.b (a0)+,(a1)+
  387. @LMSTRCOPY55:
  388. dbra d1,@LMSTRCOPY56
  389. @Lend:
  390. end;
  391. { Concatenate Strings }
  392. { PARAMETERS ARE REVERSED COMPARED TO NORMAL! }
  393. { therefore online assembler may not parse the params as normal }
  394. procedure strconcat(s1,s2 : pointer);[public,alias: 'STRCONCAT'];
  395. begin
  396. asm
  397. move.b #255,d0
  398. move.l s1,a0 { a0 = destination }
  399. move.l s2,a1 { a1 = source }
  400. sub.b (a0),d0 { copyl:= 255 -length(s1) }
  401. move.b (a1),d6
  402. and.w #$ff,d0 { Sign flags are checked! }
  403. and.w #$ff,d6
  404. cmp.w d6,d0 { if copyl > length(s2) then }
  405. ble @Lcontinue
  406. move.b (a1),d0 { copyl:=length(s2) }
  407. @Lcontinue:
  408. move.b (a0),d6
  409. and.l #$ff,d6
  410. lea 1(a0,d6),a0 { s1[length(s1)+1] }
  411. add.l #1,a1 { s2[1] }
  412. move.b d0,d6
  413. { Check if copying length is zero - if so then }
  414. { exit without copying anything. }
  415. tst.b d6
  416. beq @Lend
  417. bra @ALoop
  418. @Loop:
  419. move.b (a1)+,(a0)+ { s1[i] := s2[i]; }
  420. @ALoop:
  421. dbra d6,@Loop
  422. move.l s1,a0
  423. add.b d0,(a0) { change to new string length }
  424. @Lend:
  425. end ['d0','d1','a0','a1','d6'];
  426. end;
  427. { Compares strings }
  428. { DO NOT CALL directly. }
  429. { a0 = pointer to first string to compare }
  430. { a1 = pointer to second string to compare }
  431. { ALL FLAGS are set appropriately. }
  432. { ZF = strings are equal }
  433. { REGISTERS DESTROYED: a0, a1, d0, d1, d6 }
  434. procedure strcmp; assembler;
  435. asm
  436. XDEF STRCMP
  437. move.b (a0)+,d0 { Get length of first string }
  438. move.b (a1)+,d6 { Get length of 2nd string }
  439. move.b d6,d1 { Save length of string for final compare }
  440. cmp.b d0,d6 { Get shortest string length }
  441. ble @LSTRCONCAT1
  442. move.b d0,d6 { Set length to shortest string }
  443. @LSTRCONCAT1:
  444. tst.b d6 { Both strings have a length of zero, exit }
  445. beq @LSTRCONCAT2
  446. andi.l #$ff,d6
  447. subq.l #1,d6 { subtract first attempt }
  448. { if value is -1 then don't loop and just compare lengths of }
  449. { both strings before exiting. }
  450. bmi @LSTRCONCAT2
  451. or.l d0,d0 { Make sure to set Zerfo flag to 0 }
  452. @LSTRCONCAT5:
  453. { Workaroung for GAS v.134 bug }
  454. { old: cmp.b (a1)+,(a0)+ }
  455. cmpm.b (a1)+,(a0)+
  456. @LSTRCONCAT4:
  457. dbne d6,@LSTRCONCAT5 { Repeat until not equal }
  458. bne @LSTRCONCAT3
  459. @LSTRCONCAT2:
  460. { If length of both string are equal }
  461. { Then set zero flag }
  462. cmp.b d1,d0 { Compare length - set flag if equal length strings }
  463. @LSTRCONCAT3:
  464. end;
  465. Function strpas(p: pchar): string;
  466. { only 255 first characters are actually copied. }
  467. var
  468. counter : byte;
  469. str: string;
  470. Begin
  471. counter := 0;
  472. str := '';
  473. while (ord(p[counter]) <> 0) and (counter < 255) do
  474. begin
  475. counter:=counter+1;
  476. str[counter] := char(p[counter-1]);
  477. end;
  478. str[0] := char(counter);
  479. strpas := str;
  480. end;
  481. function strlen(p : pchar) : longint;
  482. var
  483. counter : longint;
  484. Begin
  485. counter := 0;
  486. repeat
  487. counter:=counter+1;
  488. until ord(p[counter]) = 0;
  489. strlen := counter;
  490. end;
  491. procedure move(var source;var dest;count : longint);
  492. { base pointer+8 = source }
  493. { base pointer+12 = destination }
  494. { base pointer+16 = number of bytes to move}
  495. begin
  496. asm
  497. clr.l d0
  498. move.l 16(a6),d0 { number of bytes }
  499. @LMOVE0:
  500. move.l 12(a6),a1 { destination }
  501. move.l 8(a6),a0 { source }
  502. cmpi.l #65535, d0 { check, if this is a word move }
  503. ble @LMEMSET00 { use fast dbra mode 68010+ }
  504. cmp.l a0,a1 { check copy direction }
  505. bls @LMOVE4
  506. add.l d0,a0 { move pointers to end }
  507. add.l d0,a1
  508. bra @LMOVE2
  509. @LMOVE1:
  510. move.b -(a0),-(a1) { (s < d) copy loop }
  511. @LMOVE2:
  512. subq.l #1,d0
  513. cmpi.l #-1,d0
  514. bne @LMOVE1
  515. bra @LMOVE5
  516. @LMOVE3:
  517. move.b (a0)+,(a1)+ { (s >= d) copy loop }
  518. @LMOVE4:
  519. subq.l #1,d0
  520. cmpi.l #-1,d0
  521. bne @LMOVE3
  522. bra @LMOVE5
  523. @LMEMSET00: { use fast loop mode 68010+ }
  524. cmp.l a0,a1 { check copy direction }
  525. bls @LMOVE04
  526. add.l d0,a0 { move pointers to end }
  527. add.l d0,a1
  528. bra @LMOVE02
  529. @LMOVE01:
  530. move.b -(a0),-(a1) { (s < d) copy loop }
  531. @LMOVE02:
  532. dbra d0,@LMOVE01
  533. bra @LMOVE5
  534. @LMOVE03:
  535. move.b (a0)+,(a1)+ { (s >= d) copy loop }
  536. @LMOVE04:
  537. dbra d0,@LMOVE03
  538. { end fast loop mode }
  539. @LMOVE5:
  540. end ['d0','a0','a1'];
  541. end;
  542. procedure fillword(var x;count : longint;value : word);
  543. begin
  544. asm
  545. move.l 8(a6), a0 { destination }
  546. move.l 12(a6), d1 { number of bytes to fill }
  547. move.w 16(a6),d0 { fill data }
  548. bra @LMEMSET21
  549. @LMEMSET11:
  550. move.w d0,(a0)+
  551. @LMEMSET21:
  552. subq.l #1,d1
  553. cmp.b #-1,d1
  554. bne @LMEMSET11
  555. end ['d0','d1','a0'];
  556. end;
  557. function abs(l : longint) : longint;
  558. begin
  559. asm
  560. move.l 8(a6),d0
  561. tst.l d0
  562. bpl @LMABS1
  563. neg.l d0
  564. @LMABS1:
  565. move.l d0,@RESULT
  566. end ['d0'];
  567. end;
  568. function odd(l : longint) : boolean;
  569. begin
  570. if (l and $01) = $01 then
  571. odd := TRUE
  572. else
  573. odd := FALSE;
  574. end;
  575. function sqr(l : longint) : longint;
  576. begin
  577. sqr := l*l;
  578. end;
  579. procedure int_str(l : longint;var s : string);
  580. var
  581. value: longint;
  582. negative: boolean;
  583. begin
  584. negative := false;
  585. s:='';
  586. { Workaround: }
  587. if l=$80000000 then
  588. begin
  589. s:='-2147483648';
  590. exit;
  591. end;
  592. { handle case where l = 0 }
  593. if l = 0 then
  594. begin
  595. s:='0';
  596. exit;
  597. end;
  598. If l < 0 then
  599. begin
  600. negative := true;
  601. value:=abs(l);
  602. end
  603. else
  604. value:=l;
  605. { handle non-zero case }
  606. while value>0 do
  607. begin
  608. s:=char((value mod 10)+ord('0'))+s;
  609. value := value div 10;
  610. end;
  611. if negative then
  612. s := '-' + s;
  613. end;
  614. procedure f1;[public,alias: 'FLUSH_STDOUT'];
  615. begin
  616. asm
  617. { Save Registers }
  618. movem.l d0-a7,-(sp)
  619. end;
  620. FileFunc(textrec(output).flushfunc)(textrec(output));
  621. asm
  622. { Restore all registers in the correct order }
  623. movem.l (sp)+,d0-a7
  624. end;
  625. end;
  626. Function Sptr : Longint;
  627. begin
  628. asm
  629. move.l sp,d0
  630. add.l #8,d0
  631. move.l d0,@RESULT
  632. end ['d0'];
  633. end;
  634. Procedure BoundsCheck;assembler;
  635. { called by code generator with R+ state to }
  636. { determine if a range check occured. }
  637. { Only in 68000 mode, in 68020 mode this is }
  638. { inline. }
  639. { On Entry: }
  640. { A1 = address contaning min and max indexes }
  641. { D0 = value of current index to check. }
  642. asm
  643. XDEF RE_BOUNDS_CHECK
  644. cmp.l (A1),D0 { lower bound ... }
  645. bmi @rebounderr { is index lower ... }
  646. add.l #4,A1
  647. cmp.l (A1),D0
  648. bmi @reboundend
  649. beq @reboundend
  650. @rebounderr:
  651. move.l #201,d0
  652. jsr HALT_ERROR
  653. @reboundend:
  654. end;
  655. {
  656. $Log$
  657. Revision 1.7 1998-07-02 12:20:58 carl
  658. + Io-Error and overflow print erroraddr in hex now
  659. Revision 1.6 1998/07/01 14:25:57 carl
  660. * strconcat was copying one byte too much
  661. * strcopy bugfix was using signed comparison
  662. + STRCOPY uses register calling conventions
  663. * FillChar bugfix was loading a word instead of a byte
  664. Revision 1.2 1998/03/27 23:48:06 carl
  665. * bugfix of STRCONCAT alignment problem
  666. Revision 1.18 1998/03/02 04:17:24 carl
  667. * problem with CHECK_OBJECT fixed, will probably only work with
  668. GNU tools, as the VMT pointer is an .lcomm and might not be
  669. zeroed automatically by other loaders.
  670. * CHECK_OBJECT was not jumping on right condition
  671. Revision 1.17 1998/02/23 02:26:06 carl
  672. * bugfix to make it link without problems
  673. Revision 1.13 1998/02/06 16:35:35 carl
  674. * oops commited wrong file
  675. Revision 1.11 1998/01/26 12:01:32 michael
  676. + Added log at the end
  677. Working file: rtl/m68k/m68k.inc
  678. description:
  679. ----------------------------
  680. revision 1.10
  681. date: 1998/01/19 10:21:36; author: michael; state: Exp; lines: +1 -12
  682. * moved Fillchar t(..,char) to system.inc
  683. ----------------------------
  684. revision 1.9
  685. date: 1998/01/13 03:47:39; author: carl; state: Exp; lines: +3 -3
  686. * bugfix of BoundsCheck invalid opcodes
  687. ----------------------------
  688. revision 1.8
  689. date: 1998/01/13 03:24:58; author: carl; state: Exp; lines: +2 -2
  690. * moveq.l #201 bugfix (This is of course an impossible opcode)
  691. ----------------------------
  692. revision 1.7
  693. date: 1998/01/12 15:24:47; author: carl; state: Exp; lines: +1 -20
  694. * bugfix, a function was being duplicated.
  695. ----------------------------
  696. revision 1.6
  697. date: 1998/01/12 03:40:11; author: carl; state: Exp; lines: +2 -2
  698. * bugfix of RE_OVERFLOW, now gives out a runerror(215)
  699. ----------------------------
  700. revision 1.5
  701. date: 1998/01/05 00:31:43; author: carl; state: Exp; lines: +206 -119
  702. * Bugfix of syntax errors
  703. ----------------------------
  704. revision 1.4
  705. date: 1998/01/01 16:50:16; author: michael; state: Exp; lines: +1 -21
  706. - Moved Do_exit to system.inc. Now processor independent.
  707. ----------------------------
  708. revision 1.3
  709. date: 1997/12/10 12:15:05; author: michael; state: Exp; lines: +2 -2
  710. * changed dateifunc to FileFunc.
  711. ----------------------------
  712. revision 1.2
  713. date: 1997/12/01 12:37:21; author: michael; state: Exp; lines: +14 -0
  714. + added copyright reference in header.
  715. ----------------------------
  716. revision 1.1
  717. date: 1997/11/27 08:33:48; author: michael; state: Exp;
  718. Initial revision
  719. ----------------------------
  720. revision 1.1.1.1
  721. date: 1997/11/27 08:33:48; author: michael; state: Exp; lines: +0 -0
  722. FPC RTL CVS start
  723. =============================================================================
  724. }