bp 31 fs.c struct buf *bp;
bp 33 fs.c bp = bread(dev, 1);
bp 34 fs.c memmove(sb, bp->data, sizeof(*sb));
bp 35 fs.c brelse(bp);
bp 42 fs.c struct buf *bp;
bp 44 fs.c bp = bread(dev, bno);
bp 45 fs.c memset(bp->data, 0, BSIZE);
bp 46 fs.c log_write(bp);
bp 47 fs.c brelse(bp);
bp 57 fs.c struct buf *bp;
bp 59 fs.c bp = 0;
bp 61 fs.c bp = bread(dev, BBLOCK(b, sb));
bp 64 fs.c if((bp->data[bi/8] & m) == 0){ // Is block free?
bp 65 fs.c bp->data[bi/8] |= m; // Mark block in use.
bp 66 fs.c log_write(bp);
bp 67 fs.c brelse(bp);
bp 72 fs.c brelse(bp);
bp 81 fs.c struct buf *bp;
bp 85 fs.c bp = bread(dev, BBLOCK(b, sb));
bp 88 fs.c if((bp->data[bi/8] & m) == 0)
bp 90 fs.c bp->data[bi/8] &= ~m;
bp 91 fs.c log_write(bp);
bp 92 fs.c brelse(bp);
bp 180 fs.c struct buf *bp;
bp 184 fs.c bp = bread(dev, IBLOCK(inum, sb));
bp 185 fs.c dip = (struct dinode*)bp->data + inum%IPB;
bp 189 fs.c log_write(bp); // mark it allocated on the disk
bp 190 fs.c brelse(bp);
bp 193 fs.c brelse(bp);
bp 202 fs.c struct buf *bp;
bp 205 fs.c bp = bread(ip->dev, IBLOCK(ip->inum, sb));
bp 206 fs.c dip = (struct dinode*)bp->data + ip->inum%IPB;
bp 213 fs.c log_write(bp);
bp 214 fs.c brelse(bp);
bp 269 fs.c struct buf *bp;
bp 282 fs.c bp = bread(ip->dev, IBLOCK(ip->inum, sb));
bp 283 fs.c dip = (struct dinode*)bp->data + ip->inum%IPB;
bp 290 fs.c brelse(bp);
bp 360 fs.c struct buf *bp;
bp 373 fs.c bp = bread(ip->dev, addr);
bp 374 fs.c a = (uint*)bp->data;
bp 377 fs.c log_write(bp);
bp 379 fs.c brelse(bp);
bp 395 fs.c struct buf *bp;
bp 406 fs.c bp = bread(ip->dev, ip->addrs[NDIRECT]);
bp 407 fs.c a = (uint*)bp->data;
bp 412 fs.c brelse(bp);
bp 438 fs.c struct buf *bp;
bp 452 fs.c bp = bread(ip->dev, bmap(ip, off/BSIZE));
bp 454 fs.c memmove(dst, bp->data + off%BSIZE, m);
bp 455 fs.c brelse(bp);
bp 466 fs.c struct buf *bp;
bp 480 fs.c bp = bread(ip->dev, bmap(ip, off/BSIZE));
bp 482 fs.c memmove(bp->data + off%BSIZE, src, m);
bp 483 fs.c log_write(bp);
bp 484 fs.c brelse(bp);
bp 27 umalloc.c Header *bp, *p;
bp 29 umalloc.c bp = (Header*)ap - 1;
bp 30 umalloc.c for(p = freep; !(bp > p && bp < p->s.ptr); p = p->s.ptr)
bp 31 umalloc.c if(p >= p->s.ptr && (bp > p || bp < p->s.ptr))
bp 33 umalloc.c if(bp + bp->s.size == p->s.ptr){
bp 34 umalloc.c bp->s.size += p->s.ptr->s.size;
bp 35 umalloc.c bp->s.ptr = p->s.ptr->s.ptr;
bp 37 umalloc.c bp->s.ptr = p->s.ptr;
bp 38 umalloc.c if(p + p->s.size == bp){
bp 39 umalloc.c p->s.size += bp->s.size;
bp 40 umalloc.c p->s.ptr = bp->s.ptr;
bp 42 umalloc.c p->s.ptr = bp;