Lines Matching full:will

10 If you grep through the kernel source you will find a number of architecture-
27 a Linux system will eventually read the clock source to determine exactly
30 Typically the clock source is a monotonic, atomic counter which will provide
32 It will ideally NEVER stop ticking as long as the system is running. It
63 You will find a number of helper functions in the clock source code intended
67 clocksource_register_khz() which will help out assigning both shift and mult
71 there is nowadays even clocksource_mmio_init() which will take a memory
76 Since a 32-bit counter at say 100 MHz will wrap around to zero after some 43
77 seconds, the code handling the clock source will have to compensate for this.
80 code knows when the counter will wrap around and can insert the necessary
100 You will notice that the clock event device code is based on the same basic
104 attribute however: the system will not try to plan events beyond the time
115 implementation is not provided, the system jiffy counter will be used as
130 i.e. after 64 bits. Since this is a nanosecond value this will mean it wraps
134 it will fall back to using jiffies, making its maximum resolution 1/HZ of the
135 jiffy frequency for the architecture. This will affect scheduling accuracy
136 and will likely show up in system benchmarks.
154 Some hardware (such as the x86 TSC) will cause the sched_clock() function to
164 will sometimes behave strangely. Basically these delays usually use a hard
170 full frequency, any delay() will be twice as long. Usually this does not