| /external/chromium_org/v8/src/ |
| hydrogen-minus-zero.h | 41 visited_(graph->GetMaximumValueID(), zone()) { }
48 BitVector visited_; member in class:v8::internal::HComputeMinusZeroChecksPhase
|
| hydrogen-minus-zero.cc | 48 ASSERT(visited_.IsEmpty());
50 visited_.Clear();
56 ASSERT(visited_.IsEmpty());
58 visited_.Clear();
68 current != NULL && !visited_.Contains(current->id());
69 current = current->EnsureAndPropagateNotMinusZero(&visited_)) {
72 visited_.Add(current->id());
84 operation->EnsureAndPropagateNotMinusZero(&visited_);
|
| /external/chromium_org/third_party/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/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/chromium_org/third_party/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,
|
| /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,
|
| /external/openfst/src/include/fst/ |
| rmepsilon.h | 144 vector<bool> visited_; // '[i] = true' if state 'i' has been visited member in class:fst::RmEpsilonState
172 while (visited_.size() <= state) visited_.push_back(false);
173 if (visited_[state]) continue;
174 visited_[state] = true;
184 while (visited_.size() <= arc.nextstate)
185 visited_.push_back(false);
186 if (!visited_[arc.nextstate])
212 visited_[visited_states_.front()] = false;
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| rmepsilon.h | 127 vector<bool> visited_; // '[i] = true' if state 'i' has been visited member in class:fst::RmEpsilonState
147 while ((StateId)visited_.size() <= state) visited_.push_back(false);
148 visited_[state] = true;
158 while ((StateId)visited_.size() <= arc.nextstate)
159 visited_.push_back(false);
160 if (!visited_[arc.nextstate])
186 visited_[visited_states_.front()] = false;
|
