Home
last modified time | relevance | path

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

/titanic_44/usr/src/uts/common/os/
H A Dflock.c2966 for (i = 0; i < pgraph.gcount; i++) { in flk_get_proc_vertex()
2978 for (i = 0; i < pgraph.gcount; i++) { in flk_get_proc_vertex()
2987 palloc = kmem_zalloc((pgraph.gcount + PROC_CHUNK) * in flk_get_proc_vertex()
2992 pgraph.gcount * sizeof (proc_vertex_t *)); in flk_get_proc_vertex()
2995 pgraph.gcount * sizeof (proc_vertex_t *)); in flk_get_proc_vertex()
2999 pv->index = lock->pvertex = pgraph.gcount; in flk_get_proc_vertex()
3000 pgraph.gcount += PROC_CHUNK; in flk_get_proc_vertex()
3041 for (i = 0; i < pgraph.gcount; i++) in flk_proc_graph_uncolor()
/titanic_44/usr/src/uts/common/sys/
H A Dflock_impl.h469 int gcount; /* list size */ member
/titanic_44/usr/src/uts/common/fs/zfs/
H A Dspa.c2014 uint_t i, gcount; in spa_try_repair() local
2024 &glist, &gcount) != 0) in spa_try_repair()
2027 vd = kmem_zalloc(gcount * sizeof (vdev_t *), KM_SLEEP); in spa_try_repair()
2031 for (i = 0; i < gcount; i++) { in spa_try_repair()
2052 for (extracted = 0, i = 0; i < gcount; i++) { in spa_try_repair()
2065 if (!attempt_reopen || gcount == extracted) { in spa_try_repair()
2066 for (i = 0; i < gcount; i++) in spa_try_repair()
2072 kmem_free(vd, gcount * sizeof (vdev_t *)); in spa_try_repair()