The wall clock timer (implementing using the RTC or cycle counter on x86) is

so much more accurate than the per process timers that we get better results
(less noise) by sorting according to wall time than process time.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4034 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-10-03 21:08:20 +00:00
parent 62d928eac1
commit b0d0f5b473
2 changed files with 2 additions and 14 deletions

View File

@ -64,13 +64,7 @@ public:
// operator< - Allow sorting...
bool operator<(const Timer &T) const {
// Primary sort key is User+System time
if (UserTime+SystemTime < T.UserTime+T.SystemTime)
return true;
if (UserTime+SystemTime > T.UserTime+T.SystemTime)
return false;
// Secondary sort key is Wall Time
// Sort by Wall Time elapsed, as it is the only thing really accurate
return Elapsed < T.Elapsed;
}
bool operator>(const Timer &T) const { return T.operator<(*this); }

View File

@ -64,13 +64,7 @@ public:
// operator< - Allow sorting...
bool operator<(const Timer &T) const {
// Primary sort key is User+System time
if (UserTime+SystemTime < T.UserTime+T.SystemTime)
return true;
if (UserTime+SystemTime > T.UserTime+T.SystemTime)
return false;
// Secondary sort key is Wall Time
// Sort by Wall Time elapsed, as it is the only thing really accurate
return Elapsed < T.Elapsed;
}
bool operator>(const Timer &T) const { return T.operator<(*this); }