m68k.inc 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717
  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. { Credit where credit is due: }
  18. { -Some of the copy routines taken from the Atari dlib source code: }
  19. { Dale Schumacher (alias: Dalnefre') [email protected] }
  20. { 399 Beacon Ave. St. Paul, MN 55104,USA }
  21. { -Some of the routines taken from the freeware ATARI Sozobon C compiler }
  22. { 1988 by Sozobon, Limited. Author: Johann Ruegg (freeware) }
  23. { Thanks to all these people wherever they maybe today! }
  24. {****************************************************************************}
  25. { Don't call the following routines directly. }
  26. Procedure Hlt;[public,alias: 'FPC_HALT_ERROR'];
  27. { called by code generator on run-time errors. }
  28. { on entry contains d0 = error code. }
  29. var
  30. b:byte; { only byte is used... }
  31. begin
  32. asm
  33. move.b d0,b
  34. end;
  35. HandleError(b);
  36. end;
  37. Procedure FillChar(var x;count:longint;value:byte);[public,alias: 'FPC_FILL_OBJECT'];
  38. begin
  39. asm
  40. move.l 8(a6), a0 { destination }
  41. move.l 12(a6), d1 { number of bytes to fill }
  42. move.b 16(a6),d0 { fill data }
  43. cmpi.l #65535, d1 { check, if this is a word move }
  44. ble @LMEMSET3 { use fast dbra mode }
  45. bra @LMEMSET2
  46. @LMEMSET1:
  47. move.b d0,(a0)+
  48. @LMEMSET2:
  49. subq.l #1,d1
  50. cmp.b #-1,d1
  51. bne @LMEMSET1
  52. bra @LMEMSET5 { finished slow mode , exit }
  53. @LMEMSET4: { fast loop mode section 68010+ }
  54. move.b d0,(a0)+
  55. @LMEMSET3:
  56. dbra d1,@LMEMSET4
  57. @LMEMSET5:
  58. end ['d0','d1','a0'];
  59. end;
  60. Procedure FillObject(var x; count: longint; value: byte);
  61. begin
  62. asm
  63. move.l 8(a6), a0 { destination }
  64. move.l 12(a6), d1 { number of bytes to fill }
  65. move.w 16(a6),d0 { fill data }
  66. cmp.l #65535, d1 { check, if this is a word move }
  67. ble @LMEMSET3 { use fast dbra mode }
  68. bra @LMEMSET2
  69. @LMEMSET1:
  70. move.b d0,(a0)+
  71. @LMEMSET2:
  72. subq.l #1,d1
  73. cmp.b #-1,d1
  74. bne @LMEMSET1
  75. bra @LMEMSET5 { finished slow mode , exit }
  76. @LMEMSET4: { fast loop mode section 68010+ }
  77. move.b d0,(a0)+
  78. @LMEMSET3:
  79. dbra d1,@LMEMSET4
  80. @LMEMSET5:
  81. end ['d0','d1','a0'];
  82. end;
  83. procedure int_help_constructor;[public,alias:'FPC_HELP_CONSTRUCTOR'];
  84. begin
  85. asm
  86. { Entry without preamble, since we need the ESP of the
  87. constructor }
  88. { Stack (relative to %ebp):
  89. 12 Self
  90. 8 VMT-Address
  91. 4 main programm-Addr
  92. 0 %ebp
  93. }
  94. { do we have to initialize self }
  95. { we just need to check for zero }
  96. move.l a5,d0
  97. tst.l d0 { set flags }
  98. bne @LHC_4
  99. { get memory, but save register first }
  100. { temporary variable }
  101. subq.l #4,sp
  102. move.l sp,a5
  103. { Save Registers }
  104. movem.l d0-a7,-(sp)
  105. { Memory size }
  106. move.l 8(a6),a0
  107. move.l (a0),-(sp)
  108. { push method pointer }
  109. move.l a5,-(sp)
  110. jsr FPC_GETMEM
  111. { Restore all registers in the correct order }
  112. movem.l (sp)+,d0-a7
  113. { Memory position to a5 }
  114. move.l (a5),a5
  115. addq.l #4,sp
  116. { If no memory available : fail() }
  117. move.l a5,d0
  118. tst.l d0 { set flags for a5 }
  119. beq @LHC_5
  120. { init self for the constructor }
  121. move.l a5,12(a6)
  122. @LHC_4:
  123. { is there a VMT address ? }
  124. move.l 8(a6),d0
  125. or.l d0,d0
  126. bne @LHC_7
  127. { In case the constructor doesn't do anything, the Zero-Flag }
  128. { can't be put, because this calls Fail() }
  129. add.l #1,d0
  130. rts
  131. @LHC_7:
  132. { set zero inside the object }
  133. { Save Registers }
  134. movem.l d0-a7,-(sp)
  135. move.w #0,-(sp)
  136. move.l 8(a6),a0
  137. move.l (a0),-(sp)
  138. move.l a5,-(sp)
  139. { }
  140. jsr FPC_FILLOBJECT
  141. { Restore all registers in the correct order }
  142. movem.l (sp)+,d0-a7
  143. { set the VMT address for the new created object }
  144. {$ifdef OBJECTVMTOFFSET}
  145. { the offset is in %edi since the calling and has not been changed !! }
  146. move.l 8(a6),d1
  147. move.l d1,(a5,d0.l)
  148. {$else OBJECTVMTOFFSET}
  149. move.l 8(a6),d0
  150. move.l d0,(a5)
  151. {$endif OBJECTVMTOFFSET}
  152. or.l d0,d0
  153. @LHC_5:
  154. rts
  155. end;
  156. end;
  157. procedure help_fail;
  158. begin
  159. asm
  160. end;
  161. end;
  162. procedure int_help_destructor;[public,alias:'FPC_HELP_DESTRUCTOR'];
  163. begin
  164. asm
  165. { Stack (relative to %ebp):
  166. 12 Self
  167. 8 VMT-Address
  168. 4 Main program-Addr
  169. 0 %ebp
  170. }
  171. { temporary Variable }
  172. subq.l #4,sp
  173. move.l sp,d6
  174. { Save Registers }
  175. movem.l d0-a7,-(sp)
  176. move.l 8(a6),d0 { Get the address of the vmt }
  177. or.l d0,d0 { Check if there is a vmt }
  178. beq @LHD_3
  179. { Yes, get size from SELF! }
  180. move.l 12(a6),a0
  181. { get VMT-pointer (from Self) to %ebx }
  182. move.l (a0),a1
  183. { And put size on the Stack }
  184. move.l (a1),-(sp)
  185. { SELF }
  186. { I think for precaution }
  187. { that we should clear the VMT here }
  188. clr.l (a0)
  189. { get address of local variable into }
  190. { address register }
  191. move.l d6,a1
  192. move.l a0,(a1)
  193. move.l a1,-(sp)
  194. jsr FPC_FREEMEM
  195. @LHD_3:
  196. { Restore all registers in the correct order }
  197. movem.l (sp)+,d0-a7
  198. add.l #4,sp
  199. rts
  200. end;
  201. end;
  202. procedure new_class;assembler;[public,alias:'FPC_NEW_CLASS'];
  203. asm
  204. { create class ? }
  205. move.l 8(a6), d0
  206. tst.l d0
  207. { check for nil... }
  208. beq @NEW_CLASS1
  209. { a5 contains vmt }
  210. move.l a5,-(sp)
  211. { call newinstance (class method!) }
  212. jsr 16(a5)
  213. { new instance returns a pointer to the new created }
  214. { instance in d0 }
  215. { load a5 and insert self }
  216. move.l d0,8(a6)
  217. move.l d0,a5
  218. bra @end
  219. @NEW_CLASS1:
  220. move.l a5,8(a6)
  221. @end:
  222. end;
  223. procedure dispose_class;assembler;[public,alias:'FPC_DISPOSE_CLASS'];
  224. asm
  225. { destroy class ? }
  226. move.l 8(a6),d0
  227. { save self }
  228. move.l a5,8(a6)
  229. tst.l d0
  230. beq @DISPOSE_CLASS
  231. { no inherited call }
  232. move.l (a5),d0
  233. { push self }
  234. move.l a5,-(sp)
  235. { call freeinstance }
  236. move.l d0,a0
  237. jsr 20(a0)
  238. @DISPOSE_CLASS:
  239. { load self }
  240. move.l 8(a6),a5
  241. end;
  242. { checks for a correct vmt pointer }
  243. procedure int_check_object;assembler;[public,alias:'FPC_CHECK_OBJECT'];
  244. { ON ENTRY: a0 -> Pointer to the VMT }
  245. { Nota: All registers must be preserved including }
  246. { A0 itself! }
  247. asm
  248. move.l d0,-(sp)
  249. tst.l a0
  250. { z flag set if zero }
  251. beq @co_re
  252. move.l (a0),d0
  253. add.l 4(a0),d0
  254. bne @co_re
  255. bra @end
  256. @co_re:
  257. move.l (sp)+,d0
  258. move.b #210,d0
  259. jsr FPC_HALT_ERROR
  260. @end:
  261. move.l (sp)+,d0
  262. end;
  263. function get_frame : longint; assembler;
  264. asm
  265. move.l a6,d0
  266. end;
  267. function get_caller_addr(framebp:longint):longint;
  268. begin
  269. asm
  270. move.l FRAMEBP,a0
  271. cmp.l #0,a0
  272. beq @Lnul_address
  273. move.l 4(a0),a0
  274. @Lnul_address:
  275. move.l a0,@RESULT
  276. end ['a0'];
  277. end;
  278. function get_caller_frame(framebp:longint):longint;
  279. begin
  280. asm
  281. move.l FRAMEBP,a0
  282. cmp.l #0,a0
  283. beq @Lnul_frame
  284. move.l (a0),a0
  285. @Lnul_frame:
  286. move.l a0,@RESULT
  287. end ['a0'];
  288. end;
  289. { procedure strcopy(dstr,sstr : pointer;len : longint);[public,alias: 'STRCOPY'];}
  290. procedure strcopy; assembler;[public,alias: 'FPC_STRCOPY'];
  291. {---------------------------------------------------}
  292. { Low-level routine to copy a string to another }
  293. { string with maximum length. Never call directly! }
  294. { On Entry: }
  295. { a1.l = string to copy to }
  296. { a0.l = source string }
  297. { d0.l = maximum length of copy }
  298. { registers destroyed: a0,a1,d0,d1 }
  299. {---------------------------------------------------}
  300. asm
  301. { move.l 12(a6),a0
  302. move.l 16(a6),a1
  303. move.l 8(a6),d1 }
  304. move.l d0,d1
  305. move.b (a0)+,d0 { Get source length }
  306. and.w #$ff,d0
  307. cmp.w d1,d0 { This is a signed comparison! }
  308. ble @LM4
  309. move.b d1,d0 { If longer than maximum size of target, cut
  310. source length }
  311. @LM4:
  312. andi.l #$ff,d0 { zero extend d0-byte }
  313. move.l d0,d1 { save length to copy }
  314. move.b d0,(a1)+ { save new length }
  315. { Check if copying length is zero - if so then }
  316. { exit without copying anything. }
  317. tst.b d1
  318. beq @Lend
  319. bra @LMSTRCOPY55
  320. @LMSTRCOPY56: { 68010 Fast loop mode }
  321. move.b (a0)+,(a1)+
  322. @LMSTRCOPY55:
  323. dbra d1,@LMSTRCOPY56
  324. @Lend:
  325. end;
  326. { Concatenate Strings }
  327. { PARAMETERS ARE REVERSED COMPARED TO NORMAL! }
  328. { therefore online assembler may not parse the params as normal }
  329. procedure strconcat(s1,s2 : pointer);[public,alias: 'STRCONCAT'];
  330. begin
  331. asm
  332. move.b #255,d0
  333. move.l s1,a0 { a0 = destination }
  334. move.l s2,a1 { a1 = source }
  335. sub.b (a0),d0 { copyl:= 255 -length(s1) }
  336. move.b (a1),d6
  337. and.w #$ff,d0 { Sign flags are checked! }
  338. and.w #$ff,d6
  339. cmp.w d6,d0 { if copyl > length(s2) then }
  340. ble @Lcontinue
  341. move.b (a1),d0 { copyl:=length(s2) }
  342. @Lcontinue:
  343. move.b (a0),d6
  344. and.l #$ff,d6
  345. lea 1(a0,d6),a0 { s1[length(s1)+1] }
  346. add.l #1,a1 { s2[1] }
  347. move.b d0,d6
  348. { Check if copying length is zero - if so then }
  349. { exit without copying anything. }
  350. tst.b d6
  351. beq @Lend
  352. bra @ALoop
  353. @Loop:
  354. move.b (a1)+,(a0)+ { s1[i] := s2[i]; }
  355. @ALoop:
  356. dbra d6,@Loop
  357. move.l s1,a0
  358. add.b d0,(a0) { change to new string length }
  359. @Lend:
  360. end ['d0','d1','a0','a1','d6'];
  361. end;
  362. { Compares strings }
  363. { DO NOT CALL directly. }
  364. { a0 = pointer to first string to compare }
  365. { a1 = pointer to second string to compare }
  366. { ALL FLAGS are set appropriately. }
  367. { ZF = strings are equal }
  368. { REGISTERS DESTROYED: a0, a1, d0, d1, d6 }
  369. procedure strcmp; assembler;[public,alias:'FPC_STRCMP'];
  370. asm
  371. move.b (a0)+,d0 { Get length of first string }
  372. move.b (a1)+,d6 { Get length of 2nd string }
  373. move.b d6,d1 { Save length of string for final compare }
  374. cmp.b d0,d6 { Get shortest string length }
  375. ble @LSTRCONCAT1
  376. move.b d0,d6 { Set length to shortest string }
  377. @LSTRCONCAT1:
  378. tst.b d6 { Both strings have a length of zero, exit }
  379. beq @LSTRCONCAT2
  380. andi.l #$ff,d6
  381. subq.l #1,d6 { subtract first attempt }
  382. { if value is -1 then don't loop and just compare lengths of }
  383. { both strings before exiting. }
  384. bmi @LSTRCONCAT2
  385. or.l d0,d0 { Make sure to set Zerfo flag to 0 }
  386. @LSTRCONCAT5:
  387. { Workaroung for GAS v.134 bug }
  388. { old: cmp.b (a1)+,(a0)+ }
  389. cmpm.b (a1)+,(a0)+
  390. @LSTRCONCAT4:
  391. dbne d6,@LSTRCONCAT5 { Repeat until not equal }
  392. bne @LSTRCONCAT3
  393. @LSTRCONCAT2:
  394. { If length of both string are equal }
  395. { Then set zero flag }
  396. cmp.b d1,d0 { Compare length - set flag if equal length strings }
  397. @LSTRCONCAT3:
  398. end;
  399. Function strpas(p: pchar): string;
  400. { only 255 first characters are actually copied. }
  401. var
  402. counter : byte;
  403. str: string;
  404. Begin
  405. counter := 0;
  406. str := '';
  407. while (ord(p[counter]) <> 0) and (counter < 255) do
  408. begin
  409. counter:=counter+1;
  410. str[counter] := char(p[counter-1]);
  411. end;
  412. str[0] := char(counter);
  413. strpas := str;
  414. end;
  415. function strlen(p : pchar) : longint;
  416. var
  417. counter : longint;
  418. Begin
  419. counter := 0;
  420. repeat
  421. counter:=counter+1;
  422. until ord(p[counter]) = 0;
  423. strlen := counter;
  424. end;
  425. procedure move(var source;var dest;count : longint);
  426. { base pointer+8 = source }
  427. { base pointer+12 = destination }
  428. { base pointer+16 = number of bytes to move}
  429. begin
  430. asm
  431. clr.l d0
  432. move.l 16(a6),d0 { number of bytes }
  433. @LMOVE0:
  434. move.l 12(a6),a1 { destination }
  435. move.l 8(a6),a0 { source }
  436. cmpi.l #65535, d0 { check, if this is a word move }
  437. ble @LMEMSET00 { use fast dbra mode 68010+ }
  438. cmp.l a0,a1 { check copy direction }
  439. bls @LMOVE4
  440. add.l d0,a0 { move pointers to end }
  441. add.l d0,a1
  442. bra @LMOVE2
  443. @LMOVE1:
  444. move.b -(a0),-(a1) { (s < d) copy loop }
  445. @LMOVE2:
  446. subq.l #1,d0
  447. cmpi.l #-1,d0
  448. bne @LMOVE1
  449. bra @LMOVE5
  450. @LMOVE3:
  451. move.b (a0)+,(a1)+ { (s >= d) copy loop }
  452. @LMOVE4:
  453. subq.l #1,d0
  454. cmpi.l #-1,d0
  455. bne @LMOVE3
  456. bra @LMOVE5
  457. @LMEMSET00: { use fast loop mode 68010+ }
  458. cmp.l a0,a1 { check copy direction }
  459. bls @LMOVE04
  460. add.l d0,a0 { move pointers to end }
  461. add.l d0,a1
  462. bra @LMOVE02
  463. @LMOVE01:
  464. move.b -(a0),-(a1) { (s < d) copy loop }
  465. @LMOVE02:
  466. dbra d0,@LMOVE01
  467. bra @LMOVE5
  468. @LMOVE03:
  469. move.b (a0)+,(a1)+ { (s >= d) copy loop }
  470. @LMOVE04:
  471. dbra d0,@LMOVE03
  472. { end fast loop mode }
  473. @LMOVE5:
  474. end ['d0','a0','a1'];
  475. end;
  476. procedure fillword(var x;count : longint;value : word);
  477. begin
  478. asm
  479. move.l 8(a6), a0 { destination }
  480. move.l 12(a6), d1 { number of bytes to fill }
  481. move.w 16(a6),d0 { fill data }
  482. bra @LMEMSET21
  483. @LMEMSET11:
  484. move.w d0,(a0)+
  485. @LMEMSET21:
  486. subq.l #1,d1
  487. cmp.b #-1,d1
  488. bne @LMEMSET11
  489. end ['d0','d1','a0'];
  490. end;
  491. function abs(l : longint) : longint;
  492. begin
  493. asm
  494. move.l 8(a6),d0
  495. tst.l d0
  496. bpl @LMABS1
  497. neg.l d0
  498. @LMABS1:
  499. move.l d0,@RESULT
  500. end ['d0'];
  501. end;
  502. function odd(l : longint) : boolean;
  503. begin
  504. if (l and $01) = $01 then
  505. odd := TRUE
  506. else
  507. odd := FALSE;
  508. end;
  509. function sqr(l : longint) : longint;
  510. begin
  511. sqr := l*l;
  512. end;
  513. procedure int_str(l : longint;var s : string);
  514. var
  515. value: longint;
  516. negative: boolean;
  517. begin
  518. negative := false;
  519. s:='';
  520. { Workaround: }
  521. if l=$80000000 then
  522. begin
  523. s:='-2147483648';
  524. exit;
  525. end;
  526. { handle case where l = 0 }
  527. if l = 0 then
  528. begin
  529. s:='0';
  530. exit;
  531. end;
  532. If l < 0 then
  533. begin
  534. negative := true;
  535. value:=abs(l);
  536. end
  537. else
  538. value:=l;
  539. { handle non-zero case }
  540. while value>0 do
  541. begin
  542. s:=char((value mod 10)+ord('0'))+s;
  543. value := value div 10;
  544. end;
  545. if negative then
  546. s := '-' + s;
  547. end;
  548. Function Sptr : Longint;
  549. begin
  550. asm
  551. move.l sp,d0
  552. add.l #8,d0
  553. move.l d0,@RESULT
  554. end ['d0'];
  555. end;
  556. Procedure BoundsCheck;assembler;[public,alias:'FPC_RE_BOUNDS_CHECK'];
  557. { called by code generator with R+ state to }
  558. { determine if a range check occured. }
  559. { Only in 68000 mode, in 68020 mode this is }
  560. { inline. }
  561. { On Entry: }
  562. { A1 = address contaning min and max indexes }
  563. { D0 = value of current index to check. }
  564. asm
  565. cmp.l (A1),D0 { lower bound ... }
  566. bmi @rebounderr { is index lower ... }
  567. add.l #4,A1
  568. cmp.l (A1),D0
  569. bmi @reboundend
  570. beq @reboundend
  571. @rebounderr:
  572. move.l #201,d0
  573. jsr FPC_HALT_ERROR
  574. @reboundend:
  575. end;
  576. {****************************************************************************
  577. IoCheck
  578. ****************************************************************************}
  579. procedure int_iocheck(addr : longint);[public,alias: {$ifdef FPCNAMES}'FPC_'+{$endif}'IOCHECK'];
  580. var
  581. l : longint;
  582. begin
  583. asm
  584. movem.l d0-a7,-(sp)
  585. end;
  586. if InOutRes<>0 then
  587. begin
  588. l:=InOutRes;
  589. InOutRes:=0;
  590. If ErrorProc<>Nil then
  591. TErrorProc(Errorproc)(l,pointer(addr));
  592. {$ifndef RTLLITE}
  593. writeln('IO-Error ',l,' at 0x',HexStr(addr,8));
  594. {$endif}
  595. Halt(byte(l));
  596. end;
  597. asm
  598. movem.l (sp)+,d0-a7
  599. end;
  600. end;
  601. {
  602. $Log$
  603. Revision 1.13 1998-10-15 11:35:03 pierre
  604. + first step of variable vmt offset
  605. offset is stored in R_EDI (R_D0)
  606. if objectvmtoffset is defined
  607. Revision 1.12 1998/10/13 08:00:06 pierre
  608. * some bugs related to FPC_ prefix fixed
  609. * problems with pbyte sometimes defined and sometimes not for rttip.inc solved
  610. Revision 1.11 1998/09/14 10:48:29 peter
  611. * FPC_ names
  612. * Heap manager is now system independent
  613. Revision 1.10 1998/08/17 12:26:04 carl
  614. + simple cleanup of comments
  615. Revision 1.9 1998/07/30 13:26:14 michael
  616. + Added support for ErrorProc variable. All internal functions are required
  617. to call HandleError instead of runerror from now on.
  618. This is necessary for exception support.
  619. Revision 1.8 1998/07/10 11:02:41 peter
  620. * support_fixed, becuase fixed is not 100% yet for the m68k
  621. Revision 1.7 1998/07/02 12:20:58 carl
  622. + Io-Error and overflow print erroraddr in hex now
  623. Revision 1.6 1998/07/01 14:25:57 carl
  624. * strconcat was copying one byte too much
  625. * strcopy bugfix was using signed comparison
  626. + STRCOPY uses register calling conventions
  627. * FillChar bugfix was loading a word instead of a byte
  628. }