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 198 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
209 void AddPath(const Vector<CodeEntry*>& path); | 209 void AddPath(const Vector<CodeEntry*>& path); |
210 void CalculateTotalTicksAndSamplingRate(); | 210 void CalculateTotalTicksAndSamplingRate(); |
211 | 211 |
212 const char* title() const { return title_; } | 212 const char* title() const { return title_; } |
213 unsigned uid() const { return uid_; } | 213 unsigned uid() const { return uid_; } |
214 const ProfileTree* top_down() const { return &top_down_; } | 214 const ProfileTree* top_down() const { return &top_down_; } |
215 | 215 |
216 int samples_count() const { return samples_.length(); } | 216 int samples_count() const { return samples_.length(); } |
217 ProfileNode* sample(int index) const { return samples_.at(index); } | 217 ProfileNode* sample(int index) const { return samples_.at(index); } |
218 | 218 |
219 int64_t start_time_us() const { return start_time_us_; } | 219 double start_time_ms() const { return start_time_ms_; } |
220 int64_t end_time_us() const { return end_time_us_; } | 220 double end_time_ms() const { return end_time_ms_; } |
221 | 221 |
222 void UpdateTicksScale(); | 222 void UpdateTicksScale(); |
223 | 223 |
224 void ShortPrint(); | 224 void ShortPrint(); |
225 void Print(); | 225 void Print(); |
226 | 226 |
227 private: | 227 private: |
228 const char* title_; | 228 const char* title_; |
229 unsigned uid_; | 229 unsigned uid_; |
230 bool record_samples_; | 230 bool record_samples_; |
231 int64_t start_time_us_; | 231 double start_time_ms_; |
232 int64_t end_time_us_; | 232 double end_time_ms_; |
233 List<ProfileNode*> samples_; | 233 List<ProfileNode*> samples_; |
234 ProfileTree top_down_; | 234 ProfileTree top_down_; |
235 | 235 |
236 DISALLOW_COPY_AND_ASSIGN(CpuProfile); | 236 DISALLOW_COPY_AND_ASSIGN(CpuProfile); |
237 }; | 237 }; |
238 | 238 |
239 | 239 |
240 class CodeMap { | 240 class CodeMap { |
241 public: | 241 public: |
242 CodeMap() : next_shared_id_(1) { } | 242 CodeMap() : next_shared_id_(1) { } |
(...skipping 113 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
356 CodeEntry* gc_entry_; | 356 CodeEntry* gc_entry_; |
357 CodeEntry* unresolved_entry_; | 357 CodeEntry* unresolved_entry_; |
358 | 358 |
359 DISALLOW_COPY_AND_ASSIGN(ProfileGenerator); | 359 DISALLOW_COPY_AND_ASSIGN(ProfileGenerator); |
360 }; | 360 }; |
361 | 361 |
362 | 362 |
363 } } // namespace v8::internal | 363 } } // namespace v8::internal |
364 | 364 |
365 #endif // V8_PROFILE_GENERATOR_H_ | 365 #endif // V8_PROFILE_GENERATOR_H_ |
OLD | NEW |