OLD | NEW |
1 // Copyright 2009 the V8 project authors. All rights reserved. | 1 // Copyright 2009 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 190 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
201 int DoProcess(JSObjectsClusterTree* tree); | 201 int DoProcess(JSObjectsClusterTree* tree); |
202 int FillEqualityTree(); | 202 int FillEqualityTree(); |
203 | 203 |
204 static const int kInitialBackrefsListCapacity = 2; | 204 static const int kInitialBackrefsListCapacity = 2; |
205 static const int kInitialSimilarityListCapacity = 2000; | 205 static const int kInitialSimilarityListCapacity = 2000; |
206 // Number of passes for finding equivalents. Limits the length of paths | 206 // Number of passes for finding equivalents. Limits the length of paths |
207 // that can be considered equivalent. | 207 // that can be considered equivalent. |
208 static const int kMaxPassesCount = 10; | 208 static const int kMaxPassesCount = 10; |
209 | 209 |
210 ZoneScope zscope_; | 210 ZoneScope zscope_; |
211 SimilarityList simList_; | 211 SimilarityList sim_list_; |
212 EqualityTree eqTree_; | 212 EqualityTree eq_tree_; |
213 ClusterBackRefs* currentPair_; | 213 ClusterBackRefs* current_pair_; |
214 JSObjectsClusterTree* currentSet_; | 214 JSObjectsClusterTree* current_set_; |
215 }; | 215 }; |
216 | 216 |
217 | 217 |
218 // RetainerHeapProfile is responsible for gathering and logging | 218 // RetainerHeapProfile is responsible for gathering and logging |
219 // "retainer profile" of JS objects allocated on heap. | 219 // "retainer profile" of JS objects allocated on heap. |
220 // It is run during garbage collection cycle, thus it doesn't need | 220 // It is run during garbage collection cycle, thus it doesn't need |
221 // to use handles. | 221 // to use handles. |
222 class RetainerHeapProfile BASE_EMBEDDED { | 222 class RetainerHeapProfile BASE_EMBEDDED { |
223 public: | 223 public: |
224 class Printer { | 224 class Printer { |
(...skipping 25 matching lines...) Expand all Loading... |
250 // Used by JSObjectsClusterTree::ForEach. | 250 // Used by JSObjectsClusterTree::ForEach. |
251 void Call(const JSObjectsCluster& cluster, JSObjectsClusterTree* tree); | 251 void Call(const JSObjectsCluster& cluster, JSObjectsClusterTree* tree); |
252 }; | 252 }; |
253 | 253 |
254 | 254 |
255 #endif // ENABLE_LOGGING_AND_PROFILING | 255 #endif // ENABLE_LOGGING_AND_PROFILING |
256 | 256 |
257 } } // namespace v8::internal | 257 } } // namespace v8::internal |
258 | 258 |
259 #endif // V8_HEAP_PROFILER_H_ | 259 #endif // V8_HEAP_PROFILER_H_ |
OLD | NEW |