#define NANOSECONDS_PER_SECOND 1000000000
+#define SHIFT_CONST 1.07374182400631629848
static const LttTime ltt_time_zero = { 0, 0 };
return res;
}
+#define likely(x) __builtin_expect(!!(x), 1)
+#define unlikely(x) __builtin_expect(!!(x), 0)
+/* Fastest comparison : t1 > t2 */
static inline int ltt_time_compare(LttTime t1, LttTime t2)
{
- if(t1.tv_sec > t2.tv_sec) return 1;
- if(t1.tv_sec < t2.tv_sec) return -1;
- if(t1.tv_nsec > t2.tv_nsec) return 1;
- if(t1.tv_nsec < t2.tv_nsec) return -1;
- return 0;
+ int ret=0;
+ if(likely(t1.tv_sec > t2.tv_sec)) ret = 1;
+ else if(unlikely(t1.tv_sec < t2.tv_sec)) ret = -1;
+ else if(likely(t1.tv_nsec > t2.tv_nsec)) ret = 1;
+ else if(unlikely(t1.tv_nsec < t2.tv_nsec)) ret = -1;
+
+ return ret;
}
#define LTT_TIME_MIN(a,b) ((ltt_time_compare((a),(b)) < 0) ? (a) : (b))
*
* So we have 53-30 = 23 bits left for tv_sec.
* */
+#ifdef EXTRA_CHECK
g_assert(t1.tv_sec <= MAX_TV_SEC_TO_DOUBLE);
if(t1.tv_sec > MAX_TV_SEC_TO_DOUBLE)
g_warning("Precision loss in conversion LttTime to double");
- return (double)t1.tv_sec + (double)t1.tv_nsec / NANOSECONDS_PER_SECOND;
+#endif //EXTRA_CHECK
+ return ((double)t1.tv_sec * (double)NANOSECONDS_PER_SECOND) + (double)t1.tv_nsec;
}
*
* So we have 53-30 = 23 bits left for tv_sec.
* */
+#ifdef EXTRA_CHECK
g_assert(t1 <= MAX_TV_SEC_TO_DOUBLE);
if(t1 > MAX_TV_SEC_TO_DOUBLE)
g_warning("Conversion from non precise double to LttTime");
+#endif //EXTRA_CHECK
LttTime res;
- res.tv_sec = t1;
- res.tv_nsec = (t1 - res.tv_sec) * NANOSECONDS_PER_SECOND;
+ //res.tv_sec = t1/(double)NANOSECONDS_PER_SECOND;
+ res.tv_sec = (guint64)(t1 * SHIFT_CONST) >> 30;
+ res.tv_nsec = (t1 - (res.tv_sec*NANOSECONDS_PER_SECOND));
return res;
}
{
/* We lose precision if tv_sec is > than (2^62)-1
* */
+#ifdef EXTRA_CHECK
g_assert(t1 <= MAX_TV_SEC_TO_UINT64);
if(t1 > MAX_TV_SEC_TO_UINT64)
g_warning("Conversion from non precise uint64 to LttTime");
+#endif //EXTRA_CHECK
LttTime res;
res.tv_sec = t1/NANOSECONDS_PER_SECOND;
res.tv_nsec = (t1 - res.tv_sec*NANOSECONDS_PER_SECOND);