Lines Matching defs:g_
142 uptr size() const { return g_.size(); }
149 g_.clear();
171 g_.removeEdgesTo(recycled_nodes_);
180 g_.clear();
196 g_.removeEdgesFrom(idx);
209 return g_.isReachable(cur_idx, dtls->getLocks(current_epoch_));
232 if (!g_.hasEdge(dtls->getLock(i), cur_idx))
249 uptr n_added_edges = g_.addEdges(dtls->getLocks(current_epoch_), cur_idx,
321 uptr res = g_.findShortestPath(idx, tmp_bv_, path, path_size);
354 return g_.hasEdge(nodeToIndex(l1), nodeToIndex(l2));
356 // idx1 and idx2 are raw indices to g_, not lock IDs.
358 return g_.hasEdge(idx1, idx2);
364 if (g_.hasEdge(from, to))
408 BVGraph<BV> g_;