times
digest_time(struct hash_list *hl, int times)
while (--times > 0 && count < INT_MAX / 10)
int times;
pu->times = 1;
if ((pu->times < MAXSCORES &&
pu->times++;
utime(const char *path, const struct utimbuf *times)
if (times == (struct utimbuf *) NULL)
tv[0].tv_sec = times->actime;
tv[1].tv_sec = times->modtime;
(void) times(&after);
(void) times(&before);
Call UPDATE_HASH() MIN_MATCH-3 more times
Call UPDATE_HASH() MIN_MATCH-3 more times
base->times = rbtree_create(mini_ev_cmp);
if(!base->times) {
while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))
(void)rbtree_delete(base->times, p);
free(base->times);
(void)rbtree_insert(ev->ev_base->times, &ev->node);
(void)rbtree_delete(ev->ev_base->times, &ev->node);
rbtree_type* times;
base->times = rbtree_create(mini_ev_cmp);
if(!base->times) {
while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))
(void)rbtree_delete(base->times, p);
free(base->times);
(void)rbtree_insert(ev->ev_base->times, &ev->node);
(void)rbtree_delete(ev->ev_base->times, &ev->node);
rbtree_type* times;
if (h >= ARRAY_SIZE(crtc->debug.vbl.times))
h = ARRAY_SIZE(crtc->debug.vbl.times) - 1;
crtc->debug.vbl.times[h]++;
for (row = 0; row < ARRAY_SIZE(crtc->debug.vbl.times); row++)
count += crtc->debug.vbl.times[row];
for (row = 0; row < ARRAY_SIZE(crtc->debug.vbl.times); row++) {
if (crtc->debug.vbl.times[row]) {
x = ilog2(crtc->debug.vbl.times[row]);
unsigned int times[17]; /* [1us, 16ms] */
times[1] = ktime_get_raw();
nctx, engine->name, ktime_to_ns(times[1] - times[0]));
times[1] = ktime_get_raw();
times[1] = ktime_sub(ktime_get_raw(), times[1]);
times[0] = times[1];
ktime_to_ns(times[0]),
prime - 1, div64_u64(ktime_to_ns(times[1]), prime - 1));
ktime_t times[2] = {};
times[0] = ktime_get_raw();
atomic_set(&engine->reset_timeout.times, -1);
ktime_t times[2] = {};
times[1] = ktime_get_raw();
times[1] = ktime_sub(ktime_get_raw(), times[1]);
times[0] = times[1];
nctx, ve[0]->engine->name, ktime_to_ns(times[0]),
prime, div64_u64(ktime_to_ns(times[1]), prime));
atomic_set(&engine->reset_timeout.times, -1);
atomic_set(&vm->fault_attr.times, -1);
atomic_set(&vm->fault_attr.times, -1);
ktime_t times[2] = {};
times[1] = ktime_get_raw();
times[1] = ktime_sub(ktime_get_raw(), times[1]);
times[0] = times[1];
ktime_to_ns(times[0]),
prime, div64_u64(ktime_to_ns(times[1]), prime));
ktime_t times[2] = {};
times[1] = ktime_get_raw();
times[1] = ktime_sub(ktime_get_raw(), times[1]);
times[0] = times[1];
ktime_to_ns(times[0]),
prime, div64_u64(ktime_to_ns(times[1]), prime));
struct timestamp times[1]; /* in order of ascending bits */
syscallarg(const struct timespec *) times;
tsp = SCARG(uap, times);
syscallarg(const struct timespec *) times;
tsp = SCARG(uap, times);
Call UPDATE_HASH() MIN_MATCH-3 more times
Call UPDATE_HASH() MIN_MATCH-3 more times
syscallarg(const struct timespec *) times;
syscallarg(const struct timespec *) times;
clock_t times(struct tms *);
struct timespec times[2];
times[0].tv_nsec = UTIME_OMIT;
times[1].tv_sec = mtime;
times[1].tv_nsec = 0;
if (utimensat(AT_FDCWD, local, times, 0) == -1)
base->times = rbtree_create(base->region, mini_ev_cmp);
if(!base->times) {
while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))
(void)rbtree_delete(base->times, p);
(void)rbtree_insert(ev->ev_base->times, &ev->node);
(void)rbtree_delete(ev->ev_base->times, &ev->node);
rbtree_type* times;
base->times = rbtree_create(mini_ev_cmp);
if(!base->times) {
while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))
(void)rbtree_delete(base->times, p);
free(base->times);
(void)rbtree_insert(ev->ev_base->times, &ev->node);
(void)rbtree_delete(ev->ev_base->times, &ev->node);
rbtree_type* times;
base->times = rbtree_create(mini_ev_cmp);
if(!base->times) {
while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))
(void)rbtree_delete(base->times, p);
free(base->times);
(void)rbtree_insert(ev->ev_base->times, &ev->node);
(void)rbtree_delete(ev->ev_base->times, &ev->node);
rbtree_type* times;