Home
last modified time | relevance | path

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

/illumos-gate/usr/src/uts/common/os/
H A Dflock.c3271 for (i = 0; i < pgraph.gcount; i++) { in flk_get_proc_vertex()
3283 for (i = 0; i < pgraph.gcount; i++) { in flk_get_proc_vertex()
3292 palloc = kmem_zalloc((pgraph.gcount + PROC_CHUNK) * in flk_get_proc_vertex()
3297 pgraph.gcount * sizeof (proc_vertex_t *)); in flk_get_proc_vertex()
3300 pgraph.gcount * sizeof (proc_vertex_t *)); in flk_get_proc_vertex()
3304 pv->index = lock->pvertex = pgraph.gcount; in flk_get_proc_vertex()
3305 pgraph.gcount += PROC_CHUNK; in flk_get_proc_vertex()
3346 for (i = 0; i < pgraph.gcount; i++) in flk_proc_graph_uncolor()
/illumos-gate/usr/src/uts/common/sys/
H A Dflock_impl.h470 int gcount; /* list size */ member
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dspa.c2320 uint_t i, gcount; in spa_try_repair() local
2330 &glist, &gcount) != 0) in spa_try_repair()
2333 vd = kmem_zalloc(gcount * sizeof (vdev_t *), KM_SLEEP); in spa_try_repair()
2337 for (i = 0; i < gcount; i++) { in spa_try_repair()
2358 for (extracted = 0, i = 0; i < gcount; i++) { in spa_try_repair()
2371 if (!attempt_reopen || gcount == extracted) { in spa_try_repair()
2372 for (i = 0; i < gcount; i++) in spa_try_repair()
2378 kmem_free(vd, gcount * sizeof (vdev_t *)); in spa_try_repair()