Home | History | Annotate | Download | only in lfs_cleanerd

Lines Matching defs:bip

415 check_test_pattern(BLOCK_INFO *bip)
418 unsigned char *cp = bip->bi_bp;
421 if (bip->bi_lbn == LFS_UNUSED_LBN) {
422 assert(((struct ulfs1_dinode *)bip->bi_bp)->di_inumber ==
423 bip->bi_inode);
427 if (bip->bi_inode > 3)
430 for (j = 0; j < bip->bi_size; j++) {
434 assert(j < bip->bi_size);
440 * bip. Return the address of the next partial segment to read.
447 BLOCK_INFO *bip, *nbip;
461 bip = *bipp;
510 *bipp = bip;
540 nbip = (BLOCK_INFO *)realloc(bip, *bic *
541 sizeof(*bip));
543 bip = nbip;
546 *bipp = bip;
549 bip[*bic - 1].bi_inode = lfs_dino_getinumber(fs, dip);
550 bip[*bic - 1].bi_lbn = LFS_UNUSED_LBN;
551 bip[*bic - 1].bi_daddr = daddr;
552 bip[*bic - 1].bi_segcreate = lfs_ss_getcreate(fs, ssp);
553 bip[*bic - 1].bi_version = lfs_dino_getgen(fs, dip);
554 bip[*bic - 1].bi_bp = dip;
555 bip[*bic - 1].bi_size = DINOSIZE(fs);
623 nbip = (BLOCK_INFO *)realloc(bip, (*bic + lfs_fi_getnblocks(fs, fip)) *
624 sizeof(*bip));
626 bip = nbip;
628 *bipp = bip;
633 bip[*bic + i].bi_inode = lfs_fi_getino(fs, fip);
634 bip[*bic + i].bi_lbn = lfs_fi_getblock(fs, fip, i);
635 bip[*bic + i].bi_daddr = daddr;
636 bip[*bic + i].bi_segcreate = lfs_ss_getcreate(fs, ssp);
637 bip[*bic + i].bi_version = lfs_fi_getversion(fs, fip);
638 bip[*bic + i].bi_size = (i == lfs_fi_getnblocks(fs, fip) - 1) ?
642 bip[*bic + i].bi_bp = cp;
643 daddr += lfs_btofsb(fs, bip[*bic + i].bi_size);
646 check_test_pattern(bip + *bic + i); /* XXXDEBUG */
664 *bipp = bip;
867 BLOCK_INFO *bip = *bipp;
873 if (bic == 0 || bip == NULL)
881 bip[i].bi_segcreate = bip[i].bi_daddr;
891 heapsort(bip, *bic, sizeof(BLOCK_INFO), bi_comparator);
894 lim.blkiov = bip;
903 heapsort(bip, *bic, sizeof(BLOCK_INFO), bi_comparator);
909 if (bip[i].bi_segcreate != bip[i].bi_daddr)
912 *sizep += bip[i].bi_size;
914 *bic = i; /* XXX should we shrink bip? */
915 *bipp = bip;
926 BLOCK_INFO *bip;
938 bip = NULL;
941 if (load_segment(fs, sn, &bip, &bic) <= 0)
944 toss_old_blocks(fs, &bip, &widebic, NULL);
949 nb += bip[i].bi_size;
958 lim.blkiov = bip;
986 check_or_add(ino_t ino, daddr_t lbn, BLOCK_INFO *bip, int bic, BLOCK_INFO **ebipp, int *ebicp)
993 if (bip[k].bi_inode != ino)
995 if (bip[k].bi_lbn == lbn) {
1029 check_hidden_cost(struct clfs *fs, BLOCK_INFO *bip, int bic, off_t *ifc)
1042 if (i == 0 || bip[i].bi_inode != bip[start].bi_inode) {
1047 if (bip[i].bi_inode != LFS_IFILE_INUM) {
1048 lbn = lfs_sb_getcleansz(fs) + bip[i].bi_inode /
1051 bip, bic, &ebip, &ebic);
1054 if (bip[i].bi_lbn == LFS_UNUSED_LBN)
1056 if (bip[i].bi_lbn < ULFS_NDADDR)
1060 ulfs_getlbns((struct lfs *)fs, NULL, (daddr_t)bip[i].bi_lbn, in, &num);
1062 check_or_add(bip[i].bi_inode, in[j].in_lbn,
1063 bip + start, bic - start, &ebip, &ebic);
1082 static BLOCK_INFO *bip;
1128 /* Load some segments' blocks into bip */
1157 if ((r = load_segment(fs, sn, &bip, &bic)) > 0) {
1160 toss_old_blocks(fs, &bip, &widebic, &bytes);
1182 if ((r = load_segment(fs, sn, &bip, &bic)) > 0)
1190 toss_old_blocks(fs, &bip, &widebic, NULL);
1204 nb += bip[i].bi_size;
1217 extra = lfs_sb_getbsize(fs) * (off_t)check_hidden_cost(fs, bip, bic, &if_extra);
1227 for (mc = 0, mbip = bip; mc < bic; mc += inc, mbip += inc) {
1617 BLOCK_INFO *bip = NULL;
1629 load_segment(fsp[0], i, &bip, &bic);