Lines Matching +full:no +full:- +full:tick +full:- +full:in +full:- +full:suspend
1 // SPDX-License-Identifier: GPL-2.0
4 * counters to full 64-bit ns values.
24 * struct clock_data - all data needed for sched_clock() (including
31 * @rate: Tick rate of the registered clock.
35 * performance. In particular 'seq' and 'read_data[0]' (combined) should fit
36 * into a single 64-byte cache line.
48 static int irqtime = -1;
55 * We don't need to use get_jiffies_64 on 32-bit arches here in jiffy_sched_clock_read()
58 return (u64)(jiffies - INITIAL_JIFFIES); in jiffy_sched_clock_read()
93 cyc = (rd->read_sched_clock() - rd->epoch_cyc) & in sched_clock_noinstr()
94 rd->sched_clock_mask; in sched_clock_noinstr()
95 res = rd->epoch_ns + cyc_to_ns(cyc, rd->mult, rd->shift); in sched_clock_noinstr()
113 * sched_clock() will never observe mis-matched data even if called from
116 * In order to preserve the data cache profile of sched_clock() as much
147 ns = rd.epoch_ns + cyc_to_ns((cyc - rd.epoch_cyc) & rd.sched_clock_mask, rd.mult, rd.shift); in update_sched_clock()
193 ns = rd.epoch_ns + cyc_to_ns((cyc - rd.epoch_cyc) & rd.sched_clock_mask, rd.mult, rd.shift); in sched_clock_register()
229 if (irqtime > 0 || (irqtime == -1 && rate >= 1000000)) in sched_clock_register()
240 * If no sched_clock() function has been provided at that point, in generic_sched_clock_init()
264 * section in sched_clock(). It relies on the read_seqcount_retry()
281 rd->read_sched_clock = suspended_sched_clock_read; in sched_clock_suspend()
290 rd->epoch_cyc = cd.actual_read_sched_clock(); in sched_clock_resume()
292 rd->read_sched_clock = cd.actual_read_sched_clock; in sched_clock_resume()
296 .suspend = sched_clock_suspend,