Lines Matching refs:period
14 * and i the time period over which the differential is taken. So d/dt_{-i} is
15 * the differential over the i-th last period.
34 * if (++x_{j}, ++t > period)
45 * if (++t > period) t /= 2:
49 * period/2 + (++t % period/2)
51 * [ Furthermore, when we choose period to be 2^n it can be written in terms of
56 * c = t / (period/2)
61 * This allows us to do away with the loop over all prop_locals on each period
62 * expiration. By remembering the period count under which it was last accessed
67 * We can then lazily catch up to the global period count every time we are
195 pl->period = 0;
205 * Catch up with missed period expirations.
214 unsigned long period = 1UL << (pg->shift - 1);
215 unsigned long period_mask = ~(period - 1);
223 * Fast path - check if the local and global period count still match
226 if (pl->period == global_period)
230 prop_adjust_shift(&pl->shift, &pl->period, pg->shift);
233 * For each missed period, we half the local counter.
235 * pl->events >> (global_period - pl->period);
237 period = (global_period - pl->period) >> (pg->shift - 1);
238 if (period < BITS_PER_LONG) {
244 __percpu_counter_add(&pl->events, -val + (val >> period),
249 pl->period = global_period;
301 * p_{j} = x_{j} / (period/2 + t % period/2)
329 pl->period = 0;
339 * Catch up with missed period expirations.
344 unsigned long period = 1UL << (pg->shift - 1);
345 unsigned long period_mask = ~(period - 1);
353 * Fast path - check if the local and global period count still match
356 if (pl->period == global_period)
360 prop_adjust_shift(&pl->shift, &pl->period, pg->shift);
362 * For each missed period, we half the local counter.
364 period = (global_period - pl->period) >> (pg->shift - 1);
365 if (likely(period < BITS_PER_LONG))
366 pl->events >>= period;
369 pl->period = global_period;
389 * p_{j} = x_{j} / (period/2 + t % period/2)