| /src/external/gpl3/gdb/dist/sim/testsuite/cris/c/ |
| setrlimit1.c | 14 struct rlimit lim; local
15 memset (&lim, 0, sizeof lim);
17 if (setrlimit (RLIMIT_NPROC, &lim) != -1
|
| ugetrlimit1.c | 14 struct rlimit lim; local
16 if (getrlimit (RLIMIT_NPROC, &lim) != -1
|
| /src/external/gpl3/gdb.old/dist/sim/testsuite/cris/c/ |
| setrlimit1.c | 14 struct rlimit lim; local
15 memset (&lim, 0, sizeof lim);
17 if (setrlimit (RLIMIT_NPROC, &lim) != -1
|
| ugetrlimit1.c | 14 struct rlimit lim; local
16 if (getrlimit (RLIMIT_NPROC, &lim) != -1
|
| /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/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/gpl3/gdb/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/gdb.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/external/gpl3/gdb/dist/gnulib/import/ |
| getdtablesize.c | 112 struct rlimit lim; local
114 if (getrlimit (RLIMIT_NOFILE, &lim) == 0
115 && 0 <= lim.rlim_cur && lim.rlim_cur <= INT_MAX
116 && lim.rlim_cur != RLIM_INFINITY
117 && lim.rlim_cur != RLIM_SAVED_CUR
118 && lim.rlim_cur != RLIM_SAVED_MAX)
119 return lim.rlim_cur;
|
| /src/external/gpl3/gdb.old/dist/gnulib/import/ |
| getdtablesize.c | 112 struct rlimit lim; local
114 if (getrlimit (RLIMIT_NOFILE, &lim) == 0
115 && 0 <= lim.rlim_cur && lim.rlim_cur <= INT_MAX
116 && lim.rlim_cur != RLIM_INFINITY
117 && lim.rlim_cur != RLIM_SAVED_CUR
118 && lim.rlim_cur != RLIM_SAVED_MAX)
119 return lim.rlim_cur;
|
| /src/external/mit/expat/dist/xmlwf/ |
| codepage.c | 58 int j, lim; local
61 lim = info.LeadByte[i + 1];
62 for (j = info.LeadByte[i]; j <= lim; j++)
|
| /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...] |
