Home
last modified time | relevance | path

Searched refs:gcount (Results 1 – 3 of 3) sorted by relevance

/titanic_50/usr/src/uts/common/os/
H A Dflock.c3269 for (i = 0; i < pgraph.gcount; i++) { in flk_get_proc_vertex()
3281 for (i = 0; i < pgraph.gcount; i++) { in flk_get_proc_vertex()
3290 palloc = kmem_zalloc((pgraph.gcount + PROC_CHUNK) * in flk_get_proc_vertex()
3295 pgraph.gcount * sizeof (proc_vertex_t *)); in flk_get_proc_vertex()
3298 pgraph.gcount * sizeof (proc_vertex_t *)); in flk_get_proc_vertex()
3302 pv->index = lock->pvertex = pgraph.gcount; in flk_get_proc_vertex()
3303 pgraph.gcount += PROC_CHUNK; in flk_get_proc_vertex()
3344 for (i = 0; i < pgraph.gcount; i++) in flk_proc_graph_uncolor()
/titanic_50/usr/src/uts/common/sys/
H A Dflock_impl.h470 int gcount; /* list size */ member
/titanic_50/usr/src/uts/common/fs/zfs/
H A Dspa.c2015 uint_t i, gcount; in spa_try_repair() local
2025 &glist, &gcount) != 0) in spa_try_repair()
2028 vd = kmem_zalloc(gcount * sizeof (vdev_t *), KM_SLEEP); in spa_try_repair()
2032 for (i = 0; i < gcount; i++) { in spa_try_repair()
2053 for (extracted = 0, i = 0; i < gcount; i++) { in spa_try_repair()
2066 if (!attempt_reopen || gcount == extracted) { in spa_try_repair()
2067 for (i = 0; i < gcount; i++) in spa_try_repair()
2073 kmem_free(vd, gcount * sizeof (vdev_t *)); in spa_try_repair()