90 proc_graph_t	pgraph;  variable
3266 		pv = pgraph.proc[lock->pvertex];  in flk_get_proc_vertex()
3271 	for (i = 0; i < pgraph.gcount; i++) {  in flk_get_proc_vertex()
3272 		pv = pgraph.proc[i];  in flk_get_proc_vertex()
3282 	if (pgraph.free != 0) {  in flk_get_proc_vertex()
3283 		for (i = 0; i < pgraph.gcount; i++) {  in flk_get_proc_vertex()
3284 			if (pgraph.proc[i] == NULL) {  in flk_get_proc_vertex()
3285 				pgraph.proc[i] = pv;  in flk_get_proc_vertex()
3287 				pgraph.free--;  in flk_get_proc_vertex()
3292 	palloc = kmem_zalloc((pgraph.gcount + PROC_CHUNK) *  in flk_get_proc_vertex()
3295 	if (pgraph.proc) {  in flk_get_proc_vertex()
3296 		bcopy(pgraph.proc, palloc,  in flk_get_proc_vertex()
3297 		    pgraph.gcount * sizeof (proc_vertex_t *));  in flk_get_proc_vertex()
3299 		kmem_free(pgraph.proc,  in flk_get_proc_vertex()
3300 		    pgraph.gcount * sizeof (proc_vertex_t *));  in flk_get_proc_vertex()
3302 	pgraph.proc = palloc;  in flk_get_proc_vertex()
3303 	pgraph.free += (PROC_CHUNK - 1);  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()
3306 	pgraph.proc[pv->index] = pv;  in flk_get_proc_vertex()
3345 	if (pgraph.mark == UINT_MAX) {  in flk_proc_graph_uncolor()
3346 		for (i = 0; i < pgraph.gcount; i++)  in flk_proc_graph_uncolor()
3347 			if (pgraph.proc[i] != NULL) {  in flk_proc_graph_uncolor()
3348 				pgraph.proc[i]->atime = 0;  in flk_proc_graph_uncolor()
3349 				pgraph.proc[i]->dtime = 0;  in flk_proc_graph_uncolor()
3351 		pgraph.mark = 1;  in flk_proc_graph_uncolor()
3353 		pgraph.mark++;  in flk_proc_graph_uncolor()
3366 		pgraph.proc[proc->index] = NULL;  in flk_proc_release()
3367 		pgraph.free++;  in flk_proc_release()