HomeSort by: relevance | last modified time | path
    Searched refs:it (Results 1 - 25 of 422) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/distrib/syspkg/sets/base/base-locale-it/
Makefile 3 PKGBASE=base-locale-it
  /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...]
  /src/tests/usr.bin/indent/
lsym_for.c 53 #define foreach(list, it) for (it = list.first; it != NULL; it = it->next)
65 /* $ No space after 'foreach' since it looks like a function name. */
66 foreach(list, it)
67 println(it->data);
69 /* $ No space after 'foreach' since it looks like a function name. */
70 foreach(list, it) {
    [all...]
  /src/usr.bin/xlint/lint1/
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...]
lex.c 58 /* Current position (it's also updated when an included file is parsed) */
77 * example, if the keyword '_Generic' were not defined, it would be interpreted
428 * and return it as an unsigned char or as EOF.
725 quoted_next(const buffer *lit, quoted_iterator *it)
729 *it = (quoted_iterator){ .start = it->end };
733 bool in_the_middle = it->start > 0;
735 it->start = s[0] == 'L' ? 2 : 1;
736 it->end = it->start
869 quoted_iterator it = { .end = 0 }, prev = it; local
947 quoted_iterator it = { .end = 0 }; local
987 quoted_iterator it = { .end = 0 }; local
1396 quoted_iterator it = { .end = 0 }; local
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/builtins/arm/
comparesf2.S 53 // effect this at all, but it *does* make sure that the C flag is clear for
59 it ne
66 it pl
79 it lo
86 it hi
90 // 0 if a >= b. All that remains to be done is to set it to 1 if a > b.
93 it ne
117 it ne
119 it pl
121 it l
    [all...]
  /src/sys/kern/
