Searched refs:vu_edges (Results 1 – 2 of 2) sorted by relevance
247 static __thread int vu_edges[3*LARGEST_MATCHING]; variable322 { if ((j = u_edge1[i]) >= 0) vu_edges[v_edgemap[j]++] = i; in find_any_assignment()323 if ((j = u_edge2[i]) >= 0) vu_edges[v_edgemap[j]++] = i; in find_any_assignment()324 if ((j = u_edge3[i]) >= 0) vu_edges[v_edgemap[j]++] = i; in find_any_assignment()332 k++) printlog(" %d", vu_edges[j+k]); in find_any_assignment()370 { int m = vu_edges[v_edgemap[k] + l]; in find_any_assignment()380 { int m = vu_edges[v_edgemap[k] + l]; in find_any_assignment()390 { int m = vu_edges[v_edgemap[k] + l]; in find_any_assignment()
262 static __thread int vu_edges[3*LARGEST_MATCHING]; variable399 { if ((j = u_edge1[i]) >= 0) vu_edges[v_edgemap[j]++] = i; in find_any_assignment()400 if ((j = u_edge2[i]) >= 0) vu_edges[v_edgemap[j]++] = i; in find_any_assignment()401 if ((j = u_edge3[i]) >= 0) vu_edges[v_edgemap[j]++] = i; in find_any_assignment()409 k++) printlog(" %d", vu_edges[j+k]); in find_any_assignment()447 { int m = vu_edges[v_edgemap[k] + l]; in find_any_assignment()457 { int m = vu_edges[v_edgemap[k] + l]; in find_any_assignment()467 { int m = vu_edges[v_edgemap[k] + l]; in find_any_assignment()