Lines Matching refs:bb
963 Block *bb; in _blockSetLabel() local
973 bb = cacheLocal(c, PartLabel, a, OReadWrite); in _blockSetLabel()
974 if(bb == nil){ in _blockSetLabel()
979 labelPack(l, bb->data, b->addr%lpb); in _blockSetLabel()
980 blockDirty(bb); in _blockSetLabel()
981 return bb; in _blockSetLabel()
1028 blockDependency(Block *b, Block *bb, int index, uchar *score, Entry *e) in blockDependency() argument
1032 if(bb->iostate == BioClean) in blockDependency()
1044 if(index == -1 && bb->part == PartData) in blockDependency()
1047 if(bb->iostate != BioDirty){ in blockDependency()
1049 argv0, bb->part, bb->addr, bb->l.type, bb->iostate); in blockDependency()
1053 p = blistAlloc(bb); in blockDependency()
1057 assert(bb->iostate == BioDirty); in blockDependency()
1058 …:%x:%d depends on %d:%x:%d\n", argv0, b->part, b->addr, b->l.type, bb->part, bb->addr, bb->l.type); in blockDependency()
1060 p->part = bb->part; in blockDependency()
1061 p->addr = bb->addr; in blockDependency()
1062 p->type = bb->l.type; in blockDependency()
1063 p->vers = bb->vers; in blockDependency()
1175 Block *bb; in blockWrite() local
1194 bb = _cacheLocalLookup(c, p->part, p->addr, p->vers, waitlock, in blockWrite()
1196 if(bb == nil){ in blockWrite()
1210 if(bb->iostate != BioDirty){ in blockWrite()
1212 argv0, bb->part, bb->addr, bb->l.type, bb->iostate); in blockWrite()
1214 if(bb->iostate == BioClean) in blockWrite()
1218 blockPut(bb); in blockWrite()
1226 argv0, b->part, b->addr, b->vers, b->l.type, p->part, p->addr, bb->vers); in blockWrite()
1395 Block *bb, *lb; in blockCopy() local
1402 bb = cacheAllocBlock(b->c, b->l.type, tag, ehi, elo); in blockCopy()
1403 if(bb == nil){ in blockCopy()
1427 blockSetLabel(bb, &l, 0); in blockCopy()
1428 blockPut(bb); in blockCopy()
1431 blockDependency(bb, lb, -1, nil, nil); in blockCopy()
1435 memmove(bb->data, b->data, b->c->size); in blockCopy()
1436 blockDirty(bb); in blockCopy()
1438 return bb; in blockCopy()
1764 Block *bb; in upHeap() local
1773 bb = c->heap[p]; in upHeap()
1774 if(b->used - now >= bb->used - now) in upHeap()
1776 c->heap[i] = bb; in upHeap()
1777 bb->heap = i; in upHeap()
1788 Block *bb; in downHeap() local
1801 bb = c->heap[k]; in downHeap()
1802 if(b->used - now <= bb->used - now) in downHeap()
1804 c->heap[i] = bb; in downHeap()
1805 bb->heap = i; in downHeap()