node 5816 src/api.cc const i::ProfileNode* node = reinterpret_cast<const i::ProfileNode*>(this);
node 5817 src/api.cc const i::CodeEntry* entry = node->entry();
node 5832 src/api.cc const i::ProfileNode* node = reinterpret_cast<const i::ProfileNode*>(this);
node 5834 src/api.cc node->entry()->resource_name())));
node 94 src/arm/deoptimizer-arm.cc DeoptimizingCodeListNode* node = new DeoptimizingCodeListNode(code);
node 96 src/arm/deoptimizer-arm.cc node->set_next(data->deoptimizing_code_list_);
node 97 src/arm/deoptimizer-arm.cc data->deoptimizing_code_list_ = node;
node 2258 src/arm/lithium-arm.h #define DECLARE_DO(type) LInstruction* Do##type(H##type* node);
node 139 src/arm/lithium-codegen-arm.h #define DECLARE_DO(type) void Do##type(L##type* node);
node 737 src/ast.cc RegExpTree* node = nodes->at(i);
node 738 src/ast.cc if (node->IsAnchoredAtStart()) { return true; }
node 739 src/ast.cc if (node->max_match() > 0) { return false; }
node 748 src/ast.cc RegExpTree* node = nodes->at(i);
node 749 src/ast.cc if (node->IsAnchoredAtEnd()) { return true; }
node 750 src/ast.cc if (node->max_match() > 0) { return false; }
node 991 src/ast.cc RegExpTree* node = nodes->at(i);
node 992 src/ast.cc int node_min_match = node->min_match();
node 994 src/ast.cc int node_max_match = node->max_match();
node 1014 src/ast.cc void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
node 1018 src/ast.cc void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
node 1025 src/ast.cc void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
node 1030 src/ast.cc void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
node 1035 src/ast.cc void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
node 1101 src/ast.cc if (node->is_jsruntime()) {
node 1105 src/ast.cc } else if (node->function()->intrinsic_type == Runtime::INLINE &&
node 1106 src/ast.cc (node->name()->IsEqualTo(CStrVector("_ArgumentsLength")) ||
node 1107 src/ast.cc node->name()->IsEqualTo(CStrVector("_Arguments")))) {
node 2568 src/ast.h void Visit(AstNode* node) { if (!CheckStackOverflow()) node->Accept(this); }
node 2587 src/ast.h virtual void Visit##type(type* node) = 0;
node 2614 src/ast.h void Visit##type(type* node);
node 2629 src/ast.h void Visit##type(type* node) {}
node 2649 src/ast.h visitor_.Visit##NodeType((node)); \
node 2650 src/ast.h return node;
node 2886 src/ast.h UnaryOperation* node =
node 2888 src/ast.h VISIT_AND_RETURN(UnaryOperation, node)
node 2895 src/ast.h BinaryOperation* node =
node 2897 src/ast.h VISIT_AND_RETURN(BinaryOperation, node)
node 2904 src/ast.h CountOperation* node =
node 2906 src/ast.h VISIT_AND_RETURN(CountOperation, node)
node 2913 src/ast.h CompareOperation* node =
node 2915 src/ast.h VISIT_AND_RETURN(CompareOperation, node)
node 437 src/compiler.h static Handle<SharedFunctionInfo> BuildFunctionInfo(FunctionLiteral* node,
node 697 src/debug.cc DebugInfoListNode* node = reinterpret_cast<DebugInfoListNode*>(data);
node 702 src/debug.cc BreakLocationIterator it(node->debug_info(), ALL_BREAK_LOCATIONS);
node 704 src/debug.cc debug->RemoveDebugInfo(node->debug_info());
node 706 src/debug.cc node = debug->debug_info_list_;
node 707 src/debug.cc while (node != NULL) {
node 708 src/debug.cc ASSERT(node != reinterpret_cast<DebugInfoListNode*>(data));
node 709 src/debug.cc node = node->next();
node 1216 src/debug.cc DebugInfoListNode* node = debug_info_list_;
node 1217 src/debug.cc while (node != NULL) {
node 1218 src/debug.cc Object* result = DebugInfo::FindBreakPointInfo(node->debug_info(),
node 1223 src/debug.cc Handle<DebugInfo> debug_info = node->debug_info();
node 1243 src/debug.cc node = node->next();
node 1249 src/debug.cc DebugInfoListNode* node = debug_info_list_;
node 1250 src/debug.cc while (node != NULL) {
node 1252 src/debug.cc BreakLocationIterator it(node->debug_info(), ALL_BREAK_LOCATIONS);
node 1254 src/debug.cc node = node->next();
node 1754 src/debug.cc DebugInfoListNode* node = debug_info_list_;
node 1755 src/debug.cc while (node != NULL) {
node 1756 src/debug.cc BreakLocationIterator it(node->debug_info(), ALL_BREAK_LOCATIONS);
node 1761 src/debug.cc node = node->next();
node 2115 src/debug.cc DebugInfoListNode* node = new DebugInfoListNode(*debug_info);
node 2116 src/debug.cc node->set_next(debug_info_list_);
node 2117 src/debug.cc debug_info_list_ = node;
node 335 src/deoptimizer.cc DeoptimizingCodeListNode* node =
node 337 src/deoptimizer.cc RemoveDeoptimizingCode(*node->code());
node 339 src/deoptimizer.cc node = Isolate::Current()->deoptimizer_data()->deoptimizing_code_list_;
node 340 src/deoptimizer.cc while (node != NULL) {
node 341 src/deoptimizer.cc ASSERT(node != reinterpret_cast<DeoptimizingCodeListNode*>(data));
node 342 src/deoptimizer.cc node = node->next();
node 523 src/deoptimizer.cc DeoptimizingCodeListNode* node =
node 525 src/deoptimizer.cc while (node != NULL) {
node 527 src/deoptimizer.cc node = node->next();
node 1189 src/deoptimizer.cc DeoptimizingCodeListNode* node =
node 1191 src/deoptimizer.cc while (node != NULL) {
node 1192 src/deoptimizer.cc if (node->code()->contains(addr)) return *node->code();
node 1193 src/deoptimizer.cc node = node->next();
node 402 src/full-codegen.cc PrepareForBailoutForId(node->id(), state);
node 60 src/full-codegen.h #define DECLARE_VISIT(type) virtual void Visit##type(type* node);
node 400 src/full-codegen.h void PrepareForBailout(Expression* node, State state);
node 574 src/full-codegen.h #define DECLARE_VISIT(type) virtual void Visit##type(type* node);
node 468 src/global-handles.cc if (it.node()->IsWeakRetainer()) v->VisitPointer(it.node()->location());
node 476 src/global-handles.cc if (it.node()->IsWeak() && it.node()->callback() == callback) {
node 477 src/global-handles.cc f(it.node()->object(), it.node()->parameter());
node 485 src/global-handles.cc if (it.node()->IsWeak() && f(it.node()->location())) {
node 486 src/global-handles.cc it.node()->MarkPending();
node 494 src/global-handles.cc Node* node = new_space_nodes_[i];
node 495 src/global-handles.cc if (node->IsStrongRetainer() ||
node 496 src/global-handles.cc (node->IsWeakRetainer() && !node->is_independent())) {
node 497 src/global-handles.cc v->VisitPointer(node->location());
node 506 src/global-handles.cc Node* node = new_space_nodes_[i];
node 507 src/global-handles.cc ASSERT(node->is_in_new_space_list());
node 508 src/global-handles.cc if (node->is_independent() && node->IsWeak() &&
node 509 src/global-handles.cc f(isolate_->heap(), node->location())) {
node 510 src/global-handles.cc node->MarkPending();
node 518 src/global-handles.cc Node* node = new_space_nodes_[i];
node 519 src/global-handles.cc ASSERT(node->is_in_new_space_list());
node 520 src/global-handles.cc if (node->is_independent() && node->IsWeakRetainer()) {
node 521 src/global-handles.cc v->VisitPointer(node->location());
node 537 src/global-handles.cc Node* node = new_space_nodes_[i];
node 538 src/global-handles.cc ASSERT(node->is_in_new_space_list());
node 542 src/global-handles.cc if (!node->is_independent()) continue;
node 543 src/global-handles.cc if (node->PostGarbageCollectionProcessing(isolate_, this)) {
node 552 src/global-handles.cc if (!node->IsRetainer()) {
node 558 src/global-handles.cc if (it.node()->PostGarbageCollectionProcessing(isolate_, this)) {
node 564 src/global-handles.cc if (!it.node()->IsRetainer()) {
node 572 src/global-handles.cc Node* node = new_space_nodes_[i];
node 573 src/global-handles.cc ASSERT(node->is_in_new_space_list());
node 574 src/global-handles.cc if (node->IsRetainer() && isolate_->heap()->InNewSpace(node->object())) {
node 575 src/global-handles.cc new_space_nodes_[last++] = node;
node 577 src/global-handles.cc node->set_in_new_space_list(false);
node 587 src/global-handles.cc if (it.node()->IsStrongRetainer()) {
node 588 src/global-handles.cc v->VisitPointer(it.node()->location());
node 596 src/global-handles.cc if (it.node()->IsRetainer()) {
node 597 src/global-handles.cc v->VisitPointer(it.node()->location());
node 605 src/global-handles.cc if (it.node()->has_wrapper_class_id() && it.node()->IsRetainer()) {
node 606 src/global-handles.cc v->VisitEmbedderReference(it.node()->location(),
node 607 src/global-handles.cc it.node()->wrapper_class_id());
node 621 src/global-handles.cc if (it.node()->state() == Node::WEAK) {
node 623 src/global-handles.cc } else if (it.node()->state() == Node::PENDING) {
node 625 src/global-handles.cc } else if (it.node()->state() == Node::NEAR_DEATH) {
node 627 src/global-handles.cc } else if (it.node()->state() == Node::FREE) {
node 644 src/global-handles.cc if (it.node()->state() == Node::WEAK) weak++;
node 645 src/global-handles.cc if (it.node()->state() == Node::PENDING) pending++;
node 646 src/global-handles.cc if (it.node()->state() == Node::NEAR_DEATH) near_death++;
node 647 src/global-handles.cc if (it.node()->state() == Node::FREE) destroyed++;
node 663 src/global-handles.cc reinterpret_cast<void*>(it.node()->location()),
node 664 src/global-handles.cc reinterpret_cast<void*>(it.node()->object()),
node 665 src/global-handles.cc it.node()->IsWeak() ? " (weak)" : "");
node 1009 src/hydrogen.h #define DECLARE_VISIT(type) virtual void Visit##type(type* node);
node 191 src/ia32/deoptimizer-ia32.cc DeoptimizingCodeListNode* node = new DeoptimizingCodeListNode(code);
node 193 src/ia32/deoptimizer-ia32.cc node->set_next(data->deoptimizing_code_list_);
node 194 src/ia32/deoptimizer-ia32.cc data->deoptimizing_code_list_ = node;
node 132 src/ia32/lithium-codegen-ia32.h #define DECLARE_DO(type) void Do##type(L##type* node);
node 2359 src/ia32/lithium-ia32.h #define DECLARE_DO(type) LInstruction* Do##type(H##type* node);
node 940 src/jsregexp.cc inline void AddWork(RegExpNode* node) { work_list_->Add(node); }
node 2289 src/jsregexp.cc RegExpNode* node = alternatives_->at(1).node();
node 2290 src/jsregexp.cc return node->EatsAtLeast(still_to_find, recursion_depth + 1, not_at_start);
node 2301 src/jsregexp.cc RegExpNode* node = alternatives_->at(1).node();
node 2302 src/jsregexp.cc return node->GetQuickCheckDetails(details, compiler, filled_in, not_at_start);
node 2314 src/jsregexp.cc RegExpNode* node = alternatives_->at(i).node();
node 2315 src/jsregexp.cc if (node == ignore_this_node) continue;
node 2316 src/jsregexp.cc int node_eats_at_least = node->EatsAtLeast(still_to_find,
node 2779 src/jsregexp.cc RegExpNode* replacement = alternative.node()->FilterASCII(depth - 1);
node 2799 src/jsregexp.cc alternatives_->at(i).node()->FilterASCII(depth - 1);
node 2817 src/jsregexp.cc RegExpNode* node = alternatives_->at(1).node();
node 2818 src/jsregexp.cc RegExpNode* replacement = node->FilterASCII(depth - 1);
node 2822 src/jsregexp.cc RegExpNode* neg_node = alternatives_->at(0).node();
node 2870 src/jsregexp.cc alternatives_->at(0).node()->GetQuickCheckDetails(details,
node 2876 src/jsregexp.cc RegExpNode* node = alternatives_->at(i).node();
node 2877 src/jsregexp.cc node->GetQuickCheckDetails(&new_details, compiler,
node 3334 src/jsregexp.cc RegExpCharacterClass* node = elm.data.u_char_class;
node 3335 src/jsregexp.cc ZoneList<CharacterRange>* ranges = node->ranges(zone());
node 3339 src/jsregexp.cc if (node->is_negated()) {
node 3360 src/jsregexp.cc RegExpNode* node = alternative->node();
node 3364 src/jsregexp.cc while (node != this) {
node 3368 src/jsregexp.cc int node_length = node->GreedyLoopTextLength();
node 3373 src/jsregexp.cc SeqRegExpNode* seq_node = static_cast<SeqRegExpNode*>(node);
node 3374 src/jsregexp.cc node = seq_node->on_success();
node 3383 src/jsregexp.cc loop_node_ = alt.node();
node 3390 src/jsregexp.cc continue_node_ = alt.node();
node 3861 src/jsregexp.cc alternatives_->at(0).node()->Emit(compiler, &greedy_match_trace);
node 3879 src/jsregexp.cc RegExpNode* eats_anything_node = alt1.node();
node 3901 src/jsregexp.cc alt0.node()->FillInBMInfo(0, 0, kFillInBMBudget, bm, not_at_start);
node 3944 src/jsregexp.cc alternative.node()->EmitQuickCheck(compiler,
node 3990 src/jsregexp.cc alternative.node()->Emit(compiler, &new_trace);
node 4048 src/jsregexp.cc alternative.node()->Emit(compiler, &out_of_line_trace);
node 4063 src/jsregexp.cc alternative.node()->Emit(compiler, &out_of_line_trace);
node 4258 src/jsregexp.cc Visit(node);
node 4265 src/jsregexp.cc if (node->info()->visited) return;
node 4266 src/jsregexp.cc node->info()->visited = true;
node 4267 src/jsregexp.cc node->Accept(this);
node 4289 src/jsregexp.cc choice()->alternatives()->at(i).node());
node 4390 src/jsregexp.cc stream()->Add(" n%p -> n%p;\n", that, alt.node());
node 4395 src/jsregexp.cc alt.node()->Accept(this);
node 4412 src/jsregexp.cc RegExpCharacterClass* node = elm.data.u_char_class;
node 4414 src/jsregexp.cc if (node->is_negated())
node 4416 src/jsregexp.cc for (int j = 0; j < node->ranges(zone)->length(); j++) {
node 4417 src/jsregexp.cc CharacterRange range = node->ranges(zone)->at(j);
node 4563 src/jsregexp.cc printer.PrintNode(label, node);
node 4971 src/jsregexp.cc RegExpNode* node = ActionNode::BeginSubmatch(
node 4981 src/jsregexp.cc return node;
node 5629 src/jsregexp.cc RegExpNode* node = that->alternatives()->at(i).node();
node 5630 src/jsregexp.cc EnsureAnalyzed(node);
node 5634 src/jsregexp.cc info->AddFromFollowing(node->info());
node 5642 src/jsregexp.cc RegExpNode* node = that->alternatives()->at(i).node();
node 5643 src/jsregexp.cc if (node != that->loop_node()) {
node 5644 src/jsregexp.cc EnsureAnalyzed(node);
node 5646 src/jsregexp.cc info->AddFromFollowing(node->info());
node 5698 src/jsregexp.cc alt.node()->FillInBMInfo(
node 5781 src/jsregexp.cc node->set_being_calculated(true);
node 5782 src/jsregexp.cc ZoneList<GuardedAlternative>* alternatives = node->alternatives();
node 5785 src/jsregexp.cc alternatives->at(i).node()->Accept(this);
node 5787 src/jsregexp.cc node->set_being_calculated(false);
node 5808 src/jsregexp.cc if (node->being_calculated())
node 5810 src/jsregexp.cc DispatchTable* table = node->GetTable(ignore_case_);
node 5917 src/jsregexp.cc RegExpNode* node = captured_body;
node 5940 src/jsregexp.cc node = first_step_node;
node 5942 src/jsregexp.cc node = loop_node;
node 5946 src/jsregexp.cc node = node->FilterASCII(RegExpCompiler::kMaxRecursion);
node 5949 src/jsregexp.cc if (node != NULL) node = node->FilterASCII(RegExpCompiler::kMaxRecursion);
node 5952 src/jsregexp.cc if (node == NULL) node = new(zone) EndNode(EndNode::BACKTRACK, zone);
node 5953 src/jsregexp.cc data->node = node;
node 5955 src/jsregexp.cc analysis.EnsureAnalyzed(node);
node 6006 src/jsregexp.cc node,
node 703 src/jsregexp.h void set_on_success(RegExpNode* node) { on_success_ = node; }
node 1025 src/jsregexp.h explicit GuardedAlternative(RegExpNode* node) : node_(node), guards_(NULL) { }
node 1027 src/jsregexp.h RegExpNode* node() { return node_; }
node 1028 src/jsregexp.h void set_node(RegExpNode* node) { node_ = node; }
node 1050 src/jsregexp.h void AddAlternative(GuardedAlternative node) {
node 1051 src/jsregexp.h alternatives()->Add(node, zone());
node 1126 src/jsregexp.h alternatives_->at(1).node()->FillInBMInfo(
node 1172 src/jsregexp.h void AddAlternative(GuardedAlternative node) {
node 1173 src/jsregexp.h ChoiceNode::AddAlternative(node);
node 1455 src/jsregexp.h void set_stop_node(RegExpNode* node) { stop_node_ = node; }
node 1513 src/jsregexp.h void BuildTable(ChoiceNode* node);
node 1555 src/jsregexp.h void EnsureAnalyzed(RegExpNode* node);
node 1584 src/jsregexp.h node(NULL),
node 1589 src/jsregexp.h RegExpNode* node;
node 1621 src/jsregexp.h static void DotPrint(const char* label, RegExpNode* node, bool ignore_case);
node 93 src/mips/deoptimizer-mips.cc DeoptimizingCodeListNode* node = new DeoptimizingCodeListNode(code);
node 95 src/mips/deoptimizer-mips.cc node->set_next(data->deoptimizing_code_list_);
node 96 src/mips/deoptimizer-mips.cc data->deoptimizing_code_list_ = node;
node 135 src/mips/lithium-codegen-mips.h #define DECLARE_DO(type) void Do##type(L##type* node);
node 2224 src/mips/lithium-mips.h #define DECLARE_DO(type) LInstruction* Do##type(H##type* node);
node 867 src/parser.cc if (target->node()->AsIterationStatement() != NULL) return true;
node 4978 src/parser.cc BreakableStatement* stat = t->node()->AsBreakableStatement();
node 4989 src/parser.cc BreakableStatement* stat = t->node()->AsBreakableStatement();
node 5005 src/parser.cc IterationStatement* stat = t->node()->AsIterationStatement();
node 5023 src/parser.cc TargetCollector* collector = t->node()->AsTargetCollector();
node 54 src/prettyprinter.cc if (!node->is_initializer_block()) Print("{ ");
node 55 src/prettyprinter.cc PrintStatements(node->statements());
node 56 src/prettyprinter.cc if (node->statements()->length() > 0) Print(" ");
node 57 src/prettyprinter.cc if (!node->is_initializer_block()) Print("}");
node 63 src/prettyprinter.cc PrintLiteral(node->proxy()->name(), false);
node 70 src/prettyprinter.cc PrintLiteral(node->proxy()->name(), false);
node 72 src/prettyprinter.cc PrintFunctionLiteral(node->fun());
node 79 src/prettyprinter.cc PrintLiteral(node->proxy()->name(), false);
node 81 src/prettyprinter.cc Visit(node->module());
node 88 src/prettyprinter.cc PrintLiteral(node->proxy()->name(), false);
node 90 src/prettyprinter.cc Visit(node->module());
node 97 src/prettyprinter.cc PrintLiteral(node->proxy()->name(), false);
node 103 src/prettyprinter.cc VisitBlock(node->body());
node 108 src/prettyprinter.cc Visit(node->proxy());
node 113 src/prettyprinter.cc Visit(node->module());
node 115 src/prettyprinter.cc PrintLiteral(node->name(), false);
node 121 src/prettyprinter.cc PrintLiteral(node->url(), true);
node 126 src/prettyprinter.cc Visit(node->expression());
node 138 src/prettyprinter.cc Visit(node->condition());
node 140 src/prettyprinter.cc Visit(node->then_statement());
node 141 src/prettyprinter.cc if (node->HasElseStatement()) {
node 143 src/prettyprinter.cc Visit(node->else_statement());
node 150 src/prettyprinter.cc ZoneStringList* labels = node->target()->labels();
node 162 src/prettyprinter.cc ZoneStringList* labels = node->target()->labels();
node 174 src/prettyprinter.cc Visit(node->expression());
node 181 src/prettyprinter.cc Visit(node->expression());
node 183 src/prettyprinter.cc Visit(node->statement());
node 188 src/prettyprinter.cc PrintLabels(node->labels());
node 190 src/prettyprinter.cc Visit(node->tag());
node 192 src/prettyprinter.cc ZoneList<CaseClause*>* cases = node->cases();
node 200 src/prettyprinter.cc PrintLabels(node->labels());
node 202 src/prettyprinter.cc Visit(node->body());
node 204 src/prettyprinter.cc Visit(node->cond());
node 210 src/prettyprinter.cc PrintLabels(node->labels());
node 212 src/prettyprinter.cc Visit(node->cond());
node 214 src/prettyprinter.cc Visit(node->body());
node 219 src/prettyprinter.cc PrintLabels(node->labels());
node 221 src/prettyprinter.cc if (node->init() != NULL) {
node 222 src/prettyprinter.cc Visit(node->init());
node 227 src/prettyprinter.cc if (node->cond() != NULL) Visit(node->cond());
node 229 src/prettyprinter.cc if (node->next() != NULL) {
node 230 src/prettyprinter.cc Visit(node->next()); // prints extra ';', unfortunately
node 234 src/prettyprinter.cc Visit(node->body());
node 239 src/prettyprinter.cc PrintLabels(node->labels());
node 241 src/prettyprinter.cc Visit(node->each());
node 243 src/prettyprinter.cc Visit(node->enumerable());
node 245 src/prettyprinter.cc Visit(node->body());
node 251 src/prettyprinter.cc Visit(node->try_block());
node 254 src/prettyprinter.cc PrintLiteral(node->variable()->name(), quote);
node 256 src/prettyprinter.cc Visit(node->catch_block());
node 262 src/prettyprinter.cc Visit(node->try_block());
node 264 src/prettyprinter.cc Visit(node->finally_block());
node 275 src/prettyprinter.cc PrintFunctionLiteral(node);
node 283 src/prettyprinter.cc PrintLiteral(node->shared_function_info(), true);
node 289 src/prettyprinter.cc Visit(node->condition());
node 291 src/prettyprinter.cc Visit(node->then_expression());
node 293 src/prettyprinter.cc Visit(node->else_expression());
node 298 src/prettyprinter.cc PrintLiteral(node->handle(), true);
node 304 src/prettyprinter.cc PrintLiteral(node->pattern(), false);
node 306 src/prettyprinter.cc PrintLiteral(node->flags(), false);
node 313 src/prettyprinter.cc for (int i = 0; i < node->properties()->length(); i++) {
node 315 src/prettyprinter.cc ObjectLiteral::Property* property = node->properties()->at(i);
node 327 src/prettyprinter.cc for (int i = 0; i < node->values()->length(); i++) {
node 329 src/prettyprinter.cc Visit(node->values()->at(i));
node 336 src/prettyprinter.cc PrintLiteral(node->name(), false);
node 341 src/prettyprinter.cc Visit(node->target());
node 342 src/prettyprinter.cc Print(" %s ", Token::String(node->op()));
node 343 src/prettyprinter.cc Visit(node->value());
node 349 src/prettyprinter.cc Visit(node->exception());
node 354 src/prettyprinter.cc Expression* key = node->key();
node 358 src/prettyprinter.cc Visit(node->obj());
node 362 src/prettyprinter.cc Visit(node->obj());
node 371 src/prettyprinter.cc Visit(node->expression());
node 372 src/prettyprinter.cc PrintArguments(node->arguments());
node 378 src/prettyprinter.cc Visit(node->expression());
node 380 src/prettyprinter.cc PrintArguments(node->arguments());
node 386 src/prettyprinter.cc PrintLiteral(node->name(), false);
node 387 src/prettyprinter.cc PrintArguments(node->arguments());
node 392 src/prettyprinter.cc Token::Value op = node->op();
node 396 src/prettyprinter.cc Visit(node->expression());
node 403 src/prettyprinter.cc if (node->is_prefix()) Print("%s", Token::String(node->op()));
node 404 src/prettyprinter.cc Visit(node->expression());
node 405 src/prettyprinter.cc if (node->is_postfix()) Print("%s", Token::String(node->op()));
node 412 src/prettyprinter.cc Visit(node->left());
node 413 src/prettyprinter.cc Print(" %s ", Token::String(node->op()));
node 414 src/prettyprinter.cc Visit(node->right());
node 421 src/prettyprinter.cc Visit(node->left());
node 422 src/prettyprinter.cc Print(" %s ", Token::String(node->op()));
node 423 src/prettyprinter.cc Visit(node->right());
node 435 src/prettyprinter.cc Visit(node);
node 459 src/prettyprinter.cc PrintF("%s", printer.Print(node));
node 695 src/prettyprinter.cc IndentedScope indent(this, s, node);
node 696 src/prettyprinter.cc Visit(node);
node 761 src/prettyprinter.cc const char* block_txt = node->is_initializer_block() ? "BLOCK INIT" : "BLOCK";
node 763 src/prettyprinter.cc PrintStatements(node->statements());
node 768 src/prettyprinter.cc PrintLiteralWithModeIndented(Variable::Mode2String(node->mode()),
node 769 src/prettyprinter.cc node->proxy()->var(),
node 770 src/prettyprinter.cc node->proxy()->name());
node 776 src/prettyprinter.cc PrintLiteral(node->proxy()->name(), true);
node 778 src/prettyprinter.cc PrintLiteral(node->fun()->name(), false);
node 785 src/prettyprinter.cc PrintLiteralIndented("NAME", node->proxy()->name(), true);
node 786 src/prettyprinter.cc Visit(node->module());
node 792 src/prettyprinter.cc PrintLiteralIndented("NAME", node->proxy()->name(), true);
node 793 src/prettyprinter.cc Visit(node->module());
node 799 src/prettyprinter.cc PrintLiteral(node->proxy()->name(), true);
node 804 src/prettyprinter.cc VisitBlock(node->body());
node 809 src/prettyprinter.cc Visit(node->proxy());
node 815 src/prettyprinter.cc PrintIndentedVisit("MODULE", node->module());
node 816 src/prettyprinter.cc PrintLiteralIndented("NAME", node->name(), false);
node 821 src/prettyprinter.cc PrintLiteralIndented("URL", node->url(), true);
node 826 src/prettyprinter.cc Visit(node->expression());
node 836 src/prettyprinter.cc PrintIndentedVisit("IF", node->condition());
node 837 src/prettyprinter.cc PrintIndentedVisit("THEN", node->then_statement());
node 838 src/prettyprinter.cc if (node->HasElseStatement()) {
node 839 src/prettyprinter.cc PrintIndentedVisit("ELSE", node->else_statement());
node 845 src/prettyprinter.cc PrintLabelsIndented("CONTINUE", node->target()->labels());
node 850 src/prettyprinter.cc PrintLabelsIndented("BREAK", node->target()->labels());
node 855 src/prettyprinter.cc PrintIndentedVisit("RETURN", node->expression());
node 861 src/prettyprinter.cc PrintIndentedVisit("OBJECT", node->expression());
node 862 src/prettyprinter.cc PrintIndentedVisit("BODY", node->statement());
node 868 src/prettyprinter.cc PrintLabelsIndented(NULL, node->labels());
node 869 src/prettyprinter.cc PrintIndentedVisit("TAG", node->tag());
node 870 src/prettyprinter.cc for (int i = 0; i < node->cases()->length(); i++) {
node 871 src/prettyprinter.cc PrintCaseClause(node->cases()->at(i));
node 878 src/prettyprinter.cc PrintLabelsIndented(NULL, node->labels());
node 879 src/prettyprinter.cc PrintIndentedVisit("BODY", node->body());
node 880 src/prettyprinter.cc PrintIndentedVisit("COND", node->cond());
node 886 src/prettyprinter.cc PrintLabelsIndented(NULL, node->labels());
node 887 src/prettyprinter.cc PrintIndentedVisit("COND", node->cond());
node 888 src/prettyprinter.cc PrintIndentedVisit("BODY", node->body());
node 894 src/prettyprinter.cc PrintLabelsIndented(NULL, node->labels());
node 895 src/prettyprinter.cc if (node->init()) PrintIndentedVisit("INIT", node->init());
node 896 src/prettyprinter.cc if (node->cond()) PrintIndentedVisit("COND", node->cond());
node 897 src/prettyprinter.cc PrintIndentedVisit("BODY", node->body());
node 898 src/prettyprinter.cc if (node->next()) PrintIndentedVisit("NEXT", node->next());
node 904 src/prettyprinter.cc PrintIndentedVisit("FOR", node->each());
node 905 src/prettyprinter.cc PrintIndentedVisit("IN", node->enumerable());
node 906 src/prettyprinter.cc PrintIndentedVisit("BODY", node->body());
node 912 src/prettyprinter.cc PrintIndentedVisit("TRY", node->try_block());
node 914 src/prettyprinter.cc node->variable(),
node 915 src/prettyprinter.cc node->variable()->name());
node 916 src/prettyprinter.cc PrintIndentedVisit("CATCH", node->catch_block());
node 922 src/prettyprinter.cc PrintIndentedVisit("TRY", node->try_block());
node 923 src/prettyprinter.cc PrintIndentedVisit("FINALLY", node->finally_block());
node 934 src/prettyprinter.cc PrintLiteralIndented("NAME", node->name(), false);
node 935 src/prettyprinter.cc PrintLiteralIndented("INFERRED NAME", node->inferred_name(), false);
node 936 src/prettyprinter.cc PrintParameters(node->scope());
node 947 src/prettyprinter.cc PrintLiteralIndented("SHARED INFO", node->shared_function_info(), true);
node 953 src/prettyprinter.cc PrintIndentedVisit("?", node->condition());
node 954 src/prettyprinter.cc PrintIndentedVisit("THEN", node->then_expression());
node 955 src/prettyprinter.cc PrintIndentedVisit("ELSE", node->else_expression());
node 960 src/prettyprinter.cc PrintLiteralIndented("LITERAL", node->handle(), true);
node 966 src/prettyprinter.cc PrintLiteralIndented("PATTERN", node->pattern(), false);
node 967 src/prettyprinter.cc PrintLiteralIndented("FLAGS", node->flags(), false);
node 973 src/prettyprinter.cc for (int i = 0; i < node->properties()->length(); i++) {
node 975 src/prettyprinter.cc switch (node->properties()->at(i)->kind()) {
node 998 src/prettyprinter.cc PrintIndentedVisit("KEY", node->properties()->at(i)->key());
node 999 src/prettyprinter.cc PrintIndentedVisit("VALUE", node->properties()->at(i)->value());
node 1006 src/prettyprinter.cc if (node->values()->length() > 0) {
node 1008 src/prettyprinter.cc for (int i = 0; i < node->values()->length(); i++) {
node 1009 src/prettyprinter.cc Visit(node->values()->at(i));
node 1016 src/prettyprinter.cc Variable* var = node->var();
node 1035 src/prettyprinter.cc PrintLiteralWithModeIndented(buf.start(), var, node->name());
node 1040 src/prettyprinter.cc IndentedScope indent(this, Token::Name(node->op()), node);
node 1041 src/prettyprinter.cc Visit(node->target());
node 1042 src/prettyprinter.cc Visit(node->value());
node 1047 src/prettyprinter.cc PrintIndentedVisit("THROW", node->exception());
node 1052 src/prettyprinter.cc IndentedScope indent(this, "PROPERTY", node);
node 1053 src/prettyprinter.cc Visit(node->obj());
node 1054 src/prettyprinter.cc Literal* literal = node->key()->AsLiteral();
node 1058 src/prettyprinter.cc PrintIndentedVisit("KEY", node->key());
node 1065 src/prettyprinter.cc Visit(node->expression());
node 1066 src/prettyprinter.cc PrintArguments(node->arguments());
node 1072 src/prettyprinter.cc Visit(node->expression());
node 1073 src/prettyprinter.cc PrintArguments(node->arguments());
node 1078 src/prettyprinter.cc PrintLiteralIndented("CALL RUNTIME ", node->name(), false);
node 1080 src/prettyprinter.cc PrintArguments(node->arguments());
node 1085 src/prettyprinter.cc PrintIndentedVisit(Token::Name(node->op()), node->expression());
node 1091 src/prettyprinter.cc OS::SNPrintF(buf, "%s %s", (node->is_prefix() ? "PRE" : "POST"),
node 1092 src/prettyprinter.cc Token::Name(node->op()));
node 1093 src/prettyprinter.cc PrintIndentedVisit(buf.start(), node->expression());
node 1098 src/prettyprinter.cc IndentedScope indent(this, Token::Name(node->op()), node);
node 1099 src/prettyprinter.cc Visit(node->left());
node 1100 src/prettyprinter.cc Visit(node->right());
node 1105 src/prettyprinter.cc IndentedScope indent(this, Token::Name(node->op()), node);
node 1106 src/prettyprinter.cc Visit(node->left());
node 1107 src/prettyprinter.cc Visit(node->right());
node 46 src/prettyprinter.h const char* Print(AstNode* node);
node 53 src/prettyprinter.h static void PrintOut(AstNode* node);
node 56 src/prettyprinter.h #define DECLARE_VISIT(type) virtual void Visit##type(type* node);
node 89 src/prettyprinter.h #define DECLARE_VISIT(type) virtual void Visit##type(type* node);
node 96 src/prettyprinter.h void PrintIndentedVisit(const char* s, AstNode* node);
node 280 src/profile-generator.cc delete node;
node 305 src/profile-generator.cc ProfileNode* node = root_;
node 310 src/profile-generator.cc node = node->FindOrAddChild(*entry);
node 313 src/profile-generator.cc node->IncrementSelfTicks();
node 318 src/profile-generator.cc ProfileNode* node = root_;
node 323 src/profile-generator.cc node = node->FindOrAddChild(*entry);
node 326 src/profile-generator.cc node->IncrementSelfTicks();
node 400 src/profile-generator.cc return node->children()->at(child_idx_);
node 403 src/profile-generator.cc return child_idx_ < node->children()->length();
node 407 src/profile-generator.cc ProfileNode* node;
node 421 src/profile-generator.cc callback->BeforeTraversingChild(current.node, current.current_child());
node 424 src/profile-generator.cc callback->AfterAllChildrenTraversed(current.node);
node 427 src/profile-generator.cc callback->AfterChildTraversed(parent.node, current.node);
node 442 src/profile-generator.cc node->IncreaseTotalTicks(node->self_ticks());
node 84 src/rewriter.cc virtual void Visit##type(type* node);
node 108 src/rewriter.cc if (!node->is_initializer_block()) Process(node->statements());
node 114 src/rewriter.cc if (!is_set_ && !node->expression()->IsThrow()) {
node 115 src/rewriter.cc node->set_expression(SetResult(node->expression()));
node 124 src/rewriter.cc Visit(node->else_statement());
node 127 src/rewriter.cc Visit(node->then_statement());
node 135 src/rewriter.cc Visit(node->body());
node 141 src/rewriter.cc VisitIterationStatement(node);
node 146 src/rewriter.cc VisitIterationStatement(node);
node 151 src/rewriter.cc VisitIterationStatement(node);
node 156 src/rewriter.cc VisitIterationStatement(node);
node 163 src/rewriter.cc Visit(node->catch_block());
node 167 src/rewriter.cc Visit(node->try_block());
node 174 src/rewriter.cc Visit(node->finally_block());
node 177 src/rewriter.cc Visit(node->try_block());
node 184 src/rewriter.cc ZoneList<CaseClause*>* clauses = node->cases();
node 206 src/rewriter.cc Visit(node->statement());
node 1907 src/spaces.cc FreeListNode* node = FreeListNode::FromAddress(start);
node 1908 src/spaces.cc node->set_size(heap_, size_in_bytes);
node 1916 src/spaces.cc node->set_next(small_list_);
node 1917 src/spaces.cc small_list_ = node;
node 1919 src/spaces.cc node->set_next(medium_list_);
node 1920 src/spaces.cc medium_list_ = node;
node 1922 src/spaces.cc node->set_next(large_list_);
node 1923 src/spaces.cc large_list_ = node;
node 1925 src/spaces.cc node->set_next(huge_list_);
node 1926 src/spaces.cc huge_list_ = node;
node 1935 src/spaces.cc FreeListNode* node = *list;
node 1937 src/spaces.cc if (node == NULL) return NULL;
node 1939 src/spaces.cc while (node != NULL &&
node 1940 src/spaces.cc Page::FromAddress(node->address())->IsEvacuationCandidate()) {
node 1941 src/spaces.cc available_ -= node->Size();
node 1942 src/spaces.cc node = node->next();
node 1945 src/spaces.cc if (node != NULL) {
node 1946 src/spaces.cc *node_size = node->Size();
node 1947 src/spaces.cc *list = node->next();
node 1952 src/spaces.cc return node;
node 1957 src/spaces.cc FreeListNode* node = NULL;
node 1960 src/spaces.cc node = PickNodeFromList(&small_list_, node_size);
node 1961 src/spaces.cc if (node != NULL) return node;
node 1965 src/spaces.cc node = PickNodeFromList(&medium_list_, node_size);
node 1966 src/spaces.cc if (node != NULL) return node;
node 1970 src/spaces.cc node = PickNodeFromList(&large_list_, node_size);
node 1971 src/spaces.cc if (node != NULL) return node;
node 1992 src/spaces.cc node = *cur;
node 1994 src/spaces.cc *cur = node->next();
node 1999 src/spaces.cc return node;
node 1377 src/spaces.h static intptr_t SumFreeList(FreeListNode* node);
node 61 src/splay-tree-inl.h Node* node = new(allocator_) Node(key, Config::NoValue());
node 62 src/splay-tree-inl.h InsertInternal(cmp, node);
node 70 src/splay-tree-inl.h void SplayTree<Config, Allocator>::InsertInternal(int cmp, Node* node) {
node 72 src/splay-tree-inl.h node->left_ = root_;
node 73 src/splay-tree-inl.h node->right_ = root_->right_;
node 76 src/splay-tree-inl.h node->right_ = root_;
node 77 src/splay-tree-inl.h node->left_ = root_->left_;
node 80 src/splay-tree-inl.h root_ = node;
node 301 src/splay-tree-inl.h Node* node = nodes_to_visit[pos++];
node 302 src/splay-tree-inl.h if (node->left() != NULL) nodes_to_visit.Add(node->left(), allocator_);
node 303 src/splay-tree-inl.h if (node->right() != NULL) nodes_to_visit.Add(node->right(), allocator_);
node 304 src/splay-tree-inl.h callback->Call(node);
node 153 src/splay-tree.h explicit Locator(Node* node) : node_(node) { }
node 158 src/splay-tree.h inline void bind(Node* node) { node_ = node; }
node 177 src/splay-tree.h void InsertInternal(int cmp, Node* node);
node 187 src/splay-tree.h void Call(Node* node) {
node 188 src/splay-tree.h callback_->Call(node->key(), node->value());
node 200 src/splay-tree.h void Call(Node* node) { AllocationPolicy::Delete(node); }
node 97 src/x64/deoptimizer-x64.cc DeoptimizingCodeListNode* node = new DeoptimizingCodeListNode(code);
node 99 src/x64/deoptimizer-x64.cc node->set_next(data->deoptimizing_code_list_);
node 100 src/x64/deoptimizer-x64.cc data->deoptimizing_code_list_ = node;
node 122 src/x64/lithium-codegen-x64.h #define DECLARE_DO(type) void Do##type(L##type* node);
node 2212 src/x64/lithium-x64.h #define DECLARE_DO(type) LInstruction* Do##type(H##type* node);
node 46 test/cctest/test-ast.cc AstNode* node = factory.NewEmptyStatement();
node 47 test/cctest/test-ast.cc list->Add(node);
node 49 test/cctest/test-ast.cc CHECK_EQ(node, list->at(0));
node 50 test/cctest/test-ast.cc CHECK_EQ(node, list->last());
node 54 test/cctest/test-ast.cc list->Add(node);
node 258 test/cctest/test-cpu-profiler.cc const ProfileNode* node = profile->top_down()->root();
node 259 test/cctest/test-cpu-profiler.cc while (node->children()->length() > 0) {
node 260 test/cctest/test-cpu-profiler.cc node = node->children()->last();
node 386 test/cctest/test-debug.cc v8::internal::DebugInfoListNode* node = debug->debug_info_list_;
node 390 test/cctest/test-debug.cc while (node) {
node 392 test/cctest/test-debug.cc node = node->next();
node 401 test/cctest/test-debug.cc while (node) {
node 402 test/cctest/test-debug.cc debugged_functions->set(count++, *node->debug_info());
node 403 test/cctest/test-debug.cc node = node->next();
node 81 test/cctest/test-heap-profiler.cc for (int i = 0, count = node->GetChildrenCount(); i < count; ++i) {
node 82 test/cctest/test-heap-profiler.cc const v8::HeapGraphEdge* prop = node->GetChild(i);
node 92 test/cctest/test-heap-profiler.cc for (int i = 0, count = node->GetChildrenCount(); i < count; ++i) {
node 93 test/cctest/test-heap-profiler.cc const v8::HeapGraphEdge* prop = node->GetChild(i);
node 94 test/cctest/test-heap-profiler.cc const v8::HeapGraphNode* node = prop->GetToNode();
node 95 test/cctest/test-heap-profiler.cc if (node->GetType() == v8::HeapGraphNode::kString) {
node 96 test/cctest/test-heap-profiler.cc v8::String::AsciiValue node_name(node->GetName());
node 272 test/cctest/test-heap-profiler.cc const v8::HeapGraphNode* node = prop->GetToNode();
node 273 test/cctest/test-heap-profiler.cc if (node->GetType() == v8::HeapGraphNode::kArray) {
node 274 test/cctest/test-heap-profiler.cc if (HasString(node, "x")) {
node 282 test/cctest/test-heap-profiler.cc const v8::HeapGraphNode* node = prop->GetToNode();
node 283 test/cctest/test-heap-profiler.cc if (node->GetType() == v8::HeapGraphNode::kArray) {
node 284 test/cctest/test-heap-profiler.cc if (HasString(node, "x")) {
node 853 test/cctest/test-heap-profiler.cc CHECK_EQ(node, snapshot->GetNodeById(node->GetId()));
node 854 test/cctest/test-heap-profiler.cc for (int i = 0, count = node->GetChildrenCount(); i < count; ++i) {
node 855 test/cctest/test-heap-profiler.cc const v8::HeapGraphEdge* prop = node->GetChild(i);
node 908 test/cctest/test-heap-profiler.cc const v8::HeapGraphNode* node =
node 910 test/cctest/test-heap-profiler.cc CHECK_EQ(NULL, node);
node 1035 test/cctest/test-heap-profiler.cc const v8::HeapGraphNode* node = parent->GetChild(i)->GetToNode();
node 1036 test/cctest/test-heap-profiler.cc if (node->GetType() == type && strcmp(name,
node 1038 test/cctest/test-heap-profiler.cc reinterpret_cast<const i::HeapEntry*>(node))->name()) == 0) {
node 1039 test/cctest/test-heap-profiler.cc return node;
node 1484 test/cctest/test-heap-profiler.cc for (int i = 0; i < node->GetChildrenCount(); ++i) {
node 1485 test/cctest/test-heap-profiler.cc const v8::HeapGraphEdge* handle_edge = node->GetChild(i);
node 63 test/cctest/test-profile-generator.cc ProfileNode node(NULL, NULL);
node 66 test/cctest/test-profile-generator.cc ProfileNode* childNode1 = node.FindOrAddChild(&entry1);
node 68 test/cctest/test-profile-generator.cc CHECK_EQ(childNode1, node.FindOrAddChild(&entry1));
node 71 test/cctest/test-profile-generator.cc ProfileNode* childNode2 = node.FindOrAddChild(&entry2);
node 74 test/cctest/test-profile-generator.cc CHECK_EQ(childNode1, node.FindOrAddChild(&entry1));
node 75 test/cctest/test-profile-generator.cc CHECK_EQ(childNode2, node.FindOrAddChild(&entry2));
node 78 test/cctest/test-profile-generator.cc ProfileNode* childNode3 = node.FindOrAddChild(&entry3);
node 82 test/cctest/test-profile-generator.cc CHECK_EQ(childNode1, node.FindOrAddChild(&entry1));
node 83 test/cctest/test-profile-generator.cc CHECK_EQ(childNode2, node.FindOrAddChild(&entry2));
node 84 test/cctest/test-profile-generator.cc CHECK_EQ(childNode3, node.FindOrAddChild(&entry3));
node 91 test/cctest/test-profile-generator.cc ProfileNode node(NULL, NULL);
node 94 test/cctest/test-profile-generator.cc ProfileNode* childNode1 = node.FindOrAddChild(&entry1);
node 96 test/cctest/test-profile-generator.cc CHECK_EQ(childNode1, node.FindOrAddChild(&entry1));
node 100 test/cctest/test-profile-generator.cc CHECK_EQ(childNode1, node.FindOrAddChild(&entry2));
node 104 test/cctest/test-profile-generator.cc CHECK_EQ(childNode1, node.FindOrAddChild(&entry3));
node 118 test/cctest/test-profile-generator.cc ProfileNode* node = tree_->root();
node 119 test/cctest/test-profile-generator.cc node = node->FindChild(entry1);
node 120 test/cctest/test-profile-generator.cc if (node == NULL) return NULL;
node 122 test/cctest/test-profile-generator.cc node = node->FindChild(entry2);
node 123 test/cctest/test-profile-generator.cc if (node == NULL) return NULL;
node 126 test/cctest/test-profile-generator.cc node = node->FindChild(entry3);
node 128 test/cctest/test-profile-generator.cc return node;
node 526 test/cctest/test-regexp.cc return compile_data.node;
node 536 test/cctest/test-regexp.cc RegExpNode* node = Compile(input, multiline, is_ascii);
node 537 test/cctest/test-regexp.cc USE(node);
node 540 test/cctest/test-regexp.cc RegExpEngine::DotPrint(input, node, false);