kern_time.c 138 * Don't allow the time to be set forward so far it
143 * past the cutoff, it will take a very long time
232 * comparatively less often than timers firing, and so it's better
236 struct itimer *it; local
238 LIST_FOREACH(it, &itimer_realtime_changed_notify, it_rtchgq) {
239 KASSERT(it->it_ops->ito_realtime_changed != NULL);
240 if (timespecisset(&it->it_time.it_value)) {
241 (*it->it_ops->ito_realtime_changed)(it);
530 * fake up a timezone struct and return it if demanded
853 struct itimer * const it = arg; local
1038 struct itimer *it; local
1316 struct itimer *it, *itn; local
1391 struct itimer *it; local
1494 struct itimer *it; local
1528 struct itimer *it; local
1578 struct itimer *it; local
1642 struct itimer *it; local
1759 struct itimer *it; local
1791 struct itimer *it; local
    [all...]
subr_time_arith.c 109 * fit in an unsigned long. Compute the total and convert it to
118 * case, but it is slightly slower and assumes that hz is integral.
142 * and callers need to check for it.
191 * fix it to have at least minimal value (i.e. if it is less
192 * than the resolution of the clock, round it up.). We don't
225 * True if tsp + usp can be computed without overflow, i.e., if it
252 * Break it into two mutually exclusive and exhaustive cases:
321 * timespecadd, so to avoid overflow it is not enough
324 * It is safe to compute the difference TIME_MIN -
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_win_dll_thunk.cc 78 for (DllThunkCB *it = &__start_dll_thunk; it < &__stop_dll_thunk; ++it)
79 if (*it)
80 (*it)();
sanitizer_win_weak_interception.cc 9 // This module should be included in the sanitizer when it is implemented as a
72 for (InterceptCB *it = &__start_weak_list; it < &__stop_weak_list; ++it)
73 if (*it)
74 (*it)();
  /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);
  /src/usr.bin/make/unit-tests/
varname-dot-newline.exp 1 make: varname-dot-newline.mk:28: Cannot overwrite ".newline" as it is read-only
3 make: varname-dot-newline.mk:30: Cannot append to ".newline" as it is read-only
5 make: varname-dot-newline.mk:32: Cannot delete ".newline" as it is read-only
var-readonly.exp 1 Global: ignoring delete 'N' as it is read-only
  /src/lib/libc/gen/
alarm.c 55 struct itimerval it, oitv; local
56 struct itimerval *itp = &it;
  /src/sys/arch/x86/x86/
bus_space.c 79 * will indicate that it's safe to use malloc() to dynamically allocate
161 bus_space_tag_t it; local
166 else for (it = t; it != NULL; it = it->bst_super) {
167 if ((it->bst_present & BUS_SPACE_OVERRIDE_MAP) == 0)
169 return (*it->bst_ov->ov_space_map)(it->bst_ctx, t, bpa, size,
190 bus_space_tag_t it; local
256 bus_space_tag_t it; local
305 bus_space_tag_t it; local
359 bus_space_tag_t it; local
396 bus_space_tag_t it; local
585 bus_space_tag_t it; local
607 bus_space_tag_t it; local
627 bus_space_tag_t it; local
    [all...]
bus_dma.c 418 * First attempt failed; bounce it.
619 * First attempt failed; bounce it.
844 * never reorders loads from wp/wt/wb or uc memory, but it
1000 * to wp/wt/wb or uc memory, but it may reorder two stores
1379 bus_dma_tag_t it; local
1386 else for (it = t; it != NULL; it = it->bdt_super) {
1387 if ((it->bdt_present & BUS_DMAMAP_OVERRIDE_SYNC) == 0
1402 bus_dma_tag_t it; local
1420 bus_dma_tag_t it; local
1438 bus_dma_tag_t it; local
1459 bus_dma_tag_t it; local
1480 bus_dma_tag_t it; local
1502 bus_dma_tag_t it; local
1522 bus_dma_tag_t it; local
1541 bus_dma_tag_t it; local
1559 bus_dma_tag_t it; local
1577 bus_dma_tag_t it; local
1594 bus_dma_tag_t it; local
1612 bus_dma_tag_t it; local
1630 bus_dma_tag_t it; local
1647 bus_dma_tag_t it; local
    [all...]
  /src/usr.sbin/sysinst/arch/hpcsh/
msg.md.en 42 {If you booted from an external device, you may now remove it.
  /src/sys/external/bsd/drm2/dist/drm/i915/
i915_scheduler.h 18 #define priolist_for_each_request(it, plist, idx) \
20 list_for_each_entry(it, &(plist)->requests[idx], sched.link)
22 #define priolist_for_each_request_consume(it, n, plist, idx) \
26 list_for_each_entry_safe(it, n, \
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/mmu/
nouveau_nvkm_subdev_mmu_vmm.c 105 nvkm_vmm_trace(struct nvkm_vmm_iter *it, char *buf)
108 for (lvl = it->max; lvl >= 0; lvl--) {
109 if (lvl >= it->lvl)
110 buf += sprintf(buf, "%05x:", it->pte[lvl]);
127 nvkm_vmm_flush_mark(struct nvkm_vmm_iter *it)
129 it->flush = min(it->flush, it->max - it->lvl);
133 nvkm_vmm_flush(struct nvkm_vmm_iter *it)
515 struct nvkm_vmm_iter it; local
    [all...]
  /src/sys/dev/ieee1394/
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/netinet/
sctp_timer.c 187 * change before we fail it.
371 * before we can mark it ..
396 * be the bounds and don't worry about it. This
460 * If it is less than DATAGRAM_ACKED it MUST
475 * seconds past our min.. forget it we will
489 /* ok it was sent after our boundary time. */
503 /* Is it expired? */
507 /* Yes so drop it */
782 * the association. This may fail it if SACKs are not comin
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
sanitizer_bitvector_test.cc 38 for (typename BV::Iterator it(bv); it.hasNext();) {
39 uptr idx = it.next();
71 for (set<uptr>::iterator it = s.begin(); it != s.end(); ++it) {
72 fprintf(stderr, "%lu ", *it);
95 for (uptr it = 0; it < 1000; it++)
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/xray/
xray_log_interface.cc 37 // when it should be a map because we're avoiding having to depend on C++
73 for (ModeImpl *it = ModeImpls; it != &SentinelModeImpl; it = it->Next) {
74 if (!internal_strcmp(Mode, it->Mode))
88 for (ModeImpl *it = ModeImpls; it != &SentinelModeImpl; it = it->Next)
    [all...]
  /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/share/mk/
bsd.hostinit.mk 9 MKREPRO=no # Native toolchain might be unable to do it

Completed in 736 milliseconds

1 2 3 4 5 6 7 8 91011>>