HomeSort by: relevance | last modified time | path
    Searched refs:cheb (Results 1 - 6 of 6) sorted by relevancy

  /src/sys/ufs/chfs/
chfs_erase.c 51 struct chfs_eraseblock *cheb; local
67 cheb = TAILQ_FIRST(&chmp->chm_erasable_pending_wbuf_queue);
68 TAILQ_REMOVE(&chmp->chm_erasable_pending_wbuf_queue, cheb, queue);
74 TAILQ_INSERT_TAIL(&chmp->chm_erase_pending_queue, cheb, queue);
82 cheb = TAILQ_FIRST(&chmp->chm_erase_pending_queue);
83 TAILQ_REMOVE(&chmp->chm_erase_pending_queue, cheb, queue);
86 dirty = cheb->dirty_size;
87 unchecked = cheb->unchecked_size;
88 used = cheb->used_size;
89 free = cheb->free_size
    [all...]
chfs_nodeops.c 45 struct chfs_eraseblock *cheb, uint32_t size)
53 if (size > cheb->free_size) {
55 "on block (%d)\n", cheb->free_size, size, cheb->lnr);
59 chfs_change_size_free(chmp, cheb, -size);
60 chfs_change_size_dirty(chmp, cheb, size);
256 struct chfs_eraseblock *cheb, struct chfs_node_ref *nref)
262 if (!cheb)
263 cheb = &chmp->chm_blocks[nref->nref_lnr];
268 return chmp->chm_ebh->eb_size - cheb->free_size
281 struct chfs_eraseblock *cheb; local
544 struct chfs_eraseblock *cheb; local
    [all...]
chfs_scan.c 103 struct chfs_eraseblock *cheb, void *buf, off_t ofs)
119 cheb, le32toh(vnode->length));
140 nref = chfs_alloc_node_ref(cheb);
144 KASSERT(nref->nref_lnr == cheb->lnr);
152 err = chfs_update_eb_dirty(chmp, cheb,
166 chfs_change_size_free(chmp, cheb, -le32toh(vnode->length));
167 chfs_change_size_used(chmp, cheb, le32toh(vnode->length));
170 KASSERT(cheb->used_size <= chmp->chm_ebh->eb_size);
172 KASSERT(cheb->used_size + cheb->free_size + cheb->dirty_size + cheb->unchecked_size + cheb->wasted_size == chmp->chm_ebh->eb_size (…)
215 struct chfs_eraseblock *cheb, *oldcheb; local
    [all...]
chfs_malloc.c 219 chfs_alloc_node_ref(struct chfs_eraseblock *cheb)
222 old = cheb->last_node;
223 nref = cheb->last_node;
229 cheb->first_node = nref;
230 cheb->last_node = nref;
231 nref->nref_lnr = cheb->lnr;
232 KASSERT(cheb->lnr == nref->nref_lnr);
245 cheb->last_node = nref;
246 nref->nref_lnr = cheb->lnr;
249 nref->nref_lnr == cheb->lnr)
    [all...]
chfs_vnode.c 340 struct chfs_eraseblock *cheb, int change)
344 KASSERT((int)(cheb->free_size + change) >= 0);
345 KASSERT((int)(cheb->free_size + change) <= chmp->chm_ebh->eb_size);
347 cheb->free_size += change;
358 struct chfs_eraseblock *cheb, int change)
362 KASSERT((int)(cheb->dirty_size + change) >= 0);
363 KASSERT((int)(cheb->dirty_size + change) <= chmp->chm_ebh->eb_size);
365 cheb->dirty_size += change;
376 struct chfs_eraseblock *cheb, int change)
380 KASSERT((int)(cheb->unchecked_size + change) >= 0)
    [all...]
chfs_gc.c 162 struct chfs_eraseblock *cheb; local
195 TAILQ_FOREACH(cheb, &chmp->chm_very_dirty_queue, queue) {
699 chfs_gcollect_pristine(struct chfs_mount *chmp, struct chfs_eraseblock *cheb,
709 size_t totlen = chfs_nref_len(chmp, cheb, nref);
848 struct chfs_eraseblock *cheb, struct chfs_node_ref *nref,
860 if (chmp->chm_gcblock != cheb) {
894 cheb, ip->chvc, nref);
901 ret = chfs_gcollect_dnode(chmp, cheb, ip, fn, start, end);
917 ret = chfs_gcollect_dirent(chmp, cheb, ip, fd);
920 ret = chfs_gcollect_deletion_dirent(chmp, cheb, ip, fd)
    [all...]

Completed in 34 milliseconds