Lines Matching refs:dirty
15 * contains a lot of dirty space (obsolete nodes), and copies the non-obsolete
18 * dirty in the TNC, and after the next commit, the garbage-collected LEB is
19 * to be reused. Garbage collection will cause the number of dirty index nodes
24 * LEBs which have less than @c->dead_wm bytes of free + dirty space are full
29 * actually reclaim even very small pieces of dirty space by garbage collecting
30 * enough dirty LEBs, but we do not bother doing this at this implementation.
37 * maximum size. So dark watermark is the amount of free + dirty space in LEB
39 * be unable to reclaim it. So, LEBs with free + dirty greater than dark
473 if (lp->free + lp->dirty == c->leb_size) {
518 dbg_gc("indexing LEB %d (free %d, dirty %d)",
519 lnum, lp->free, lp->dirty);
554 dbg_gc("data LEB %d (free %d, dirty %d)",
555 lnum, lp->free, lp->dirty);
616 * marking indexing nodes dirty when GC'ing indexing LEBs. Thus, at some point
698 * continuing to GC dirty LEBs. Hence we request
704 dbg_gc("no more dirty LEBs");
708 dbg_gc("found LEB %d: free %d, dirty %d, sum %d (min. space %d)",
709 lp.lnum, lp.free, lp.dirty, lp.free + lp.dirty,
777 * 2. request an LEB with more dirty space, which will force
824 * If a LEB has only dirty and free space, then we may safely unmap it and make
825 * it free. Note, we cannot do this with indexing LEBs because dirty space may