From b0d0f5b473b6110a9e72d823f2f2c4c52928a1bf Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Thu, 3 Oct 2002 21:08:20 +0000 Subject: 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 --- include/llvm/Support/Timer.h | 8 +------- 1 file changed, 1 insertion(+), 7 deletions(-) (limited to 'include/llvm/Support/Timer.h') diff --git a/include/llvm/Support/Timer.h b/include/llvm/Support/Timer.h index 93d9d16609..5d39fc0f12 100644 --- a/include/llvm/Support/Timer.h +++ b/include/llvm/Support/Timer.h @@ -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); } -- cgit v1.2.3