Lines Matching defs:edge

922 	    sizeof (struct edge), 0, NULL, NULL, NULL, NULL, NULL, 0);
983  * Get a lock_descriptor structure with initialization of edge lists.
1070  * flk_add_edge() function adds an edge between l1 and l2 iff there
1205 	 * edge to this write lock we have paths to all locks in the
1471  * This routine adds an edge between from and to because from depends
1485 	edge_t	*edge;
1494 	 * don't add an edge as it is reachable from from vertex
1501 	edge = flk_get_edge();
1507 	edge->from_vertex = from_lock;
1508 	edge->to_vertex = to_lock;
1514 	from_lock->l_edge.edge_adj_next->edge_adj_prev = edge;
1515 	edge->edge_adj_next = from_lock->l_edge.edge_adj_next;
1516 	edge->edge_adj_prev = &from_lock->l_edge;
1517 	from_lock->l_edge.edge_adj_next = edge;
1523 	to_lock->l_edge.edge_in_next->edge_in_prev = edge;
1524 	edge->edge_in_next = to_lock->l_edge.edge_in_next;
1525 	to_lock->l_edge.edge_in_next = edge;
1526 	edge->edge_in_prev = &to_lock->l_edge;
1530 		flk_update_proc_graph(edge, 0);
1575  * Get an edge structure for representing the dependency between two locks.
1591  * Free the edge structure.
1772 	 * dependencies because no lock will add an edge to this.
2123 		 * delete the edge from the adjacency list
2148  * right i.e., topology[i] can have an edge to  topology[j], iff i<j)
2150  * on lock l2 in topology but does not have a path to it, we add an edge
2153  * We don't want to add an edge between l1 and l2 if there exists
2160  * to vertices in topology, and thus barrier vertices can have an edge
3108 		for (pep = start_vertex->edge; pep != NULL; pep = pep->next) {
3120 			pep->next = start_vertex->edge;
3121 			start_vertex->edge = pep;
3133 		for (pep = in_proc->edge; pep != NULL; pep = pep->next) {
3145 			pep->next = in_proc->edge;
3146 			in_proc->edge = pep;
3158 	start_vertex->p_sedge = start_vertex->edge;
3167 				dvertex->p_sedge = dvertex->edge;
3195 		ppep = start_vertex->edge;
3196 		for (pep = start_vertex->edge; pep != NULL; ppep = pep,
3202 						start_vertex->edge = pep->next;
3223 		ppep = in_proc->edge;
3224 		for (pep = in_proc->edge; pep != NULL; ppep = pep,
3230 						in_proc->edge = pep->next;
3309  * Allocate a proc edge.
3323  * Free the proc edge. Called whenever its reference count goes to zero.
3363 	if (proc->edge == NULL && proc->incount == 0) {
3402 	pep = prevpep = fromproc->edge;
3411 					fromproc->edge = pep->next;
3429 	pep = fromproc->edge;
3444 		pep->next = fromproc->edge;
3445 		fromproc->edge = pep;
4596 			    "one edge one path from lock1 %p lock2 %p",