common/os/flock.c

1186 	lock_descriptor_t	*vertex;
1192 	 * if to vertex already has mark_color just return
1193 	 * don't add an edge as it is reachable from from vertex
1203 	 * set the from and to vertex
1210 	 * put in adjacency list of from vertex
1219 	 * put in in list of to vertex
1238 	while ((vertex = STACK_TOP(vertex_stack)) != NULL) {
1242 		for (ep = FIRST_ADJ(vertex);
1243 			ep != HEAD(vertex);
1486 	 * we remove the adjacent edges for all vertices' to this vertex
1638  * Cancelling a sleeping lock implies removing a vertex from the
1640  * of all vertices that have a path  to this vertex, w.r.t. all
1641  * vertices reachable from this vertex.
1651 	lock_descriptor_t *vertex, *lock;
1660 	 * count number of vertex pointers that has to be allocated
1666 	while ((vertex = STACK_TOP(vertex_stack)) != NULL) {
1668 		for (ep = FIRST_ADJ(vertex); ep != HEAD(vertex);
1679 	 * allocate memory for holding the vertex pointers
1823 		 * of from vertex. if no more adjacent edges
1824 		 * for this vertex wake this process.
1857  * The barriers has to be found (those vertex that originally had two paths
1860  * to a vertex in topology as well a path to it.
1868 	lock_descriptor_t *vertex, *lock;
1888 	while ((vertex = STACK_TOP(vertex_stack)) != NULL) {
1889 		if (vertex->l_state & RECOMPUTE_DONE) {
1893 		if (IS_BARRIER(vertex)) {
1895 			if (vertex->l_index) {
1896 				vertex->l_index--;
1899 				if (vertex->l_index == 0)  {
1905 					vertex->l_state &= ~BARRIER_LOCK;
1910 		vertex->l_state |= RECOMPUTE_DONE;
1912 		count = flk_color_reachables(vertex);
1917 			if (BLOCKS(lock, vertex)) {
1918 				(void) flk_add_edge(vertex, lock,
1929 				vertex->l_sedge == HEAD(vertex)) {
1932 			vertex->l_state &= ~RECOMPUTE_DONE;
1934 			if (vertex->l_sedge != HEAD(vertex) && barrier_found) {
1936 				flk_update_barriers(vertex);
1941 		ep = vertex->l_sedge;
1945 		vertex->l_sedge = NEXT_IN(ep);
1951  * Color all reachable vertices from vertex that belongs to topology (here
1960 flk_color_reachables(lock_descriptor_t *vertex)
1969 	STACK_PUSH(vertex_stack, vertex, l_stack1);
1997 	lock_descriptor_t *vertex, *lck;
2005 	while ((vertex = STACK_TOP(vertex_stack)) != NULL) {
2007 		for (ep = FIRST_IN(vertex); ep != HEAD(vertex);
2035  * to that vertex.
2041 	lock_descriptor_t *vertex, *lck;
2050 	while ((vertex = STACK_TOP(vertex_stack)) != NULL) {
2052 		for (ep = FIRST_IN(vertex); ep != HEAD(vertex);
2882  * Get a proc vertex. If lock's pvertex value gets a correct proc vertex
2989  * Release the proc vertex iff both there are no in edges and out edges
4131 	lock_descriptor_t	*vertex;
4147 	while ((vertex = STACK_TOP(vertex_stack)) != NULL) {
4149 		for (ep = FIRST_ADJ(vertex); ep != HEAD(vertex);