Searched refs:dominators (Results 1 – 4 of 4) sorted by relevance
2626 static int Intersect(int i1, int i2, const Vector<HeapEntry*>& dominators) { in Intersect() argument2629 while (finger1 < finger2) finger1 = dominators[finger1]->ordered_index(); in Intersect()2630 while (finger2 < finger1) finger2 = dominators[finger2]->ordered_index(); in Intersect()2640 Vector<HeapEntry*>* dominators) { in BuildDominatorTree() argument2643 for (int i = 0; i < root_index; ++i) (*dominators)[i] = NULL; in BuildDominatorTree()2644 (*dominators)[root_index] = entries[root_index]; in BuildDominatorTree()2656 if (dominators->at(ret->ordered_index()) != NULL) { in BuildDominatorTree()2664 if (dominators->at(ret->ordered_index()) != NULL) { in BuildDominatorTree()2667 *dominators)]; in BuildDominatorTree()2670 if (new_idom != NULL && dominators->at(i) != new_idom) { in BuildDominatorTree()[all …]
1047 Vector<HeapEntry*>* dominators);
23920 … inspector/profiler/detailed-heapshots-dominators-expansion-preserved-when-sorting.html23921 inspector/profiler/detailed-heapshots-dominators-show-all.html23922 inspector/profiler/detailed-heapshots-dominators-show-next.html23923 … inspector/profiler/detailed-heapshots-dominators-shown-node-count-preserved-when-sorting.html23924 inspector/profiler/detailed-heapshots-dominators-sorting.html
345 - dominators tree;