2011-12-08 15:14:42 -08:00
|
|
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
/* vim:set ts=2 sw=2 sts=2 et cindent: */
|
2012-05-21 04:12:37 -07:00
|
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
2011-12-08 15:14:42 -08:00
|
|
|
|
|
|
|
// Implement TimeStamp::Now() with QueryPerformanceCounter() controlled with
|
|
|
|
// values of GetTickCount().
|
|
|
|
|
|
|
|
// XXX Forcing log to be able to catch issues in the field. Should be removed
|
|
|
|
// before this reaches the Release or even Beta channel.
|
|
|
|
#define FORCE_PR_LOG
|
|
|
|
|
|
|
|
#include "mozilla/TimeStamp.h"
|
|
|
|
#include "mozilla/Mutex.h"
|
|
|
|
#include <windows.h>
|
|
|
|
|
|
|
|
#include "prlog.h"
|
|
|
|
#include <stdio.h>
|
2013-02-13 04:33:57 -08:00
|
|
|
#include <cstdlib> // for std::abs(int/long)
|
2011-12-08 15:14:42 -08:00
|
|
|
|
2012-09-06 08:01:06 -07:00
|
|
|
#include <intrin.h>
|
|
|
|
|
2011-12-08 15:14:42 -08:00
|
|
|
#if defined(PR_LOGGING)
|
|
|
|
// Log module for mozilla::TimeStamp for Windows logging...
|
|
|
|
//
|
|
|
|
// To enable logging (see prlog.h for full details):
|
|
|
|
//
|
|
|
|
// set NSPR_LOG_MODULES=TimeStampWindows:5
|
|
|
|
// set NSPR_LOG_FILE=nspr.log
|
|
|
|
//
|
|
|
|
// this enables PR_LOG_DEBUG level information and places all output in
|
|
|
|
// the file nspr.log
|
2012-10-29 16:32:10 -07:00
|
|
|
static PRLogModuleInfo*
|
|
|
|
GetTimeStampLog()
|
|
|
|
{
|
|
|
|
static PRLogModuleInfo *sLog;
|
|
|
|
if (!sLog)
|
|
|
|
sLog = PR_NewLogModule("TimeStampWindows");
|
|
|
|
return sLog;
|
|
|
|
}
|
|
|
|
#define LOG(x) PR_LOG(GetTimeStampLog(), PR_LOG_DEBUG, x)
|
2011-12-08 15:14:42 -08:00
|
|
|
#else
|
|
|
|
#define LOG(x)
|
|
|
|
#endif /* PR_LOGGING */
|
|
|
|
|
|
|
|
// Estimate of the smallest duration of time we can measure.
|
|
|
|
static volatile ULONGLONG sResolution;
|
|
|
|
static volatile ULONGLONG sResolutionSigDigs;
|
|
|
|
static const double kNsPerSecd = 1000000000.0;
|
|
|
|
static const LONGLONG kNsPerSec = 1000000000;
|
|
|
|
static const LONGLONG kNsPerMillisec = 1000000;
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// Global constants
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// If QPC is found faulty for two stamps in this interval, we disable it
|
|
|
|
// completely.
|
2011-12-08 15:14:42 -08:00
|
|
|
//
|
2013-02-11 13:56:58 -08:00
|
|
|
// Values is in [ms].
|
|
|
|
static const uint32_t kQPCHardFailureDetectionInterval = 2000;
|
2011-12-08 15:14:42 -08:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// On every use of QPC values we check the overflow of skew difference of the
|
|
|
|
// two stamps doesn't go over this number of milliseconds. Both timer
|
|
|
|
// functions jitter so we have to have some limit. The value is based on tests.
|
2011-12-08 15:14:42 -08:00
|
|
|
//
|
2013-02-11 13:56:58 -08:00
|
|
|
// Changing kQPCHardFailureDetectionInterval influences this limit: prolonging
|
|
|
|
// just kQPCHardFailureDetectionInterval means to be more sensitive to threshold
|
|
|
|
// overflows.
|
2011-12-08 15:14:42 -08:00
|
|
|
//
|
2013-02-11 13:56:58 -08:00
|
|
|
// How this constant is used (see CheckQPC function):
|
|
|
|
// First, adjust the limit linearly to the check interval:
|
|
|
|
// LIMIT = (GTC_now - GTC_epoch) / kQPCHardFailureDetectionInterval
|
2011-12-08 15:14:42 -08:00
|
|
|
// Then, check the skew difference overflow is in this adjusted limit:
|
2013-02-11 13:56:58 -08:00
|
|
|
// ABS( (QPC_now - GTC_now) - (QPC_epoch - GTC_epoch) ) - THRESHOLD < LIMIT
|
2011-12-08 15:14:42 -08:00
|
|
|
//
|
|
|
|
// Thresholds are calculated dynamically, see sUnderrunThreshold and
|
|
|
|
// sOverrunThreshold below.
|
|
|
|
//
|
2013-02-11 13:56:58 -08:00
|
|
|
// Limit is in number of [ms].
|
|
|
|
static const ULONGLONG kOverflowLimit = 50;
|
2011-12-08 15:14:42 -08:00
|
|
|
|
|
|
|
// If we are not able to get the value of GTC time increment, use this value
|
|
|
|
// which is the most usual increment.
|
|
|
|
static const DWORD kDefaultTimeIncrement = 156001;
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// Global variables, not changing at runtime
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
/**
|
|
|
|
* The [mt] unit:
|
|
|
|
*
|
|
|
|
* Many values are kept in ticks of the Performance Coutner x 1000,
|
|
|
|
* further just referred as [mt], meaning milli-ticks.
|
|
|
|
*
|
|
|
|
* This is needed to preserve maximum precision of the performance frequency
|
|
|
|
* representation. GetTickCount values in milliseconds are multiplied with
|
|
|
|
* frequency per second. Therefor we need to multiply QPC value by 1000 to
|
|
|
|
* have the same units to allow simple arithmentic with both QPC and GTC.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define ms2mt(x) ((x) * sFrequencyPerSec)
|
|
|
|
#define mt2ms(x) ((x) / sFrequencyPerSec)
|
2013-02-11 13:56:58 -08:00
|
|
|
#define mt2ms_f(x) (double(x) / sFrequencyPerSec)
|
2011-12-08 15:14:42 -08:00
|
|
|
|
|
|
|
// Result of QueryPerformanceFrequency
|
|
|
|
static LONGLONG sFrequencyPerSec = 0;
|
|
|
|
|
|
|
|
// Lower and upper bound that QueryPerformanceCounter - GetTickCount must not
|
2013-02-11 13:56:58 -08:00
|
|
|
// go under or over when compared to any older QPC - GTC difference (skew).
|
2011-12-08 15:14:42 -08:00
|
|
|
// Values are based on the GetTickCount update interval.
|
|
|
|
//
|
|
|
|
// Schematically, QPC works correctly if ((QPC_now - GTC_now) -
|
2013-02-11 13:56:58 -08:00
|
|
|
// (QPC_epoch - GTC_epoch)) is in [sUnderrunThreshold, sOverrunThreshold]
|
|
|
|
// interval every time we compare two time stamps.
|
2011-12-08 15:14:42 -08:00
|
|
|
//
|
|
|
|
// Kept in [mt]
|
|
|
|
static LONGLONG sUnderrunThreshold;
|
|
|
|
static LONGLONG sOverrunThreshold;
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// Interval to return duration using QPC. When two time stamps
|
|
|
|
// are within this interval, perform QPC check first.
|
|
|
|
//
|
|
|
|
// Kept in [mt]
|
|
|
|
static LONGLONG sQPCHardFailureDetectionInterval;
|
|
|
|
|
|
|
|
// Flag for stable TSC that indicates platform where QPC is stable.
|
|
|
|
static bool sHasStableTSC = false;
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// Global state variables, changing at runtime
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
// Initially true, set to false when QPC is found unstable and never
|
|
|
|
// returns back to true since that time.
|
|
|
|
static bool volatile sUseQPC = true;
|
2012-12-22 06:46:14 -08:00
|
|
|
|
2011-12-08 15:14:42 -08:00
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// Global lock
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
// Thread spin count before entering the full wait state for sTimeStampLock.
|
|
|
|
// Inspired by Rob Arnold's work on PRMJ_Now().
|
|
|
|
static const DWORD kLockSpinCount = 4096;
|
|
|
|
|
|
|
|
// Common mutex (thanks the relative complexity of the logic, this is better
|
|
|
|
// then using CMPXCHG8B.)
|
|
|
|
// It is protecting the globals bellow.
|
2013-02-11 13:56:58 -08:00
|
|
|
static CRITICAL_SECTION sTimeStampLock;
|
2011-12-08 15:14:42 -08:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// Used only when GetTickCount64 is not available on the platform.
|
|
|
|
// Last result of GetTickCount call.
|
2011-12-08 15:14:42 -08:00
|
|
|
//
|
|
|
|
// Kept in [ms]
|
2013-02-11 13:56:58 -08:00
|
|
|
static DWORD sLastGTCResult = 0;
|
2011-12-08 15:14:42 -08:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// Higher part of the 64-bit value of MozGetTickCount64,
|
|
|
|
// incremented atomically.
|
|
|
|
static DWORD sLastGTCRollover = 0;
|
2011-12-08 15:14:42 -08:00
|
|
|
|
|
|
|
namespace mozilla {
|
|
|
|
|
2012-09-08 11:12:34 -07:00
|
|
|
typedef ULONGLONG (WINAPI* GetTickCount64_t)();
|
|
|
|
static GetTickCount64_t sGetTickCount64 = nullptr;
|
2011-12-08 15:14:42 -08:00
|
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// Critical Section helper class
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
class AutoCriticalSection
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
AutoCriticalSection(LPCRITICAL_SECTION section)
|
|
|
|
: mSection(section)
|
|
|
|
{
|
|
|
|
::EnterCriticalSection(mSection);
|
|
|
|
}
|
|
|
|
~AutoCriticalSection()
|
|
|
|
{
|
|
|
|
::LeaveCriticalSection(mSection);
|
|
|
|
}
|
|
|
|
private:
|
|
|
|
LPCRITICAL_SECTION mSection;
|
|
|
|
};
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// Function protecting GetTickCount result from rolling over,
|
|
|
|
// result is in [ms]
|
|
|
|
static ULONGLONG WINAPI
|
|
|
|
MozGetTickCount64()
|
2011-12-08 15:14:42 -08:00
|
|
|
{
|
2013-02-11 13:56:58 -08:00
|
|
|
DWORD GTC = ::GetTickCount();
|
2011-12-08 15:14:42 -08:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// Cheaper then CMPXCHG8B
|
2011-12-08 15:14:42 -08:00
|
|
|
AutoCriticalSection lock(&sTimeStampLock);
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// Pull the rollover counter forward only if new value of GTC goes way
|
|
|
|
// down under the last saved result
|
|
|
|
if ((sLastGTCResult > GTC) && ((sLastGTCResult - GTC) > (1UL << 30)))
|
|
|
|
++sLastGTCRollover;
|
2012-09-08 11:13:17 -07:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
sLastGTCResult = GTC;
|
|
|
|
return ULONGLONG(sLastGTCRollover) << 32 | sLastGTCResult;
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// Result is in [mt]
|
|
|
|
static inline ULONGLONG
|
|
|
|
PerformanceCounter()
|
|
|
|
{
|
|
|
|
LARGE_INTEGER pc;
|
|
|
|
::QueryPerformanceCounter(&pc);
|
|
|
|
return pc.QuadPart * 1000ULL;
|
|
|
|
}
|
2011-12-08 15:14:42 -08:00
|
|
|
|
|
|
|
static void
|
|
|
|
InitThresholds()
|
|
|
|
{
|
|
|
|
DWORD timeAdjustment = 0, timeIncrement = 0;
|
|
|
|
BOOL timeAdjustmentDisabled;
|
|
|
|
GetSystemTimeAdjustment(&timeAdjustment,
|
|
|
|
&timeIncrement,
|
|
|
|
&timeAdjustmentDisabled);
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
LOG(("TimeStamp: timeIncrement=%d [100ns]", timeIncrement));
|
|
|
|
|
2011-12-08 15:14:42 -08:00
|
|
|
if (!timeIncrement)
|
|
|
|
timeIncrement = kDefaultTimeIncrement;
|
|
|
|
|
|
|
|
// Ceiling to a millisecond
|
|
|
|
// Example values: 156001, 210000
|
|
|
|
DWORD timeIncrementCeil = timeIncrement;
|
|
|
|
// Don't want to round up if already rounded, values will be: 156000, 209999
|
|
|
|
timeIncrementCeil -= 1;
|
|
|
|
// Convert to ms, values will be: 15, 20
|
|
|
|
timeIncrementCeil /= 10000;
|
|
|
|
// Round up, values will be: 16, 21
|
|
|
|
timeIncrementCeil += 1;
|
|
|
|
// Convert back to 100ns, values will be: 160000, 210000
|
|
|
|
timeIncrementCeil *= 10000;
|
|
|
|
|
|
|
|
// How many milli-ticks has the interval
|
|
|
|
LONGLONG ticksPerGetTickCountResolution =
|
2012-08-22 08:56:38 -07:00
|
|
|
(int64_t(timeIncrement) * sFrequencyPerSec) / 10000LL;
|
2011-12-08 15:14:42 -08:00
|
|
|
|
|
|
|
// How many milli-ticks has the interval rounded up
|
|
|
|
LONGLONG ticksPerGetTickCountResolutionCeiling =
|
2012-08-22 08:56:38 -07:00
|
|
|
(int64_t(timeIncrementCeil) * sFrequencyPerSec) / 10000LL;
|
2011-12-08 15:14:42 -08:00
|
|
|
|
|
|
|
// I observed differences about 2 times of the GTC resolution. GTC may
|
|
|
|
// jump by 32 ms in two steps, therefor use the ceiling value.
|
2013-02-11 13:56:58 -08:00
|
|
|
// Having 64 (15.6 or 16 * 4 exactly) is used to avoid false negatives
|
|
|
|
// for very short times where QPC and GTC may jitter even more.
|
2011-12-08 15:14:42 -08:00
|
|
|
sUnderrunThreshold =
|
2013-02-11 13:56:58 -08:00
|
|
|
LONGLONG((-4) * ticksPerGetTickCountResolutionCeiling);
|
2011-12-08 15:14:42 -08:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// QPC should go no further than 2 * GTC resolution.
|
2011-12-08 15:14:42 -08:00
|
|
|
sOverrunThreshold =
|
2013-02-11 13:56:58 -08:00
|
|
|
LONGLONG((+4) * ticksPerGetTickCountResolution);
|
|
|
|
|
|
|
|
sQPCHardFailureDetectionInterval =
|
|
|
|
LONGLONG(kQPCHardFailureDetectionInterval) * sFrequencyPerSec;
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
InitResolution()
|
|
|
|
{
|
|
|
|
// 10 total trials is arbitrary: what we're trying to avoid by
|
|
|
|
// looping is getting unlucky and being interrupted by a context
|
|
|
|
// switch or signal, or being bitten by paging/cache effects
|
|
|
|
|
|
|
|
ULONGLONG minres = ~0ULL;
|
|
|
|
int loops = 10;
|
|
|
|
do {
|
2013-02-11 13:56:58 -08:00
|
|
|
ULONGLONG start = PerformanceCounter();
|
|
|
|
ULONGLONG end = PerformanceCounter();
|
2011-12-08 15:14:42 -08:00
|
|
|
|
|
|
|
ULONGLONG candidate = (end - start);
|
|
|
|
if (candidate < minres)
|
|
|
|
minres = candidate;
|
|
|
|
} while (--loops && minres);
|
|
|
|
|
|
|
|
if (0 == minres) {
|
|
|
|
minres = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Converting minres that is in [mt] to nanosecods, multiplicating
|
|
|
|
// the argument to preserve resolution.
|
|
|
|
ULONGLONG result = mt2ms(minres * kNsPerMillisec);
|
|
|
|
if (0 == result) {
|
|
|
|
result = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
sResolution = result;
|
|
|
|
|
|
|
|
// find the number of significant digits in mResolution, for the
|
|
|
|
// sake of ToSecondsSigDigits()
|
|
|
|
ULONGLONG sigDigs;
|
|
|
|
for (sigDigs = 1;
|
|
|
|
!(sigDigs == result
|
|
|
|
|| 10*sigDigs > result);
|
|
|
|
sigDigs *= 10);
|
|
|
|
|
|
|
|
sResolutionSigDigs = sigDigs;
|
|
|
|
}
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// TimeStampValue implementation
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
TimeStampValue::TimeStampValue(_SomethingVeryRandomHere* nullValue)
|
|
|
|
: mGTC(0)
|
|
|
|
, mQPC(0)
|
|
|
|
, mHasQPC(false)
|
|
|
|
, mIsNull(true)
|
2011-12-08 15:14:42 -08:00
|
|
|
{
|
2013-02-11 13:56:58 -08:00
|
|
|
MOZ_ASSERT(!nullValue);
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
TimeStampValue::TimeStampValue(ULONGLONG aGTC, ULONGLONG aQPC, bool aHasQPC)
|
|
|
|
: mGTC(aGTC)
|
|
|
|
, mQPC(aQPC)
|
|
|
|
, mHasQPC(aHasQPC)
|
|
|
|
, mIsNull(false)
|
2011-12-08 15:14:42 -08:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
TimeStampValue&
|
|
|
|
TimeStampValue::operator+=(const int64_t aOther)
|
2011-12-08 15:14:42 -08:00
|
|
|
{
|
2013-02-11 13:56:58 -08:00
|
|
|
mGTC += aOther;
|
|
|
|
mQPC += aOther;
|
|
|
|
return *this;
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
TimeStampValue&
|
|
|
|
TimeStampValue::operator-=(const int64_t aOther)
|
2011-12-08 15:14:42 -08:00
|
|
|
{
|
2013-02-11 13:56:58 -08:00
|
|
|
mGTC -= aOther;
|
|
|
|
mQPC -= aOther;
|
|
|
|
return *this;
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// If the duration is less then one second, perform check of QPC stability
|
|
|
|
// by comparing both 'epoch' and 'now' skew (=GTC - QPC) values.
|
|
|
|
bool
|
|
|
|
TimeStampValue::CheckQPC(int64_t aDuration, const TimeStampValue &aOther) const
|
2012-09-06 08:01:06 -07:00
|
|
|
{
|
2013-02-11 13:56:58 -08:00
|
|
|
if (!mHasQPC || !aOther.mHasQPC) // Not both holding QPC
|
|
|
|
return false;
|
2012-09-06 08:01:06 -07:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
if (sHasStableTSC) // For stable TSC there is no need to check
|
|
|
|
return true;
|
2012-09-06 08:01:06 -07:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
if (!sUseQPC) // QPC globally disabled
|
|
|
|
return false;
|
2011-12-08 15:14:42 -08:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// Treat absolutely for calibration purposes
|
|
|
|
aDuration = std::abs(aDuration);
|
2011-12-08 15:14:42 -08:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// Check QPC is sane before using it.
|
2011-12-08 15:14:42 -08:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
LONGLONG skew1 = mGTC - mQPC;
|
|
|
|
LONGLONG skew2 = aOther.mGTC - aOther.mQPC;
|
2012-09-06 08:01:06 -07:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
LONGLONG diff = skew1 - skew2;
|
|
|
|
LONGLONG overflow;
|
2011-12-08 15:14:42 -08:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
if (diff < sUnderrunThreshold)
|
2011-12-08 15:14:42 -08:00
|
|
|
overflow = sUnderrunThreshold - diff;
|
2013-02-11 13:56:58 -08:00
|
|
|
else if (diff > sOverrunThreshold)
|
2011-12-08 15:14:42 -08:00
|
|
|
overflow = diff - sOverrunThreshold;
|
2013-02-11 13:56:58 -08:00
|
|
|
else
|
|
|
|
return true;
|
|
|
|
|
|
|
|
ULONGLONG trend;
|
|
|
|
if (aDuration)
|
|
|
|
trend = LONGLONG(overflow * (double(sQPCHardFailureDetectionInterval) / aDuration));
|
|
|
|
else
|
|
|
|
trend = overflow;
|
|
|
|
|
|
|
|
LOG(("TimeStamp: QPC check after %llums with overflow %1.4fms"
|
|
|
|
", adjusted trend per interval is %1.4fms",
|
|
|
|
mt2ms(aDuration),
|
|
|
|
mt2ms_f(overflow),
|
|
|
|
mt2ms_f(trend)));
|
|
|
|
|
|
|
|
if (trend <= ms2mt(kOverflowLimit)) {
|
|
|
|
// We are in the limit, let go.
|
|
|
|
return true;
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
// QPC deviates, don't use it.
|
|
|
|
LOG(("TimeStamp: QPC found highly jittering"));
|
|
|
|
|
|
|
|
if (aDuration < sQPCHardFailureDetectionInterval) {
|
|
|
|
// Interval between the two time stamps is very short, consider
|
|
|
|
// QPC as unstable and disable it completely.
|
|
|
|
sUseQPC = false;
|
|
|
|
LOG(("TimeStamp: QPC disabled"));
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
return false;
|
|
|
|
}
|
2011-12-08 15:14:42 -08:00
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
uint64_t
|
|
|
|
TimeStampValue::operator-(const TimeStampValue &aOther) const
|
|
|
|
{
|
|
|
|
if (mIsNull && aOther.mIsNull)
|
|
|
|
return uint64_t(0);
|
|
|
|
|
|
|
|
if (CheckQPC(int64_t(mGTC - aOther.mGTC), aOther))
|
|
|
|
return mQPC - aOther.mQPC;
|
|
|
|
|
|
|
|
return mGTC - aOther.mGTC;
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
// TimeDuration and TimeStamp implementation
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
double
|
|
|
|
TimeDuration::ToSeconds() const
|
|
|
|
{
|
2012-08-29 18:09:01 -07:00
|
|
|
// Converting before arithmetic avoids blocked store forward
|
|
|
|
return double(mValue) / (double(sFrequencyPerSec) * 1000.0);
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
double
|
|
|
|
TimeDuration::ToSecondsSigDigits() const
|
|
|
|
{
|
|
|
|
// don't report a value < mResolution ...
|
|
|
|
LONGLONG resolution = sResolution;
|
|
|
|
LONGLONG resolutionSigDigs = sResolutionSigDigs;
|
|
|
|
LONGLONG valueSigDigs = resolution * (mValue / resolution);
|
|
|
|
// and chop off insignificant digits
|
|
|
|
valueSigDigs = resolutionSigDigs * (valueSigDigs / resolutionSigDigs);
|
|
|
|
return double(valueSigDigs) / kNsPerSecd;
|
|
|
|
}
|
|
|
|
|
|
|
|
TimeDuration
|
|
|
|
TimeDuration::FromMilliseconds(double aMilliseconds)
|
|
|
|
{
|
2012-08-22 08:56:38 -07:00
|
|
|
return TimeDuration::FromTicks(int64_t(ms2mt(aMilliseconds)));
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
TimeDuration
|
|
|
|
TimeDuration::Resolution()
|
|
|
|
{
|
2012-08-22 08:56:38 -07:00
|
|
|
return TimeDuration::FromTicks(int64_t(sResolution));
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
struct TimeStampInitialization
|
|
|
|
{
|
|
|
|
TimeStampInitialization() {
|
|
|
|
TimeStamp::Startup();
|
|
|
|
}
|
|
|
|
~TimeStampInitialization() {
|
|
|
|
TimeStamp::Shutdown();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
static TimeStampInitialization initOnce;
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
static bool
|
|
|
|
HasStableTSC()
|
|
|
|
{
|
|
|
|
union {
|
|
|
|
int regs[4];
|
|
|
|
struct {
|
|
|
|
int nIds;
|
|
|
|
char cpuString[12];
|
|
|
|
};
|
|
|
|
} cpuInfo;
|
|
|
|
|
|
|
|
__cpuid(cpuInfo.regs, 0);
|
|
|
|
// Only allow Intel CPUs for now
|
|
|
|
// The order of the registers is reg[1], reg[3], reg[2]. We just adjust the
|
|
|
|
// string so that we can compare in one go.
|
|
|
|
if (_strnicmp(cpuInfo.cpuString, "GenuntelineI", sizeof(cpuInfo.cpuString)))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
int regs[4];
|
|
|
|
|
|
|
|
// detect if the Advanced Power Management feature is supported
|
|
|
|
__cpuid(regs, 0x80000000);
|
|
|
|
if (regs[0] < 0x80000007)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
__cpuid(regs, 0x80000007);
|
|
|
|
// if bit 8 is set than TSC will run at a constant rate
|
|
|
|
// in all ACPI P-state, C-states and T-states
|
|
|
|
return regs[3] & (1 << 8);
|
|
|
|
}
|
|
|
|
|
2011-12-08 15:14:42 -08:00
|
|
|
nsresult
|
|
|
|
TimeStamp::Startup()
|
|
|
|
{
|
|
|
|
// Decide which implementation to use for the high-performance timer.
|
|
|
|
|
2012-09-08 11:12:34 -07:00
|
|
|
HMODULE kernelDLL = GetModuleHandleW(L"kernel32.dll");
|
|
|
|
sGetTickCount64 = reinterpret_cast<GetTickCount64_t>
|
|
|
|
(GetProcAddress(kernelDLL, "GetTickCount64"));
|
|
|
|
if (!sGetTickCount64) {
|
|
|
|
// If the platform does not support the GetTickCount64 (Windows XP doesn't),
|
|
|
|
// then use our fallback implementation based on GetTickCount.
|
2013-02-11 13:56:58 -08:00
|
|
|
sGetTickCount64 = MozGetTickCount64;
|
2012-09-08 11:12:34 -07:00
|
|
|
}
|
|
|
|
|
2011-12-08 15:14:42 -08:00
|
|
|
InitializeCriticalSectionAndSpinCount(&sTimeStampLock, kLockSpinCount);
|
|
|
|
|
2013-02-11 13:56:58 -08:00
|
|
|
sHasStableTSC = HasStableTSC();
|
|
|
|
LOG(("TimeStamp: HasStableTSC=%d", sHasStableTSC));
|
|
|
|
|
2011-12-08 15:14:42 -08:00
|
|
|
LARGE_INTEGER freq;
|
2013-02-11 13:56:58 -08:00
|
|
|
sUseQPC = ::QueryPerformanceFrequency(&freq);
|
|
|
|
if (!sUseQPC) {
|
2011-12-08 15:14:42 -08:00
|
|
|
// No Performance Counter. Fall back to use GetTickCount.
|
|
|
|
InitResolution();
|
|
|
|
|
|
|
|
LOG(("TimeStamp: using GetTickCount"));
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
sFrequencyPerSec = freq.QuadPart;
|
2013-02-11 13:56:58 -08:00
|
|
|
LOG(("TimeStamp: QPC frequency=%llu", sFrequencyPerSec));
|
2011-12-08 15:14:42 -08:00
|
|
|
|
|
|
|
InitThresholds();
|
|
|
|
InitResolution();
|
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TimeStamp::Shutdown()
|
|
|
|
{
|
|
|
|
DeleteCriticalSection(&sTimeStampLock);
|
|
|
|
}
|
|
|
|
|
|
|
|
TimeStamp
|
2013-02-11 13:56:59 -08:00
|
|
|
TimeStamp::Now(bool aHighResolution)
|
2011-12-08 15:14:42 -08:00
|
|
|
{
|
2013-02-11 13:56:58 -08:00
|
|
|
// sUseQPC is volatile
|
2013-02-11 13:56:59 -08:00
|
|
|
bool useQPC = (aHighResolution && sUseQPC);
|
2013-02-11 13:56:58 -08:00
|
|
|
|
|
|
|
// Both values are in [mt] units.
|
|
|
|
ULONGLONG QPC = useQPC ? PerformanceCounter() : uint64_t(0);
|
|
|
|
ULONGLONG GTC = ms2mt(sGetTickCount64());
|
|
|
|
return TimeStamp(TimeStampValue(GTC, QPC, useQPC));
|
2011-12-08 15:14:42 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace mozilla
|