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 13 matching lines...) Expand all Loading... |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #include "v8.h" | 28 #include "v8.h" |
29 | 29 |
30 #include "ast.h" | 30 #include "ast.h" |
31 #include "scopes.h" | 31 #include "scopes.h" |
32 #include "usage-analyzer.h" | 32 #include "usage-analyzer.h" |
33 | 33 |
34 namespace v8 { namespace internal { | 34 namespace v8 { |
| 35 namespace internal { |
35 | 36 |
36 // Weight boundaries | 37 // Weight boundaries |
37 static const int MinWeight = 1; | 38 static const int MinWeight = 1; |
38 static const int MaxWeight = 1000000; | 39 static const int MaxWeight = 1000000; |
39 static const int InitialWeight = 100; | 40 static const int InitialWeight = 100; |
40 | 41 |
41 | 42 |
42 class UsageComputer: public AstVisitor { | 43 class UsageComputer: public AstVisitor { |
43 public: | 44 public: |
44 static bool Traverse(Node* node); | 45 static bool Traverse(Node* node); |
(...skipping 397 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
442 // ---------------------------------------------------------------------------- | 443 // ---------------------------------------------------------------------------- |
443 // Interface to variable usage analysis | 444 // Interface to variable usage analysis |
444 | 445 |
445 bool AnalyzeVariableUsage(FunctionLiteral* lit) { | 446 bool AnalyzeVariableUsage(FunctionLiteral* lit) { |
446 if (!FLAG_usage_computation) return true; | 447 if (!FLAG_usage_computation) return true; |
447 HistogramTimerScope timer(&Counters::usage_analysis); | 448 HistogramTimerScope timer(&Counters::usage_analysis); |
448 return UsageComputer::Traverse(lit); | 449 return UsageComputer::Traverse(lit); |
449 } | 450 } |
450 | 451 |
451 } } // namespace v8::internal | 452 } } // namespace v8::internal |
OLD | NEW |