284 	uint32_t l_edge, m_edge, r_edge;  member
316 	if (v->l_edge != unused && v->m_edge != unused)  in remove_vertex()
318 	if (v->l_edge != unused && v->r_edge != unused)  in remove_vertex()
322 	if (v->l_edge == unused && v->m_edge == unused && v->r_edge == unused)  in remove_vertex()
325 	if (v->l_edge != unused) {  in remove_vertex()
326 		e = &state->edges[v->l_edge];  in remove_vertex()
348 		vl->l_edge = e->l_next;  in remove_vertex()
403 		v->l_edge = unused;  in build_graph()
411 		if (v->l_edge != unused)  in build_graph()
412 			state->edges[v->l_edge].l_prev = i;  in build_graph()
413 		e->l_next = v->l_edge;  in build_graph()
415 		v->l_edge = i;  in build_graph()