Home
last modified time | relevance | path

Searched refs:last_gc (Results 1 - 14 of 14) sorted by relevance

/kernel/linux/linux-6.6/net/netfilter/
H A Dnf_conncount.c135 if (time_is_after_eq_jiffies((unsigned long)list->last_gc)) in __nf_conncount_add()
197 list->last_gc = (u32)jiffies; in __nf_conncount_add()
222 list->last_gc = (u32)jiffies; in nf_conncount_list_init()
237 if (time_is_after_eq_jiffies((unsigned long)READ_ONCE(list->last_gc))) in nf_conncount_gc_list()
271 list->last_gc = (u32)jiffies; in nf_conncount_gc_list()
H A Dnft_set_pipapo.h167 * @last_gc: Timestamp of last garbage collection run, jiffies
174 unsigned long last_gc; member
H A Dnft_set_pipapo.c1639 priv->last_gc = jiffies;
1699 if (time_after_eq(jiffies, priv->last_gc + nft_set_gc_interval(set)))
2277 priv->last_gc = jiffies;
/kernel/linux/linux-6.6/include/net/netfilter/
H A Dnf_conntrack_count.h13 u32 last_gc; /* jiffies at most recent gc */ member
/kernel/linux/linux-5.10/net/netfilter/
H A Dnft_set_pipapo.h167 * @last_gc: Timestamp of last garbage collection run, jiffies
174 unsigned long last_gc; member
H A Dnft_set_pipapo.c1637 priv->last_gc = jiffies;
1697 if (time_after_eq(jiffies, priv->last_gc + nft_set_gc_interval(set)))
2270 priv->last_gc = jiffies;
/kernel/linux/linux-5.10/drivers/md/bcache/
H A Dbcache.h201 uint8_t last_gc; /* Most out of date gen in the btree */ member
620 * max(gen - last_gc) for all buckets. When it gets too big we have to
911 * the oldest gen of any pointer into that bucket in the btree (last_gc).
916 return b->gen - b->last_gc; in bucket_gc_gen()
H A Dextents.c199 "inconsistent btree pointer %s: bucket %zi pin %i prio %i gen %i last_gc %i mark %llu", in btree_ptr_bad_expensive()
201 g->prio, g->gen, g->last_gc, GC_MARK(g)); in btree_ptr_bad_expensive()
531 "inconsistent extent pointer %s:\nbucket %zu pin %i prio %i gen %i last_gc %i mark %llu", in bch_extent_bad_expensive()
533 g->prio, g->gen, g->last_gc, GC_MARK(g)); in bch_extent_bad_expensive()
H A Dbtree.c1223 if (gen_after(g->last_gc, PTR_GEN(k, i))) in __bch_btree_mark_key()
1224 g->last_gc = PTR_GEN(k, i); in __bch_btree_mark_key()
1722 b->last_gc = b->gen; in btree_gc_start()
H A Dsuper.c728 b->gen = b->last_gc = d->gen; in prio_read()
2066 * btree_gc_finish() will give spurious errors about last_gc > in run_cache_set()
/kernel/linux/linux-6.6/drivers/md/bcache/
H A Dbcache.h201 uint8_t last_gc; /* Most out of date gen in the btree */ member
626 * max(gen - last_gc) for all buckets. When it gets too big we have to
910 * the oldest gen of any pointer into that bucket in the btree (last_gc).
915 return b->gen - b->last_gc; in bucket_gc_gen()
H A Dextents.c199 "inconsistent btree pointer %s: bucket %zi pin %i prio %i gen %i last_gc %i mark %llu", in btree_ptr_bad_expensive()
201 g->prio, g->gen, g->last_gc, GC_MARK(g)); in btree_ptr_bad_expensive()
531 "inconsistent extent pointer %s:\nbucket %zu pin %i prio %i gen %i last_gc %i mark %llu", in bch_extent_bad_expensive()
533 g->prio, g->gen, g->last_gc, GC_MARK(g)); in bch_extent_bad_expensive()
H A Dbtree.c1244 if (gen_after(g->last_gc, PTR_GEN(k, i))) in __bch_btree_mark_key()
1245 g->last_gc = PTR_GEN(k, i); in __bch_btree_mark_key()
1743 b->last_gc = b->gen; in btree_gc_start()
H A Dsuper.c725 b->gen = b->last_gc = d->gen; in prio_read()
2040 * btree_gc_finish() will give spurious errors about last_gc > in run_cache_set()

Completed in 26 milliseconds