| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 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 10 matching lines...) Expand all Loading... |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 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 #ifndef V8_V8_COUNTERS_H_ | 28 #ifndef V8_V8_COUNTERS_H_ |
| 29 #define V8_V8_COUNTERS_H_ | 29 #define V8_V8_COUNTERS_H_ |
| 30 | 30 |
| 31 #include "allocation.h" |
| 31 #include "counters.h" | 32 #include "counters.h" |
| 33 #include "v8globals.h" |
| 32 | 34 |
| 33 namespace v8 { | 35 namespace v8 { |
| 34 namespace internal { | 36 namespace internal { |
| 35 | 37 |
| 36 #define HISTOGRAM_TIMER_LIST(HT) \ | 38 #define HISTOGRAM_TIMER_LIST(HT) \ |
| 37 /* Garbage collection timers. */ \ | 39 /* Garbage collection timers. */ \ |
| 38 HT(gc_compactor, V8.GCCompactor) \ | 40 HT(gc_compactor, V8.GCCompactor) \ |
| 39 HT(gc_scavenger, V8.GCScavenger) \ | 41 HT(gc_scavenger, V8.GCScavenger) \ |
| 40 HT(gc_context, V8.GCContext) /* GC context cleanup time */ \ | 42 HT(gc_context, V8.GCContext) /* GC context cleanup time */ \ |
| 41 /* Parsing timers. */ \ | 43 /* Parsing timers. */ \ |
| (...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 98 /* Amount of source code compiled with the old codegen. */ \ | 100 /* Amount of source code compiled with the old codegen. */ \ |
| 99 SC(total_old_codegen_source_size, V8.TotalOldCodegenSourceSize) \ | 101 SC(total_old_codegen_source_size, V8.TotalOldCodegenSourceSize) \ |
| 100 /* Amount of source code compiled with the full codegen. */ \ | 102 /* Amount of source code compiled with the full codegen. */ \ |
| 101 SC(total_full_codegen_source_size, V8.TotalFullCodegenSourceSize) \ | 103 SC(total_full_codegen_source_size, V8.TotalFullCodegenSourceSize) \ |
| 102 /* Number of contexts created from scratch. */ \ | 104 /* Number of contexts created from scratch. */ \ |
| 103 SC(contexts_created_from_scratch, V8.ContextsCreatedFromScratch) \ | 105 SC(contexts_created_from_scratch, V8.ContextsCreatedFromScratch) \ |
| 104 /* Number of contexts created by partial snapshot. */ \ | 106 /* Number of contexts created by partial snapshot. */ \ |
| 105 SC(contexts_created_by_snapshot, V8.ContextsCreatedBySnapshot) \ | 107 SC(contexts_created_by_snapshot, V8.ContextsCreatedBySnapshot) \ |
| 106 /* Number of code objects found from pc. */ \ | 108 /* Number of code objects found from pc. */ \ |
| 107 SC(pc_to_code, V8.PcToCode) \ | 109 SC(pc_to_code, V8.PcToCode) \ |
| 108 SC(pc_to_code_cached, V8.PcToCodeCached) | 110 SC(pc_to_code_cached, V8.PcToCodeCached) \ |
| 111 /* The write-buffer implementation of the write barrier. */ \ |
| 112 SC(write_buffer_compactions, V8.WriteBufferCompactions) \ |
| 113 SC(write_buffer_overflows, V8.WriteBufferOverflows) |
| 109 | 114 |
| 110 | 115 |
| 111 #define STATS_COUNTER_LIST_2(SC) \ | 116 #define STATS_COUNTER_LIST_2(SC) \ |
| 112 /* Number of code stubs. */ \ | 117 /* Number of code stubs. */ \ |
| 113 SC(code_stubs, V8.CodeStubs) \ | 118 SC(code_stubs, V8.CodeStubs) \ |
| 114 /* Amount of stub code. */ \ | 119 /* Amount of stub code. */ \ |
| 115 SC(total_stubs_code_size, V8.TotalStubsCodeSize) \ | 120 SC(total_stubs_code_size, V8.TotalStubsCodeSize) \ |
| 116 /* Amount of (JS) compiled code. */ \ | 121 /* Amount of (JS) compiled code. */ \ |
| 117 SC(total_compiled_code_size, V8.TotalCompiledCodeSize) \ | 122 SC(total_compiled_code_size, V8.TotalCompiledCodeSize) \ |
| 118 SC(gc_compactor_caused_by_request, V8.GCCompactorCausedByRequest) \ | 123 SC(gc_compactor_caused_by_request, V8.GCCompactorCausedByRequest) \ |
| (...skipping 159 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 278 stats_counter_count | 283 stats_counter_count |
| 279 }; | 284 }; |
| 280 | 285 |
| 281 // Sliding state window counters. | 286 // Sliding state window counters. |
| 282 static StatsCounter state_counters[]; | 287 static StatsCounter state_counters[]; |
| 283 }; | 288 }; |
| 284 | 289 |
| 285 } } // namespace v8::internal | 290 } } // namespace v8::internal |
| 286 | 291 |
| 287 #endif // V8_V8_COUNTERS_H_ | 292 #endif // V8_V8_COUNTERS_H_ |
| OLD | NEW |