Lines Matching full:info
1969 explicit VisitMarker(NodeInfo* info) : info_(info) {
1970 ASSERT(!info->visited);
1971 info->visited = true;
1985 if (body_can_be_zero_length_ || info()->visited) return;
1986 VisitMarker marker(info());
2533 // Update the counter-based backtracking info on the stack. This is an
3107 if (node->info()->visited) return;
3108 node->info()->visited = true;
3204 NodeInfo* info = that->info();
3205 printer.PrintBit("NI", info->follows_newline_interest);
3206 printer.PrintBit("WI", info->follows_word_interest);
3207 printer.PrintBit("SI", info->follows_start_interest);
3695 NodeInfo info;
4550 RegExpNode* RegExpNode::TryGetSibling(NodeInfo* info) {
4553 if (sibling->info()->Matches(info))
4560 RegExpNode* RegExpNode::EnsureSibling(NodeInfo* info, bool* cloned) {
4563 RegExpNode* result = TryGetSibling(info);
4566 NodeInfo* new_info = result->info();
4568 new_info->AddFromPreceding(info);
4576 static RegExpNode* PropagateToEndpoint(C* node, NodeInfo* info) {
4577 NodeInfo full_info(*node->info());
4578 full_info.AddFromPreceding(info);
4743 if (that->info()->been_analyzed || that->info()->being_analyzed)
4745 that->info()->being_analyzed = true;
4747 that->info()->being_analyzed = false;
4748 that->info()->been_analyzed = true;
4792 that->info()->AddFromFollowing(target->info());
4798 NodeInfo* info = that->info();
4805 info->AddFromFollowing(node->info());
4811 NodeInfo* info = that->info();
4817 info->AddFromFollowing(node->info());
4824 info->AddFromFollowing(that->loop_node()->info());
5196 NodeInfo info = *node->info();
