inline ClustersCoarser::ClusterBackRefs::ClusterBackRefs(
const JSObjectsCluster& cluster_)
- : cluster(cluster_), refs(INITIAL_BACKREFS_LIST_CAPACITY) {
+ : cluster(cluster_), refs(kInitialBackrefsListCapacity) {
}
ClustersCoarser::ClustersCoarser()
: zscope_(DELETE_ON_EXIT),
- simList_(ClustersCoarser::INITIAL_SIMILARITY_LIST_CAPACITY),
+ simList_(ClustersCoarser::kInitialSimilarityListCapacity),
currentPair_(NULL) {
}
void ClustersCoarser::Process(JSObjectsClusterTree* tree) {
int last_eq_clusters = -1;
- for (int i = 0; i < MAX_PASSES_COUNT; ++i) {
+ for (int i = 0; i < kMaxPassesCount; ++i) {
simList_.Clear();
const int curr_eq_clusters = DoProcess(tree);
// If no new cluster equivalents discovered, abort processing.
retainers_printed_(0),
current_printer_(NULL),
current_stream_(NULL) {
+ JSObjectsCluster roots(JSObjectsCluster::ROOTS);
ReferencesExtractor extractor(
- JSObjectsCluster(JSObjectsCluster::ROOTS), this);
+ roots, this);
Heap::IterateRoots(&extractor);
}
ReferencesExtractor extractor(cluster, this);
obj->Iterate(&extractor);
} else if (obj->IsJSGlobalPropertyCell()) {
- ReferencesExtractor extractor(
- JSObjectsCluster(JSObjectsCluster::GLOBAL_PROPERTY), this);
+ JSObjectsCluster global_prop(JSObjectsCluster::GLOBAL_PROPERTY);
+ ReferencesExtractor extractor(global_prop, this);
obj->Iterate(&extractor);
}
}
// Second level of retainer graph.
ASSERT(coarse_cluster_tree_ != NULL);
ASSERT(current_stream_ != NULL);
- if (retainers_printed_ >= MAX_RETAINERS_TO_PRINT) {
- if (retainers_printed_ == MAX_RETAINERS_TO_PRINT) {
+ if (retainers_printed_ >= kMaxRetainersToPrint) {
+ if (retainers_printed_ == kMaxRetainersToPrint) {
// TODO(mnaganov): Print the exact count.
current_stream_->Add(",...");
++retainers_printed_; // avoid printing ellipsis next time.
int DoProcess(JSObjectsClusterTree* tree);
int FillEqualityTree();
- static const int INITIAL_BACKREFS_LIST_CAPACITY = 2;
- static const int INITIAL_SIMILARITY_LIST_CAPACITY = 2000;
+ static const int kInitialBackrefsListCapacity = 2;
+ static const int kInitialSimilarityListCapacity = 2000;
// Number of passes for finding equivalents. Limits the length of paths
// that can be considered equivalent.
- static const int MAX_PASSES_COUNT = 10;
+ static const int kMaxPassesCount = 10;
ZoneScope zscope_;
SimilarityList simList_;
JSObjectsCluster Clusterize(Object* obj);
// Limit on the number of retainers to be printed per cluster.
- static const int MAX_RETAINERS_TO_PRINT = 50;
+ static const int kMaxRetainersToPrint = 50;
ZoneScope zscope_;
JSObjectsClusterTree retainers_tree_;
ClustersCoarser coarser_;