1 /*- 2 * modified for Lites 1.1 3 * 4 * Aug 1995, Godmar Back (gback@cs.utah.edu) 5 * University of Utah, Department of Computer Science 6 */ 7 /*- 8 * SPDX-License-Identifier: BSD-3-Clause 9 * 10 * Copyright (c) 1982, 1986, 1989, 1993 11 * The Regents of the University of California. All rights reserved. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 3. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 * 37 * @(#)ffs_inode.c 8.5 (Berkeley) 12/30/93 38 * $FreeBSD$ 39 */ 40 41 #include <sys/param.h> 42 #include <sys/systm.h> 43 #include <sys/mount.h> 44 #include <sys/bio.h> 45 #include <sys/buf.h> 46 #include <sys/vnode.h> 47 #include <sys/malloc.h> 48 #include <sys/rwlock.h> 49 50 #include <vm/vm.h> 51 #include <vm/vm_extern.h> 52 53 #include <fs/ext2fs/inode.h> 54 #include <fs/ext2fs/ext2_mount.h> 55 #include <fs/ext2fs/ext2fs.h> 56 #include <fs/ext2fs/fs.h> 57 #include <fs/ext2fs/ext2_extern.h> 58 #include <fs/ext2fs/ext2_extattr.h> 59 60 /* 61 * Update the access, modified, and inode change times as specified by the 62 * IN_ACCESS, IN_UPDATE, and IN_CHANGE flags respectively. Write the inode 63 * to disk if the IN_MODIFIED flag is set (it may be set initially, or by 64 * the timestamp update). The IN_LAZYMOD flag is set to force a write 65 * later if not now. If we write now, then clear both IN_MODIFIED and 66 * IN_LAZYMOD to reflect the presumably successful write, and if waitfor is 67 * set, then wait for the write to complete. 68 */ 69 int 70 ext2_update(struct vnode *vp, int waitfor) 71 { 72 struct m_ext2fs *fs; 73 struct buf *bp; 74 struct inode *ip; 75 int error; 76 77 ASSERT_VOP_ELOCKED(vp, "ext2_update"); 78 ext2_itimes(vp); 79 ip = VTOI(vp); 80 if ((ip->i_flag & IN_MODIFIED) == 0 && waitfor == 0) 81 return (0); 82 ip->i_flag &= ~(IN_LAZYACCESS | IN_LAZYMOD | IN_MODIFIED); 83 fs = ip->i_e2fs; 84 if (fs->e2fs_ronly) 85 return (0); 86 if ((error = bread(ip->i_devvp, 87 fsbtodb(fs, ino_to_fsba(fs, ip->i_number)), 88 (int)fs->e2fs_bsize, NOCRED, &bp)) != 0) { 89 brelse(bp); 90 return (error); 91 } 92 error = ext2_i2ei(ip, (struct ext2fs_dinode *)((char *)bp->b_data + 93 EXT2_INODE_SIZE(fs) * ino_to_fsbo(fs, ip->i_number))); 94 if (error) { 95 brelse(bp); 96 return (error); 97 } 98 if (waitfor && !DOINGASYNC(vp)) 99 return (bwrite(bp)); 100 else { 101 bdwrite(bp); 102 return (0); 103 } 104 } 105 106 #define SINGLE 0 /* index of single indirect block */ 107 #define DOUBLE 1 /* index of double indirect block */ 108 #define TRIPLE 2 /* index of triple indirect block */ 109 110 /* 111 * Release blocks associated with the inode ip and stored in the indirect 112 * block bn. Blocks are free'd in LIFO order up to (but not including) 113 * lastbn. If level is greater than SINGLE, the block is an indirect block 114 * and recursive calls to indirtrunc must be used to cleanse other indirect 115 * blocks. 116 * 117 * NB: triple indirect blocks are untested. 118 */ 119 static int 120 ext2_indirtrunc(struct inode *ip, daddr_t lbn, daddr_t dbn, 121 daddr_t lastbn, int level, e4fs_daddr_t *countp) 122 { 123 struct buf *bp; 124 struct m_ext2fs *fs = ip->i_e2fs; 125 struct vnode *vp; 126 e2fs_daddr_t *bap, *copy; 127 int i, nblocks, error = 0, allerror = 0; 128 e2fs_lbn_t nb, nlbn, last; 129 e4fs_daddr_t blkcount, factor, blocksreleased = 0; 130 131 /* 132 * Calculate index in current block of last 133 * block to be kept. -1 indicates the entire 134 * block so we need not calculate the index. 135 */ 136 factor = 1; 137 for (i = SINGLE; i < level; i++) 138 factor *= NINDIR(fs); 139 last = lastbn; 140 if (lastbn > 0) 141 last /= factor; 142 nblocks = btodb(fs->e2fs_bsize); 143 /* 144 * Get buffer of block pointers, zero those entries corresponding 145 * to blocks to be free'd, and update on disk copy first. Since 146 * double(triple) indirect before single(double) indirect, calls 147 * to bmap on these blocks will fail. However, we already have 148 * the on disk address, so we have to set the b_blkno field 149 * explicitly instead of letting bread do everything for us. 150 */ 151 vp = ITOV(ip); 152 bp = getblk(vp, lbn, (int)fs->e2fs_bsize, 0, 0, 0); 153 if ((bp->b_flags & (B_DONE | B_DELWRI)) == 0) { 154 bp->b_iocmd = BIO_READ; 155 if (bp->b_bcount > bp->b_bufsize) 156 panic("ext2_indirtrunc: bad buffer size"); 157 bp->b_blkno = dbn; 158 vfs_busy_pages(bp, 0); 159 bp->b_iooffset = dbtob(bp->b_blkno); 160 bstrategy(bp); 161 error = bufwait(bp); 162 } 163 if (error) { 164 brelse(bp); 165 *countp = 0; 166 return (error); 167 } 168 bap = (e2fs_daddr_t *)bp->b_data; 169 copy = malloc(fs->e2fs_bsize, M_TEMP, M_WAITOK); 170 bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->e2fs_bsize); 171 bzero((caddr_t)&bap[last + 1], 172 (NINDIR(fs) - (last + 1)) * sizeof(e2fs_daddr_t)); 173 if (last == -1) 174 bp->b_flags |= B_INVAL; 175 if (DOINGASYNC(vp)) { 176 bdwrite(bp); 177 } else { 178 error = bwrite(bp); 179 if (error) 180 allerror = error; 181 } 182 bap = copy; 183 184 /* 185 * Recursively free totally unused blocks. 186 */ 187 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last; 188 i--, nlbn += factor) { 189 nb = bap[i]; 190 if (nb == 0) 191 continue; 192 if (level > SINGLE) { 193 if ((error = ext2_indirtrunc(ip, nlbn, 194 fsbtodb(fs, nb), (int32_t)-1, level - 1, &blkcount)) != 0) 195 allerror = error; 196 blocksreleased += blkcount; 197 } 198 ext2_blkfree(ip, nb, fs->e2fs_bsize); 199 blocksreleased += nblocks; 200 } 201 202 /* 203 * Recursively free last partial block. 204 */ 205 if (level > SINGLE && lastbn >= 0) { 206 last = lastbn % factor; 207 nb = bap[i]; 208 if (nb != 0) { 209 if ((error = ext2_indirtrunc(ip, nlbn, fsbtodb(fs, nb), 210 last, level - 1, &blkcount)) != 0) 211 allerror = error; 212 blocksreleased += blkcount; 213 } 214 } 215 free(copy, M_TEMP); 216 *countp = blocksreleased; 217 return (allerror); 218 } 219 220 /* 221 * Truncate the inode oip to at most length size, freeing the 222 * disk blocks. 223 */ 224 static int 225 ext2_ind_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred, 226 struct thread *td) 227 { 228 struct vnode *ovp = vp; 229 e4fs_daddr_t lastblock; 230 struct inode *oip; 231 e4fs_daddr_t bn, lbn, lastiblock[EXT2_NIADDR], indir_lbn[EXT2_NIADDR]; 232 uint32_t oldblks[EXT2_NDADDR + EXT2_NIADDR]; 233 uint32_t newblks[EXT2_NDADDR + EXT2_NIADDR]; 234 struct m_ext2fs *fs; 235 struct buf *bp; 236 int offset, size, level; 237 e4fs_daddr_t count, nblocks, blocksreleased = 0; 238 int error, i, allerror; 239 off_t osize; 240 #ifdef INVARIANTS 241 struct bufobj *bo; 242 #endif 243 244 oip = VTOI(ovp); 245 #ifdef INVARIANTS 246 bo = &ovp->v_bufobj; 247 #endif 248 249 fs = oip->i_e2fs; 250 osize = oip->i_size; 251 /* 252 * Lengthen the size of the file. We must ensure that the 253 * last byte of the file is allocated. Since the smallest 254 * value of osize is 0, length will be at least 1. 255 */ 256 if (osize < length) { 257 if (length > oip->i_e2fs->e2fs_maxfilesize) 258 return (EFBIG); 259 vnode_pager_setsize(ovp, length); 260 offset = blkoff(fs, length - 1); 261 lbn = lblkno(fs, length - 1); 262 flags |= BA_CLRBUF; 263 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, flags); 264 if (error) { 265 vnode_pager_setsize(vp, osize); 266 return (error); 267 } 268 oip->i_size = length; 269 if (bp->b_bufsize == fs->e2fs_bsize) 270 bp->b_flags |= B_CLUSTEROK; 271 if (flags & IO_SYNC) 272 bwrite(bp); 273 else if (DOINGASYNC(ovp)) 274 bdwrite(bp); 275 else 276 bawrite(bp); 277 oip->i_flag |= IN_CHANGE | IN_UPDATE; 278 return (ext2_update(ovp, !DOINGASYNC(ovp))); 279 } 280 /* 281 * Shorten the size of the file. If the file is not being 282 * truncated to a block boundary, the contents of the 283 * partial block following the end of the file must be 284 * zero'ed in case it ever become accessible again because 285 * of subsequent file growth. 286 */ 287 /* I don't understand the comment above */ 288 offset = blkoff(fs, length); 289 if (offset == 0) { 290 oip->i_size = length; 291 } else { 292 lbn = lblkno(fs, length); 293 flags |= BA_CLRBUF; 294 error = ext2_balloc(oip, lbn, offset, cred, &bp, flags); 295 if (error) 296 return (error); 297 oip->i_size = length; 298 size = blksize(fs, oip, lbn); 299 bzero((char *)bp->b_data + offset, (u_int)(size - offset)); 300 allocbuf(bp, size); 301 if (bp->b_bufsize == fs->e2fs_bsize) 302 bp->b_flags |= B_CLUSTEROK; 303 if (flags & IO_SYNC) 304 bwrite(bp); 305 else if (DOINGASYNC(ovp)) 306 bdwrite(bp); 307 else 308 bawrite(bp); 309 } 310 /* 311 * Calculate index into inode's block list of 312 * last direct and indirect blocks (if any) 313 * which we want to keep. Lastblock is -1 when 314 * the file is truncated to 0. 315 */ 316 lastblock = lblkno(fs, length + fs->e2fs_bsize - 1) - 1; 317 lastiblock[SINGLE] = lastblock - EXT2_NDADDR; 318 lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs); 319 lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs); 320 nblocks = btodb(fs->e2fs_bsize); 321 /* 322 * Update file and block pointers on disk before we start freeing 323 * blocks. If we crash before free'ing blocks below, the blocks 324 * will be returned to the free list. lastiblock values are also 325 * normalized to -1 for calls to ext2_indirtrunc below. 326 */ 327 for (level = TRIPLE; level >= SINGLE; level--) { 328 oldblks[EXT2_NDADDR + level] = oip->i_ib[level]; 329 if (lastiblock[level] < 0) { 330 oip->i_ib[level] = 0; 331 lastiblock[level] = -1; 332 } 333 } 334 for (i = 0; i < EXT2_NDADDR; i++) { 335 oldblks[i] = oip->i_db[i]; 336 if (i > lastblock) 337 oip->i_db[i] = 0; 338 } 339 oip->i_flag |= IN_CHANGE | IN_UPDATE; 340 allerror = ext2_update(ovp, !DOINGASYNC(ovp)); 341 342 /* 343 * Having written the new inode to disk, save its new configuration 344 * and put back the old block pointers long enough to process them. 345 * Note that we save the new block configuration so we can check it 346 * when we are done. 347 */ 348 for (i = 0; i < EXT2_NDADDR; i++) { 349 newblks[i] = oip->i_db[i]; 350 oip->i_db[i] = oldblks[i]; 351 } 352 for (i = 0; i < EXT2_NIADDR; i++) { 353 newblks[EXT2_NDADDR + i] = oip->i_ib[i]; 354 oip->i_ib[i] = oldblks[EXT2_NDADDR + i]; 355 } 356 oip->i_size = osize; 357 error = vtruncbuf(ovp, cred, length, (int)fs->e2fs_bsize); 358 if (error && (allerror == 0)) 359 allerror = error; 360 vnode_pager_setsize(ovp, length); 361 362 /* 363 * Indirect blocks first. 364 */ 365 indir_lbn[SINGLE] = -EXT2_NDADDR; 366 indir_lbn[DOUBLE] = indir_lbn[SINGLE] - NINDIR(fs) - 1; 367 indir_lbn[TRIPLE] = indir_lbn[DOUBLE] - NINDIR(fs) * NINDIR(fs) - 1; 368 for (level = TRIPLE; level >= SINGLE; level--) { 369 bn = oip->i_ib[level]; 370 if (bn != 0) { 371 error = ext2_indirtrunc(oip, indir_lbn[level], 372 fsbtodb(fs, bn), lastiblock[level], level, &count); 373 if (error) 374 allerror = error; 375 blocksreleased += count; 376 if (lastiblock[level] < 0) { 377 oip->i_ib[level] = 0; 378 ext2_blkfree(oip, bn, fs->e2fs_fsize); 379 blocksreleased += nblocks; 380 } 381 } 382 if (lastiblock[level] >= 0) 383 goto done; 384 } 385 386 /* 387 * All whole direct blocks or frags. 388 */ 389 for (i = EXT2_NDADDR - 1; i > lastblock; i--) { 390 long bsize; 391 392 bn = oip->i_db[i]; 393 if (bn == 0) 394 continue; 395 oip->i_db[i] = 0; 396 bsize = blksize(fs, oip, i); 397 ext2_blkfree(oip, bn, bsize); 398 blocksreleased += btodb(bsize); 399 } 400 if (lastblock < 0) 401 goto done; 402 403 /* 404 * Finally, look for a change in size of the 405 * last direct block; release any frags. 406 */ 407 bn = oip->i_db[lastblock]; 408 if (bn != 0) { 409 long oldspace, newspace; 410 411 /* 412 * Calculate amount of space we're giving 413 * back as old block size minus new block size. 414 */ 415 oldspace = blksize(fs, oip, lastblock); 416 oip->i_size = length; 417 newspace = blksize(fs, oip, lastblock); 418 if (newspace == 0) 419 panic("ext2_truncate: newspace"); 420 if (oldspace - newspace > 0) { 421 /* 422 * Block number of space to be free'd is 423 * the old block # plus the number of frags 424 * required for the storage we're keeping. 425 */ 426 bn += numfrags(fs, newspace); 427 ext2_blkfree(oip, bn, oldspace - newspace); 428 blocksreleased += btodb(oldspace - newspace); 429 } 430 } 431 done: 432 #ifdef INVARIANTS 433 for (level = SINGLE; level <= TRIPLE; level++) 434 if (newblks[EXT2_NDADDR + level] != oip->i_ib[level]) 435 panic("itrunc1"); 436 for (i = 0; i < EXT2_NDADDR; i++) 437 if (newblks[i] != oip->i_db[i]) 438 panic("itrunc2"); 439 BO_LOCK(bo); 440 if (length == 0 && (bo->bo_dirty.bv_cnt != 0 || 441 bo->bo_clean.bv_cnt != 0)) 442 panic("itrunc3"); 443 BO_UNLOCK(bo); 444 #endif /* INVARIANTS */ 445 /* 446 * Put back the real size. 447 */ 448 oip->i_size = length; 449 if (oip->i_blocks >= blocksreleased) 450 oip->i_blocks -= blocksreleased; 451 else /* sanity */ 452 oip->i_blocks = 0; 453 oip->i_flag |= IN_CHANGE; 454 vnode_pager_setsize(ovp, length); 455 return (allerror); 456 } 457 458 static int 459 ext2_ext_truncate(struct vnode *vp, off_t length, int flags, 460 struct ucred *cred, struct thread *td) 461 { 462 struct vnode *ovp = vp; 463 int32_t lastblock; 464 struct m_ext2fs *fs; 465 struct inode *oip; 466 struct buf *bp; 467 uint32_t lbn, offset; 468 int error, size; 469 off_t osize; 470 471 oip = VTOI(ovp); 472 fs = oip->i_e2fs; 473 osize = oip->i_size; 474 475 if (osize < length) { 476 if (length > oip->i_e2fs->e2fs_maxfilesize) { 477 return (EFBIG); 478 } 479 vnode_pager_setsize(ovp, length); 480 offset = blkoff(fs, length - 1); 481 lbn = lblkno(fs, length - 1); 482 flags |= BA_CLRBUF; 483 error = ext2_balloc(oip, lbn, offset + 1, cred, &bp, flags); 484 if (error) { 485 vnode_pager_setsize(vp, osize); 486 return (error); 487 } 488 oip->i_size = length; 489 if (bp->b_bufsize == fs->e2fs_bsize) 490 bp->b_flags |= B_CLUSTEROK; 491 if (flags & IO_SYNC) 492 bwrite(bp); 493 else if (DOINGASYNC(ovp)) 494 bdwrite(bp); 495 else 496 bawrite(bp); 497 oip->i_flag |= IN_CHANGE | IN_UPDATE; 498 return (ext2_update(ovp, !DOINGASYNC(ovp))); 499 } 500 501 lastblock = (length + fs->e2fs_bsize - 1) / fs->e2fs_bsize; 502 error = ext4_ext_remove_space(oip, lastblock, flags, cred, td); 503 if (error) 504 return (error); 505 506 offset = blkoff(fs, length); 507 if (offset == 0) { 508 oip->i_size = length; 509 } else { 510 lbn = lblkno(fs, length); 511 flags |= BA_CLRBUF; 512 error = ext2_balloc(oip, lbn, offset, cred, &bp, flags); 513 if (error) { 514 return (error); 515 } 516 oip->i_size = length; 517 size = blksize(fs, oip, lbn); 518 bzero((char *)bp->b_data + offset, (u_int)(size - offset)); 519 allocbuf(bp, size); 520 if (bp->b_bufsize == fs->e2fs_bsize) 521 bp->b_flags |= B_CLUSTEROK; 522 if (flags & IO_SYNC) 523 bwrite(bp); 524 else if (DOINGASYNC(ovp)) 525 bdwrite(bp); 526 else 527 bawrite(bp); 528 } 529 530 oip->i_size = osize; 531 error = vtruncbuf(ovp, cred, length, (int)fs->e2fs_bsize); 532 if (error) 533 return (error); 534 535 vnode_pager_setsize(ovp, length); 536 537 oip->i_size = length; 538 oip->i_flag |= IN_CHANGE | IN_UPDATE; 539 error = ext2_update(ovp, !DOINGASYNC(ovp)); 540 541 return (error); 542 } 543 544 /* 545 * Truncate the inode ip to at most length size, freeing the 546 * disk blocks. 547 */ 548 int 549 ext2_truncate(struct vnode *vp, off_t length, int flags, struct ucred *cred, 550 struct thread *td) 551 { 552 struct inode *ip; 553 int error; 554 555 ASSERT_VOP_LOCKED(vp, "ext2_truncate"); 556 557 if (length < 0) 558 return (EINVAL); 559 560 ip = VTOI(vp); 561 if (vp->v_type == VLNK && 562 ip->i_size < vp->v_mount->mnt_maxsymlinklen) { 563 #ifdef INVARIANTS 564 if (length != 0) 565 panic("ext2_truncate: partial truncate of symlink"); 566 #endif 567 bzero((char *)&ip->i_shortlink, (u_int)ip->i_size); 568 ip->i_size = 0; 569 ip->i_flag |= IN_CHANGE | IN_UPDATE; 570 return (ext2_update(vp, 1)); 571 } 572 if (ip->i_size == length) { 573 ip->i_flag |= IN_CHANGE | IN_UPDATE; 574 return (ext2_update(vp, 0)); 575 } 576 577 if (ip->i_flag & IN_E4EXTENTS) 578 error = ext2_ext_truncate(vp, length, flags, cred, td); 579 else 580 error = ext2_ind_truncate(vp, length, flags, cred, td); 581 582 return (error); 583 } 584 585 /* 586 * discard preallocated blocks 587 */ 588 int 589 ext2_inactive(struct vop_inactive_args *ap) 590 { 591 struct vnode *vp = ap->a_vp; 592 struct inode *ip = VTOI(vp); 593 struct thread *td = ap->a_td; 594 int mode, error = 0; 595 596 /* 597 * Ignore inodes related to stale file handles. 598 */ 599 if (ip->i_mode == 0) 600 goto out; 601 if (ip->i_nlink <= 0) { 602 ext2_extattr_free(ip); 603 error = ext2_truncate(vp, (off_t)0, 0, NOCRED, td); 604 if (!(ip->i_flag & IN_E4EXTENTS)) 605 ip->i_rdev = 0; 606 mode = ip->i_mode; 607 ip->i_mode = 0; 608 ip->i_flag |= IN_CHANGE | IN_UPDATE; 609 ext2_vfree(vp, ip->i_number, mode); 610 } 611 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE)) 612 ext2_update(vp, 0); 613 out: 614 /* 615 * If we are done with the inode, reclaim it 616 * so that it can be reused immediately. 617 */ 618 if (ip->i_mode == 0) 619 vrecycle(vp); 620 return (error); 621 } 622 623 /* 624 * Reclaim an inode so that it can be used for other purposes. 625 */ 626 int 627 ext2_reclaim(struct vop_reclaim_args *ap) 628 { 629 struct inode *ip; 630 struct vnode *vp = ap->a_vp; 631 632 ip = VTOI(vp); 633 if (ip->i_flag & IN_LAZYMOD) { 634 ip->i_flag |= IN_MODIFIED; 635 ext2_update(vp, 0); 636 } 637 vfs_hash_remove(vp); 638 free(vp->v_data, M_EXT2NODE); 639 vp->v_data = 0; 640 vnode_destroy_vobject(vp); 641 return (0); 642 } 643