OLD | NEW |
1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 24 matching lines...) Expand all Loading... |
35 namespace internal { | 35 namespace internal { |
36 | 36 |
37 // Weight boundaries | 37 // Weight boundaries |
38 static const int MinWeight = 1; | 38 static const int MinWeight = 1; |
39 static const int MaxWeight = 1000000; | 39 static const int MaxWeight = 1000000; |
40 static const int InitialWeight = 100; | 40 static const int InitialWeight = 100; |
41 | 41 |
42 | 42 |
43 class UsageComputer: public AstVisitor { | 43 class UsageComputer: public AstVisitor { |
44 public: | 44 public: |
45 static bool Traverse(Node* node); | 45 static bool Traverse(AstNode* node); |
46 | 46 |
47 void VisitBlock(Block* node); | 47 void VisitBlock(Block* node); |
48 void VisitDeclaration(Declaration* node); | 48 void VisitDeclaration(Declaration* node); |
49 void VisitExpressionStatement(ExpressionStatement* node); | 49 void VisitExpressionStatement(ExpressionStatement* node); |
50 void VisitEmptyStatement(EmptyStatement* node); | 50 void VisitEmptyStatement(EmptyStatement* node); |
51 void VisitIfStatement(IfStatement* node); | 51 void VisitIfStatement(IfStatement* node); |
52 void VisitContinueStatement(ContinueStatement* node); | 52 void VisitContinueStatement(ContinueStatement* node); |
53 void VisitBreakStatement(BreakStatement* node); | 53 void VisitBreakStatement(BreakStatement* node); |
54 void VisitReturnStatement(ReturnStatement* node); | 54 void VisitReturnStatement(ReturnStatement* node); |
55 void VisitWithEnterStatement(WithEnterStatement* node); | 55 void VisitWithEnterStatement(WithEnterStatement* node); |
(...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
109 | 109 |
110 private: | 110 private: |
111 UsageComputer* uc_; | 111 UsageComputer* uc_; |
112 int old_weight_; | 112 int old_weight_; |
113 }; | 113 }; |
114 | 114 |
115 | 115 |
116 // ---------------------------------------------------------------------------- | 116 // ---------------------------------------------------------------------------- |
117 // Implementation of UsageComputer | 117 // Implementation of UsageComputer |
118 | 118 |
119 bool UsageComputer::Traverse(Node* node) { | 119 bool UsageComputer::Traverse(AstNode* node) { |
120 UsageComputer uc(InitialWeight, false); | 120 UsageComputer uc(InitialWeight, false); |
121 uc.Visit(node); | 121 uc.Visit(node); |
122 return !uc.HasStackOverflow(); | 122 return !uc.HasStackOverflow(); |
123 } | 123 } |
124 | 124 |
125 | 125 |
126 void UsageComputer::VisitBlock(Block* node) { | 126 void UsageComputer::VisitBlock(Block* node) { |
127 VisitStatements(node->statements()); | 127 VisitStatements(node->statements()); |
128 } | 128 } |
129 | 129 |
(...skipping 313 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
443 // ---------------------------------------------------------------------------- | 443 // ---------------------------------------------------------------------------- |
444 // Interface to variable usage analysis | 444 // Interface to variable usage analysis |
445 | 445 |
446 bool AnalyzeVariableUsage(FunctionLiteral* lit) { | 446 bool AnalyzeVariableUsage(FunctionLiteral* lit) { |
447 if (!FLAG_usage_computation) return true; | 447 if (!FLAG_usage_computation) return true; |
448 HistogramTimerScope timer(&Counters::usage_analysis); | 448 HistogramTimerScope timer(&Counters::usage_analysis); |
449 return UsageComputer::Traverse(lit); | 449 return UsageComputer::Traverse(lit); |
450 } | 450 } |
451 | 451 |
452 } } // namespace v8::internal | 452 } } // namespace v8::internal |
OLD | NEW |