| /src/external/gpl2/groff/dist/src/libs/libgroff/ |
| prime.cpp | 13 unsigned lim = unsigned(sqrt((double)n)); local
16 if (d > lim)
21 if (d > lim)
|
| /src/lib/libc/stdlib/ |
| bsearch.c | 49 * divide the work in half by moving either left or right. If lim
50 * is odd, moving left simply involves halving lim: e.g., when lim
51 * is 5 we look at item 2, so we change lim to 2 so that we will
52 * look at items 0 & 1. If lim is even, the same applies. If lim
53 * is odd, moving right again involves halving lim, this time moving
54 * the base up one item past p: e.g., when lim is 5 we change base
55 * to item 3 and make lim 2 so that we will look at items 3 and 4.
56 * If lim is even, however, we have to shrink it by one befor
66 size_t lim; local
[all...] |
| /src/external/gpl3/binutils/dist/libiberty/ |
| bsearch.c | 59 * divide the work in half by moving either left or right. If lim
60 * is odd, moving left simply involves halving lim: e.g., when lim
61 * is 5 we look at item 2, so we change lim to 2 so that we will
62 * look at items 0 & 1. If lim is even, the same applies. If lim
63 * is odd, moving right again involes halving lim, this time moving
64 * the base up one item past p: e.g., when lim is 5 we change base
65 * to item 3 and make lim 2 so that we will look at items 3 and 4.
66 * If lim is even, however, we have to shrink it by one befor
77 int lim, cmp; local
[all...] |
| bsearch_r.c | 60 * divide the work in half by moving either left or right. If lim
61 * is odd, moving left simply involves halving lim: e.g., when lim
62 * is 5 we look at item 2, so we change lim to 2 so that we will
63 * look at items 0 & 1. If lim is even, the same applies. If lim
64 * is odd, moving right again involes halving lim, this time moving
65 * the base up one item past p: e.g., when lim is 5 we change base
66 * to item 3 and make lim 2 so that we will look at items 3 and 4.
67 * If lim is even, however, we have to shrink it by one befor
79 int lim, cmp; local
[all...] |
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| bsearch.c | 59 * divide the work in half by moving either left or right. If lim
60 * is odd, moving left simply involves halving lim: e.g., when lim
61 * is 5 we look at item 2, so we change lim to 2 so that we will
62 * look at items 0 & 1. If lim is even, the same applies. If lim
63 * is odd, moving right again involes halving lim, this time moving
64 * the base up one item past p: e.g., when lim is 5 we change base
65 * to item 3 and make lim 2 so that we will look at items 3 and 4.
66 * If lim is even, however, we have to shrink it by one befor
77 int lim, cmp; local
[all...] |
| bsearch_r.c | 60 * divide the work in half by moving either left or right. If lim
61 * is odd, moving left simply involves halving lim: e.g., when lim
62 * is 5 we look at item 2, so we change lim to 2 so that we will
63 * look at items 0 & 1. If lim is even, the same applies. If lim
64 * is odd, moving right again involes halving lim, this time moving
65 * the base up one item past p: e.g., when lim is 5 we change base
66 * to item 3 and make lim 2 so that we will look at items 3 and 4.
67 * If lim is even, however, we have to shrink it by one befor
79 int lim, cmp; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| bsearch.c | 59 * divide the work in half by moving either left or right. If lim
60 * is odd, moving left simply involves halving lim: e.g., when lim
61 * is 5 we look at item 2, so we change lim to 2 so that we will
62 * look at items 0 & 1. If lim is even, the same applies. If lim
63 * is odd, moving right again involes halving lim, this time moving
64 * the base up one item past p: e.g., when lim is 5 we change base
65 * to item 3 and make lim 2 so that we will look at items 3 and 4.
66 * If lim is even, however, we have to shrink it by one befor
77 int lim, cmp; local
[all...] |
| bsearch_r.c | 60 * divide the work in half by moving either left or right. If lim
61 * is odd, moving left simply involves halving lim: e.g., when lim
62 * is 5 we look at item 2, so we change lim to 2 so that we will
63 * look at items 0 & 1. If lim is even, the same applies. If lim
64 * is odd, moving right again involes halving lim, this time moving
65 * the base up one item past p: e.g., when lim is 5 we change base
66 * to item 3 and make lim 2 so that we will look at items 3 and 4.
67 * If lim is even, however, we have to shrink it by one befor
79 int lim, cmp; local
[all...] |
| /src/external/bsd/nvi/dist/clib/ |
| bsearch.c | 52 * divide the work in half by moving either left or right. If lim
53 * is odd, moving left simply involves halving lim: e.g., when lim
54 * is 5 we look at item 2, so we change lim to 2 so that we will
55 * look at items 0 & 1. If lim is even, the same applies. If lim
56 * is odd, moving right again involes halving lim, this time moving
57 * the base up one item past p: e.g., when lim is 5 we change base
58 * to item 3 and make lim 2 so that we will look at items 3 and 4.
59 * If lim is even, however, we have to shrink it by one befor
73 register size_t lim; local
[all...] |
| /src/sys/compat/common/ |
| kern_resource_43.c | 100 struct rlimit lim; local
106 lim.rlim_cur = olim.rlim_cur;
107 lim.rlim_max = olim.rlim_max;
108 return (dosetrlimit(l, l->l_proc, which, &lim));
|
| /src/lib/libc/db/btree/ |
| bt_search.c | 72 indx_t base, idx, lim; local
83 for (base = 0, lim = NEXTINDEX(h); lim; lim >>= 1) {
84 t->bt_cur.index = idx = base + ((uint32_t)lim >> 1);
94 --lim;
|
| /src/sys/compat/netbsd32/ |
| netbsd32_rlimit.c | 119 rlim_t lim; member in struct:__anon2412
125 struct plimit *lim; local
140 lim = p->p_limit;
145 rlim = lim->pl_rlimit + lm[i].id;
146 if (LIMITCHECK(rlim->rlim_cur, lm[i].lim))
148 if (LIMITCHECK(rlim->rlim_max, lm[i].lim))
154 lim = p->p_limit;
156 rlim = lim->pl_rlimit + lm[i].id;
157 if (LIMITCHECK(rlim->rlim_cur, lm[i].lim))
158 rlim->rlim_cur = lm[i].lim;
[all...] |
| /src/tests/include/sys/ |
| t_types.c | 120 rlim_t lim; local
126 lim = 0;
132 ATF_CHECK((lim - 1) > 0);
|
| /src/usr.sbin/bootp/common/ |
| hwaddr.c | 230 u_char *lim; local
232 lim = addr_out + len;
233 while (addr_out < lim)
|
| /src/external/bsd/ipf/dist/ipsend/ |
| 44arp.c | 70 char *lim, *buf, *next; local
108 lim = buf + needed;
109 for (next = buf; next < lim; next += rtm->rtm_msglen)
|
| /src/external/cddl/osnet/dist/common/nvpair/ |
| nvpair_alloc_fixed.c | 67 uintptr_t lim = base + va_arg(valist, size_t); local
70 if (base == 0 || (uintptr_t)&nvb[1] > lim)
75 nvb->nvb_lim = lim;
|
| /src/external/gpl3/binutils/dist/bfd/ |
| elfxx-kvx.c | 33 bfd_vma lim; local
36 lim = (bfd_vma) 1 << bits;
37 if (value >= lim)
49 bfd_vma lim; local
53 lim = (bfd_vma) 1 << (bits - 1);
54 if (value + lim >= lim * 2)
|
| /src/external/gpl3/binutils.old/dist/bfd/ |
| elfxx-kvx.c | 33 bfd_vma lim; local
36 lim = (bfd_vma) 1 << bits;
37 if (value >= lim)
49 bfd_vma lim; local
53 lim = (bfd_vma) 1 << (bits - 1);
54 if (value + lim >= lim * 2)
|
| /src/games/backgammon/backgammon/ |
| extra.c | 195 int i, inc, lim; local
201 lim = (b == 0 ? 7 : 18);
202 for (i = b + inc; i != lim; i += inc)
|
| /src/external/apache2/mDNSResponder/dist/mDNSShared/ |
| mDNSDebug.c | 82 const char *const lim = &buffer[512]; local
83 if (category) mDNS_snprintf_add(&dst, lim, "%s: ", category);
84 mDNS_vsnprintf(dst, (mDNSu32)(lim - dst), format, args);
|
| /src/external/gpl2/gettext/dist/gettext-tools/libgrep/ |
| m-fgrep.c | 47 const char *beg, *lim, *err; local
55 for (lim = beg; lim < pattern + pattern_size && *lim != '\n'; ++lim)
57 if ((err = kwsincr (ckwset->kwset, beg, lim - beg)) != NULL)
59 if (lim < pattern + pattern_size)
60 ++lim;
61 beg = lim;
|
| /src/external/gpl2/grep/dist/lib/ |
| exclude.c | 92 char const *lim; local
120 for (pattern = p = buf, lim = buf + buf_count; p <= lim; p++)
121 if (p < lim ? *p == line_end : buf < p && p[-1])
|
| /src/sys/arch/alpha/pci/ |
| dwlpx_dma.c | 100 int i, lim, wmask; local
107 lim = 128 * 1024;
110 lim = 32 * 1024;
148 t->_wsize = DWLPx_SG_MAPPED_SIZE(lim);
200 for (i = 0; i < lim; i++)
214 0, DWLPx_SG_MAPPED_SIZE(lim), sizeof(uint32_t),
|
| /src/sys/arch/sun3/dev/ |
| eeprom.c | 94 uint8_t *src, *dst, *lim; local
122 lim = dst + ee_size;
126 } while (dst < lim);
|
| /src/sys/fs/tmpfs/ |
| tmpfs_mem.c | 138 uint64_t lim; local
141 lim = tmpfs_bytes_max(mp);
142 if (mp->tm_bytes_used + sz >= lim) {
|
