timex.h 3.6 KB
Newer Older
L
Linus Torvalds 已提交
1 2
/*
 *  S390 version
3
 *    Copyright IBM Corp. 1999
L
Linus Torvalds 已提交
4 5 6 7 8 9 10 11
 *
 *  Derived from "include/asm-i386/timex.h"
 *    Copyright (C) 1992, Linus Torvalds
 */

#ifndef _ASM_S390_TIMEX_H
#define _ASM_S390_TIMEX_H

12 13
#include <asm/lowcore.h>

14 15 16
/* The value of the TOD clock for 1.1.1970. */
#define TOD_UNIX_EPOCH 0x7d91048bca000000ULL

M
Martin Schwidefsky 已提交
17
/* Inline functions for clock register access. */
18
static inline int set_tod_clock(__u64 time)
M
Martin Schwidefsky 已提交
19 20 21 22
{
	int cc;

	asm volatile(
23
		"   sck   %1\n"
M
Martin Schwidefsky 已提交
24 25
		"   ipm   %0\n"
		"   srl   %0,28\n"
26
		: "=d" (cc) : "Q" (time) : "cc");
M
Martin Schwidefsky 已提交
27 28 29
	return cc;
}

30
static inline int store_tod_clock(__u64 *time)
M
Martin Schwidefsky 已提交
31 32 33 34
{
	int cc;

	asm volatile(
35
		"   stck  %1\n"
M
Martin Schwidefsky 已提交
36 37
		"   ipm   %0\n"
		"   srl   %0,28\n"
38
		: "=d" (cc), "=Q" (*time) : : "cc");
M
Martin Schwidefsky 已提交
39 40 41 42 43
	return cc;
}

static inline void set_clock_comparator(__u64 time)
{
44
	asm volatile("sckc %0" : : "Q" (time));
M
Martin Schwidefsky 已提交
45 46 47 48
}

static inline void store_clock_comparator(__u64 *time)
{
49
	asm volatile("stckc %0" : "=Q" (*time));
M
Martin Schwidefsky 已提交
50 51
}

52 53 54 55 56 57 58 59
void clock_comparator_work(void);

static inline unsigned long long local_tick_disable(void)
{
	unsigned long long old;

	old = S390_lowcore.clock_comparator;
	S390_lowcore.clock_comparator = -1ULL;
60
	set_clock_comparator(S390_lowcore.clock_comparator);
61 62 63 64 65 66
	return old;
}

static inline void local_tick_enable(unsigned long long comp)
{
	S390_lowcore.clock_comparator = comp;
67
	set_clock_comparator(S390_lowcore.clock_comparator);
68 69
}

L
Linus Torvalds 已提交
70 71 72 73
#define CLOCK_TICK_RATE	1193180 /* Underlying HZ */

typedef unsigned long long cycles_t;

74
static inline void get_tod_clock_ext(char *clk)
75 76 77 78
{
	asm volatile("stcke %0" : "=Q" (*clk) : : "cc");
}

79
static inline unsigned long long get_tod_clock(void)
80
{
81
	unsigned char clk[16];
82
	get_tod_clock_ext(clk);
83
	return *((unsigned long long *)&clk[1]);
84 85
}

86 87 88 89 90 91 92 93 94 95 96 97
static inline unsigned long long get_tod_clock_fast(void)
{
#ifdef CONFIG_HAVE_MARCH_Z9_109_FEATURES
	unsigned long long clk;

	asm volatile("stckf %0" : "=Q" (clk) : : "cc");
	return clk;
#else
	return get_tod_clock();
#endif
}

98 99
static inline cycles_t get_cycles(void)
{
100
	return (cycles_t) get_tod_clock() >> 2;
101 102
}

M
Martin Schwidefsky 已提交
103
int get_sync_clock(unsigned long long *clock);
104
void init_cpu_timer(void);
105
unsigned long long monotonic_clock(void);
106

107 108 109 110 111 112 113 114
void tod_to_timeval(__u64, struct timespec *);

static inline
void stck_to_timespec(unsigned long long stck, struct timespec *ts)
{
	tod_to_timeval(stck - TOD_UNIX_EPOCH, ts);
}

115 116
extern u64 sched_clock_base_cc;

117 118 119 120 121 122 123 124 125
/**
 * get_clock_monotonic - returns current time in clock rate units
 *
 * The caller must ensure that preemption is disabled.
 * The clock and sched_clock_base get changed via stop_machine.
 * Therefore preemption must be disabled when calling this
 * function, otherwise the returned value is not guaranteed to
 * be monotonic.
 */
126
static inline unsigned long long get_tod_clock_monotonic(void)
127
{
128
	return get_tod_clock() - sched_clock_base_cc;
129 130
}

131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158
/**
 * tod_to_ns - convert a TOD format value to nanoseconds
 * @todval: to be converted TOD format value
 * Returns: number of nanoseconds that correspond to the TOD format value
 *
 * Converting a 64 Bit TOD format value to nanoseconds means that the value
 * must be divided by 4.096. In order to achieve that we multiply with 125
 * and divide by 512:
 *
 *    ns = (todval * 125) >> 9;
 *
 * In order to avoid an overflow with the multiplication we can rewrite this.
 * With a split todval == 2^32 * th + tl (th upper 32 bits, tl lower 32 bits)
 * we end up with
 *
 *    ns = ((2^32 * th + tl) * 125 ) >> 9;
 * -> ns = (2^23 * th * 125) + ((tl * 125) >> 9);
 *
 */
static inline unsigned long long tod_to_ns(unsigned long long todval)
{
	unsigned long long ns;

	ns = ((todval >> 32) << 23) * 125;
	ns += ((todval & 0xffffffff) * 125) >> 9;
	return ns;
}

L
Linus Torvalds 已提交
159
#endif