Searched refs:loop_node (Results 1 - 4 of 4) sorted by relevance

/external/v8/src/compiler/
H A Dloop-peeling.cc172 Node* loop_node = loop_tree->GetLoopControl(loop); local
179 unmarked_exit = (node->InputAt(1) != loop_node);
183 unmarked_exit = (node->InputAt(1)->InputAt(1) != loop_node);
190 Node* loop_node = loop_tree->GetLoopControl(loop); local
195 loop_node->id(), node->id(), node->op()->mnemonic(), use->id(),
232 Node* loop_node = loop_tree->GetLoopControl(loop); local
234 int backedges = loop_node->InputCount() - 1;
239 for (int i = 1; i < loop_node->InputCount(); i++) {
240 inputs.push_back(peeling.map(loop_node->InputAt(i)));
269 new_entry = peeling.map(loop_node
[all...]
H A Dbytecode-graph-builder.cc2126 Node* loop_node = merge_environments_[current_loop]->GetControlDependency(); local
2129 environment()->PrepareForLoopExit(loop_node, loop_info.assignments());
/external/v8/src/regexp/
H A Djsregexp.cc6354 if (node != that->loop_node()) {
6362 EnsureAnalyzed(that->loop_node());
6364 info->AddFromFollowing(that->loop_node()->info());
6652 RegExpNode* loop_node = RegExpQuantifier::ToNode( local
6662 new (zone) RegExpCharacterClass('*'), false, loop_node)));
6665 node = loop_node;
H A Djsregexp.h1020 RegExpNode* loop_node() { return loop_node_; } function in class:v8::internal::LoopChoiceNode

Completed in 504 milliseconds