Lines Matching defs:g_
139 uptr size() const { return g_.size(); }
146 g_.clear();
167 g_.removeEdgesTo(recycled_nodes_);
176 g_.clear();
192 g_.removeEdgesFrom(idx);
205 return g_.isReachable(cur_idx, dtls->getLocks(current_epoch_));
228 if (!g_.hasEdge(dtls->getLock(i), cur_idx))
245 uptr n_added_edges = g_.addEdges(dtls->getLocks(current_epoch_), cur_idx,
315 uptr res = g_.findShortestPath(idx, tmp_bv_, path, path_size);
348 return g_.hasEdge(nodeToIndex(l1), nodeToIndex(l2));
350 // idx1 and idx2 are raw indices to g_, not lock IDs.
352 return g_.hasEdge(idx1, idx2);
358 if (g_.hasEdge(from, to))
402 BVGraph<BV> g_;