89 proc_graph_t	pgraph;  variable
2961 		pv = pgraph.proc[lock->pvertex];  in flk_get_proc_vertex()
2966 	for (i = 0; i < pgraph.gcount; i++) {  in flk_get_proc_vertex()
2967 		pv = pgraph.proc[i];  in flk_get_proc_vertex()
2977 	if (pgraph.free != 0) {  in flk_get_proc_vertex()
2978 		for (i = 0; i < pgraph.gcount; i++) {  in flk_get_proc_vertex()
2979 			if (pgraph.proc[i] == NULL) {  in flk_get_proc_vertex()
2980 				pgraph.proc[i] = pv;  in flk_get_proc_vertex()
2982 				pgraph.free--;  in flk_get_proc_vertex()
2987 	palloc = kmem_zalloc((pgraph.gcount + PROC_CHUNK) *  in flk_get_proc_vertex()
2990 	if (pgraph.proc) {  in flk_get_proc_vertex()
2991 		bcopy(pgraph.proc, palloc,  in flk_get_proc_vertex()
2992 		    pgraph.gcount * sizeof (proc_vertex_t *));  in flk_get_proc_vertex()
2994 		kmem_free(pgraph.proc,  in flk_get_proc_vertex()
2995 		    pgraph.gcount * sizeof (proc_vertex_t *));  in flk_get_proc_vertex()
2997 	pgraph.proc = palloc;  in flk_get_proc_vertex()
2998 	pgraph.free += (PROC_CHUNK - 1);  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()
3001 	pgraph.proc[pv->index] = pv;  in flk_get_proc_vertex()
3040 	if (pgraph.mark == UINT_MAX) {  in flk_proc_graph_uncolor()
3041 		for (i = 0; i < pgraph.gcount; i++)  in flk_proc_graph_uncolor()
3042 			if (pgraph.proc[i] != NULL) {  in flk_proc_graph_uncolor()
3043 				pgraph.proc[i]->atime = 0;  in flk_proc_graph_uncolor()
3044 				pgraph.proc[i]->dtime = 0;  in flk_proc_graph_uncolor()
3046 		pgraph.mark = 1;  in flk_proc_graph_uncolor()
3048 		pgraph.mark++;  in flk_proc_graph_uncolor()
3061 		pgraph.proc[proc->index] = NULL;  in flk_proc_release()
3062 		pgraph.free++;  in flk_proc_release()