OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
79 result = AllocateTable(isolate(), kInitialCacheSize); | 79 result = AllocateTable(isolate(), kInitialCacheSize); |
80 tables_[generation] = *result; | 80 tables_[generation] = *result; |
81 } else { | 81 } else { |
82 CompilationCacheTable* table = | 82 CompilationCacheTable* table = |
83 CompilationCacheTable::cast(tables_[generation]); | 83 CompilationCacheTable::cast(tables_[generation]); |
84 result = Handle<CompilationCacheTable>(table, isolate()); | 84 result = Handle<CompilationCacheTable>(table, isolate()); |
85 } | 85 } |
86 return result; | 86 return result; |
87 } | 87 } |
88 | 88 |
| 89 |
89 void CompilationSubCache::Age() { | 90 void CompilationSubCache::Age() { |
90 // Age the generations implicitly killing off the oldest. | 91 // Age the generations implicitly killing off the oldest. |
91 for (int i = generations_ - 1; i > 0; i--) { | 92 for (int i = generations_ - 1; i > 0; i--) { |
92 tables_[i] = tables_[i - 1]; | 93 tables_[i] = tables_[i - 1]; |
93 } | 94 } |
94 | 95 |
95 // Set the first generation as unborn. | 96 // Set the first generation as unborn. |
96 tables_[0] = isolate()->heap()->undefined_value(); | 97 tables_[0] = isolate()->heap()->undefined_value(); |
97 } | 98 } |
98 | 99 |
(...skipping 408 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
507 } | 508 } |
508 | 509 |
509 | 510 |
510 void CompilationCache::Disable() { | 511 void CompilationCache::Disable() { |
511 enabled_ = false; | 512 enabled_ = false; |
512 Clear(); | 513 Clear(); |
513 } | 514 } |
514 | 515 |
515 | 516 |
516 } } // namespace v8::internal | 517 } } // namespace v8::internal |
OLD | NEW |