| /src/lib/libc/gen/ |
| alarm.c | 55 struct itimerval it, oitv; local
56 struct itimerval *itp = ⁢
|
| /src/lib/libmenu/ |
| driver.c | 43 * request and is not printable then it assumed to be a user defined command.
48 int drv_top_row, drv_scroll, i, it, status = E_OK; local
69 it = menu->cur_item;
232 &it);
233 drv_new_item = menu->items[it];
241 &it);
242 drv_new_item = menu->items[it];
251 MATCH_FORWARD, &it);
252 drv_new_item = menu->items[it];
256 * we don't do this here it won't get done since th
[all...] |
| /src/tests/lib/libpthread/ |
| t_sleep.c | 73 struct itimerval it; local
91 timerclear(&it.it_interval);
92 timerclear(&it.it_value);
93 it.it_value.tv_sec = 1;
94 setitimer(ITIMER_REAL, &it, NULL);
|
| t_once.c | 172 struct itimerval it; local
180 timerclear(&it.it_value);
181 it.it_value.tv_usec = 500000;
182 timerclear(&it.it_interval);
183 setitimer(ITIMER_REAL, &it, NULL);
194 timerclear(&it.it_value);
195 setitimer(ITIMER_REAL, &it, NULL);
|
| /src/tests/lib/libc/sys/ |
| t_getitimer.c | 66 struct itimerval it; local
73 (void)memset(&it, 0, sizeof(struct itimerval));
75 ATF_REQUIRE(getitimer(ITIMER_REAL, &it) == 0);
77 if (it.it_value.tv_sec != 0 || it.it_value.tv_usec != 0)
80 ATF_REQUIRE(getitimer(ITIMER_VIRTUAL, &it) == 0);
82 if (it.it_value.tv_sec != 0 || it.it_value.tv_usec != 0)
85 ATF_REQUIRE(getitimer(ITIMER_PROF, &it) == 0);
87 if (it.it_value.tv_sec != 0 || it.it_value.tv_usec != 0
104 struct itimerval it; local
124 struct itimerval it; local
158 struct itimerval it, ot; local
178 struct itimerval it, ot; local
215 const struct itimerval it[] = { local
[all...] |
| t_sigtimedwait.c | 95 struct itimerval it; local
99 memset(&it, 0, sizeof it);
100 it.it_value.tv_sec = 5;
101 RL(setitimer(ITIMER_REAL, &it, NULL));
174 "by a signal it's not waiting for");
194 * This returns 0 sometimes, when it should return -1/EINTR
211 "by a signal it's not waiting for");
|
| /src/sys/external/bsd/drm2/dist/drm/i915/selftests/ |
| i915_gem.c | 26 struct i915_gem_engines_iter it; local
30 for_each_gem_engine(ce, i915_gem_context_lock_engines(ctx), it) {
87 * of stolen being trashed across S4, we trash it ourselves.
|
| i915_active.c | 222 static struct intel_engine_cs *node_to_barrier(struct active_node *it)
226 if (!is_barrier(&it->base))
229 engine = __barrier_to_engine(it);
231 if (!is_barrier(&it->base))
245 struct active_node *it, *n; local
247 rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) {
250 engine = node_to_barrier(it);
256 if (i915_active_fence_isset(&it->base)) {
258 "\ttimeline: %llx\n", it->timeline);
276 struct active_node *it, *n local
[all...] |
| intel_memory_region.c | 204 * Try to fragment the address space, such that half of it is free, but
310 struct i915_gem_engines_iter it; local
325 for_each_gem_engine(ce, i915_gem_context_lock_engines(ctx), it) {
|
| /src/usr.bin/flock/ |
| flock.c | 261 struct itimerspec it; local
264 timespecclear(&it.it_interval);
265 it.it_value.tv_sec = timeout;
266 it.it_value.tv_nsec = (timeout - it.it_value.tv_sec) *
276 if (timer_settime(tm, TIMER_RELTIME, &it, NULL) == -1)
|
| /src/usr.bin/xlint/lint1/ |
| ckgetopt.c | 64 * handled by a case label, it is set to ' '. In the end, only ' ' and
108 quoted_iterator it = { .end = 0 }; local
109 while (quoted_next(str, &it))
110 buf_add_char(&buf, (char)it.value);
|
| emit1.c | 207 * mark it as used so lint2 does not complain about unused
275 * mark it as used so lint2 does not complain about unused
341 * XXX it would probably be better to
361 quoted_iterator it = { .end = 0 }; local
362 while (quoted_next(arg->u.ops.left->u.str_literals, &it))
363 buf_add_char(&buf, (char)it.value);
492 * The last character. It is always written, so we can detect
|
| cksnprintb.c | 51 quoted_iterator it; member in struct:__anon8361
60 len(quoted_iterator it)
62 return (int)(it.end - it.start);
72 start(quoted_iterator it, const buffer *buf)
74 return buf->data + it.start;
78 val(quoted_iterator it)
80 return it.value;
84 check_hex_escape(const buffer *buf, quoted_iterator it)
86 if (it.hex_digits > 1)
141 quoted_iterator it = ck->it; local
162 quoted_iterator *it = &ck->it; local
[all...] |
| /src/sys/dev/ieee1394/ |
| fwohcivar.h | 64 } arrq, arrs, atrq, atrs, it[OHCI_DMA_ITCH], ir[OHCI_DMA_IRCH]; member in struct:fwohci_softc
|
| fwdev.c | 103 struct fw_xferq *it; member in struct:fw_drv1
207 if (d->it != NULL) {
208 struct fw_xferq *it = d->it; local
210 if ((it->flag & FWXFERQ_OPEN) == 0)
212 if (it->flag & FWXFERQ_RUNNING) {
213 it->flag &= ~FWXFERQ_RUNNING;
214 fc->itx_disable(fc, it->dmach);
217 fwdev_freebuf(it);
218 it->flag &
313 struct fw_xferq *it; local
390 struct fw_xferq *ir, *it; local
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/i915/gt/ |
| intel_breadcrumbs.c | 329 struct i915_request *it = local
330 list_entry(pos, typeof(*it), signal_link);
332 if (i915_seqno_passed(rq->fence.seqno, it->fence.seqno))
|
| intel_engine_user.c | 77 struct intel_engine_cs *it =
78 rb_entry(p, typeof(*it), uabi_node);
80 if (class < it->uabi_class)
82 else if (class > it->uabi_class ||
83 instance > it->uabi_instance)
85 else if (instance < it->uabi_instance)
88 return it;
244 struct list_head *it, *next; local
258 list_for_each_safe(it, next, &engines) {
260 container_of(it, typeof(*engine), uabi_node.list)
[all...] |
| /src/sys/kern/ |
| subr_bufq.c | 136 struct bufq_strat *bsp, *it; local
162 * if a strategy specified by flags is found, use it.
171 SLIST_FOREACH(it, &bufq_strat_list, bs_next) {
173 STRAT_MATCH(strategy, (it))) {
174 bsp = it;
178 if (bsp == NULL || (it)->bs_prio > bsp->bs_prio)
179 bsp = it;
|
| bufq_priocscan.c | 224 * although it might affect against fairness.
235 * increases the total throughput, it can also increase latencies
312 * it means that a queue needs to consume its burst
330 * just serve it without consuming its burst count.
369 * XXX account only by number of requests. is it good enough?
402 struct buf *it; local
408 RB_TREE_FOREACH(it, &cq->cq_buffers) {
409 if (it == bp) {
|
| /src/usr.sbin/altq/altqstat/ |
| altqstat.c | 97 struct itimerval it; local
182 it.it_interval.tv_sec = interval / 1000;
183 it.it_interval.tv_usec = interval % 1000 * 1000;
184 it.it_value = it.it_interval;
185 setitimer(ITIMER_REAL, &it, NULL);
|
| /src/common/lib/libc/gen/ |
| rpst.c | 360 rpst_iterator_match_p(const struct rpst_node *n, const struct rpst_iterator *it)
363 if (n->n_y > it->it_max_y) {
366 if (n->n_x < it->it_min_x) {
369 if (n->n_x > it->it_max_x) {
377 uint64_t max_x, struct rpst_iterator *it)
389 it->it_tree = t;
390 it->it_cur = n;
391 it->it_idx = (min_x & rpst_startmask(t)) != 0;
392 it->it_level = 0;
393 it->it_max_y = max_y
567 struct rpst_iterator it; local
609 struct rpst_iterator it; local
[all...] |
| /src/games/larn/ |
| create.c | 69 player changes levels. If that level is unknown it will be created.
72 Note that it is here we remove genocided monsters from the present level.
245 int it, arg, mit, marg; local
261 it = mit = arg = marg = 0;
264 it = OWALL;
267 it = OCLOSEDDOOR;
273 it = OLARNEYE;
280 it = OPOTION;
292 it = newobject(k + 1, &arg);
295 item[j][i] = it;
[all...] |
| /src/sys/dev/i2o/ |
| iopsp.c | 228 struct iopsp_target *it; local
291 * changed, then don't describe it again.
293 it = &sc->sc_targetmap[targ];
294 it->it_flags |= IT_PRESENT;
296 if (it->it_width != param.sdi.negdatawidth ||
297 it->it_offset != param.sdi.negoffset ||
298 it->it_syncrate != syncrate) {
299 it->it_width = param.sdi.negdatawidth;
300 it->it_offset = param.sdi.negoffset;
301 it->it_syncrate = syncrate
[all...] |
| /src/sys/dev/tc/ |
| pxg.c | 275 int it; local
284 it = hi[0] & 15;
290 switch (it) {
345 /* STIC has lost the plot, punish it. */
|
| /src/sys/external/bsd/drm2/dist/drm/i915/gem/ |
| i915_gem_userptr.c | 54 struct interval_tree_node it; member in struct:i915_mmu_object
59 GEM_BUG_ON(!RB_EMPTY_NODE(&mo->it.rb));
60 interval_tree_insert(&mo->it, &mo->mn->objects);
65 if (RB_EMPTY_NODE(&mo->it.rb))
68 interval_tree_remove(&mo->it, &mo->mn->objects);
69 RB_CLEAR_NODE(&mo->it.rb);
105 struct interval_tree_node *it; local
116 it = interval_tree_iter_first(&mn->objects, range->start, end);
117 while (it) {
127 * GEM object so it is entirely possible to gain
[all...] |
