| /external/v8/src/compiler/ |
| escape-analysis-reducer.h | 54 BitVector visited_; member in class:v8::internal::compiler::final
|
| simplified-lowering.cc | 318 void set_visited() { visited_ = true; }
319 bool visited() const { return visited_; }
330 bool visited_ = false; // Bookkeeping for the traversal. member in class:v8::internal::compiler::RepresentationSelector::NodeInfo
[all...] |
| /external/regex-re2/re2/testing/ |
| backtrack.cc | 41 // like (a*)*, the visited_[] bitmap marks the (state, string-position)
45 // such infinite loops possible to avoid without keeping a giant visited_
46 // bitmap, but visited_ works fine for a reference implementation
74 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in class:re2::Backtracker
85 visited_(NULL),
90 delete[] visited_;
122 // Allocate new visited_ bitmap -- size is proportional
124 delete[] visited_;
126 visited_ = new uint32[nvisited_];
127 memset(visited_, 0, nvisited_*sizeof visited_[0])
[all...] |
| /external/regex-re2/re2/ |
| bitstate.cc | 63 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in class:re2::BitState
80 visited_(NULL),
88 delete[] visited_;
98 if (visited_[n/VisitedBits] & (1 << (n & (VisitedBits-1))))
100 visited_[n/VisitedBits] |= 1 << (n & (VisitedBits-1));
315 visited_ = new uint32[nvisited_];
316 memset(visited_, 0, nvisited_*sizeof visited_[0]);
338 // but we are not clearing visited_ between calls to TrySearch,
|
| /art/runtime/gc/space/ |
| image_space.cc | 749 visited_(visited) {}
788 if (!visited_->Test(contents_bit)) {
790 visited_->Set(contents_bit);
804 if (visited_->Test(obj)) {
808 visited_->Set(obj);
866 gc::accounting::ContinuousSpaceBitmap* const visited_; member in class:art::gc::space::FixupObjectVisitor::gc::accounting
[all...] |
