Searched refs:dominators (Results 1 - 2 of 2) sorted by relevance

/external/v8/src/
H A Dprofile-generator.cc3057 // full GC is reachable from the root when computing dominators.
3196 static int Intersect(int i1, int i2, const Vector<int>& dominators) { argument
3199 while (finger1 < finger2) finger1 = dominators[finger1];
3200 while (finger2 < finger1) finger2 = dominators[finger2];
3211 Vector<int>* dominators) {
3215 for (int i = 0; i < root_index; ++i) (*dominators)[i] = kNoDominator;
3216 (*dominators)[root_index] = root_index;
3218 // The affected array is used to mark entries which dominators
3237 if ((*dominators)[i] == root_index) continue;
3243 if (dominators
3209 BuildDominatorTree( const Vector<HeapEntry*>& entries, Vector<int>* dominators) argument
[all...]
H A Dprofile-generator.h1087 Vector<int>* dominators);

Completed in 120 milliseconds