Searched refs:visited_ (Results 1 – 5 of 5) sorted by relevance
74 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in re2::Backtracker85 visited_(NULL), in Backtracker()90 delete[] visited_; in ~Backtracker()124 delete[] visited_; in Search()126 visited_ = new uint32[nvisited_]; in Search()127 memset(visited_, 0, nvisited_*sizeof visited_[0]); in Search()155 if (visited_[n/32] & (1 << (n&31))) in Visit()157 visited_[n/32] |= 1 << (n&31); in Visit()
21 visited_(static_cast<int>(jsgraph->graph()->NodeCount()), zone) {} in EscapeAnalysisReducer()56 if (visited_.Contains(node->id())) return NoChange(); in ReduceLoad()57 visited_.Add(node->id()); in ReduceLoad()59 visited_.Add(node->id()); in ReduceLoad()75 if (visited_.Contains(node->id())) return NoChange(); in ReduceStore()76 visited_.Add(node->id()); in ReduceStore()91 if (visited_.Contains(node->id())) return NoChange(); in ReduceAllocate()92 visited_.Add(node->id()); in ReduceAllocate()170 if (visited_.Contains(node->id())) return NoChange(); in ReduceFrameStateUses()171 visited_.Add(node->id()); in ReduceFrameStateUses()
54 BitVector visited_; variable
318 void set_visited() { visited_ = true; } in set_visited()319 bool visited() const { return visited_; } in visited()330 bool visited_ = false; // Bookkeeping for the traversal. member in v8::internal::compiler::RepresentationSelector::NodeInfo
63 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in re2::BitState80 visited_(NULL), in BitState()88 delete[] visited_; in ~BitState()98 if (visited_[n/VisitedBits] & (1 << (n & (VisitedBits-1)))) in ShouldVisit()100 visited_[n/VisitedBits] |= 1 << (n & (VisitedBits-1)); in ShouldVisit()315 visited_ = new uint32[nvisited_]; in Search()316 memset(visited_, 0, nvisited_*sizeof visited_[0]); in Search()