Searched refs:l_edge (Results 1 – 5 of 5) sorted by relevance
89 j = v->l_edge; in graph2_check_duplicates()125 graph->verts[i].l_edge = unused; in graph2_hash()131 if (v->l_edge != unused) in graph2_hash()132 graph->edges[v->l_edge].l_prev = i; in graph2_hash()133 graph->edges[i].l_next = v->l_edge; in graph2_hash()135 v->l_edge = i; in graph2_hash()160 if (v->l_edge != unused && v->r_edge != unused) in graph2_remove_vertex()162 if (v->l_edge == unused && v->r_edge == unused) in graph2_remove_vertex()165 if (v->l_edge != unused) { in graph2_remove_vertex()166 e = &graph->edges[v->l_edge]; in graph2_remove_vertex()[all …]
89 j = v->l_edge; in graph3_check_duplicates()131 graph->verts[i].l_edge = unused; in graph3_hash()138 if (v->l_edge != unused) in graph3_hash()139 graph->edges[v->l_edge].l_prev = i; in graph3_hash()140 graph->edges[i].l_next = v->l_edge; in graph3_hash()142 v->l_edge = i; in graph3_hash()173 if (v->l_edge != unused && v->m_edge != unused) in graph3_remove_vertex()175 if (v->l_edge != unused && v->r_edge != unused) in graph3_remove_vertex()179 if (v->l_edge == unused && v->m_edge == unused && v->r_edge == unused) in graph3_remove_vertex()182 if (v->l_edge != unused) { in graph3_remove_vertex()[all …]
41 uint32_t l_edge, m_edge, r_edge; member
41 uint32_t l_edge, r_edge; member
284 uint32_t l_edge, m_edge, r_edge; member316 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()[all …]