| /external/valgrind/none/tests/ |
| closeall.c | 8 struct rlimit lim; local
11 getrlimit(RLIMIT_NOFILE, &lim);
13 for ( fd = 3; fd < lim.rlim_cur; fd++ )
|
| /bionic/libc/upstream-netbsd/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 involes 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...] |
| /device/linaro/bootloader/edk2/StdLib/LibC/StdLib/ |
| Bsearch.c | 68 * divide the work in half by moving either left or right. If lim
69 * is odd, moving left simply involves halving lim: e.g., when lim
70 * is 5 we look at item 2, so we change lim to 2 so that we will
71 * look at items 0 & 1. If lim is even, the same applies. If lim
72 * is odd, moving right again involes halving lim, this time moving
73 * the base up one item past p: e.g., when lim is 5 we change base
74 * to item 3 and make lim 2 so that we will look at items 3 and 4.
75 * If lim is even, however, we have to shrink it by one before
90 size_t lim; local
[all...] |
| /toolchain/binutils/binutils-2.27/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 register int lim, cmp; local
[all...] |
| /external/expat/xmlwf/ |
| codepage.c | 53 int j, lim; local
56 lim = info.LeadByte[i + 1];
57 for (j = info.LeadByte[i]; j <= lim; j++)
|
| /external/libvpx/libvpx/vp8/common/arm/ |
| loopfilter_arm.c | 39 unsigned char lim = *lfi->lim; local
41 vp8_mbloop_filter_horizontal_edge_y_neon(y_ptr, y_stride, mblim, lim,
45 vp8_mbloop_filter_horizontal_edge_uv_neon(u_ptr, uv_stride, mblim, lim,
54 unsigned char lim = *lfi->lim; local
57 vp8_mbloop_filter_vertical_edge_y_neon(y_ptr, y_stride, mblim, lim, hev_thr);
60 vp8_mbloop_filter_vertical_edge_uv_neon(u_ptr, uv_stride, mblim, lim,
69 unsigned char lim = *lfi->lim; local
90 unsigned char lim = *lfi->lim; local
[all...] |
| /external/vboot_reference/host/lib/ |
| fmap.c | 31 ssize_t lim = size - sizeof(FmapHeader); local
33 if (lim >= 0 && is_fmap(ptr))
37 for (align = FMAP_SEARCH_STRIDE; align <= lim; align *= 2);
39 for (offset = align; offset <= lim; offset += align * 2)
|
| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| issue18808.go | 9 const lim = 0x80000000 const
13 if x == lim {
16 panic("x == lim returned false")
21 if x != lim {
22 panic("x != lim returned true")
28 if x > lim {
31 panic("x > lim returned false")
36 if x >= lim {
39 panic("x >= lim returned false")
44 if x < lim {
[all...] |
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| issue18808.go | 9 const lim = 0x80000000 const
13 if x == lim {
16 panic("x == lim returned false")
21 if x != lim {
22 panic("x != lim returned true")
28 if x > lim {
31 panic("x > lim returned false")
36 if x >= lim {
39 panic("x >= lim returned false")
44 if x < lim {
[all...] |
| /external/mdnsresponder/mDNSShared/ |
| dnssd_ipc.c | 120 char *lim = buffer + buflen; // Calculate limit local
121 while (*ptr < end && buffer < lim)
126 if (buffer == lim) buffer--;
|
| /system/media/audio_utils/tests/ |
| string_tests.cpp | 36 size_t lim = std::min(actual, size); local
39 if (lim > 0) {
40 for (; i < lim - 1; ++i) {
|
| /external/libvpx/libvpx/vp8/common/ |
| loopfilter.h | 44 lim[MAX_LOOP_FILTER + 1][SIMD_WIDTH]);
54 const unsigned char *lim; member in struct:loop_filter_info
|
| /libcore/ojluni/src/main/java/java/security/ |
| MessageDigestSpi.java | 113 int lim = input.limit(); local
114 engineUpdate(b, ofs + pos, lim - pos);
115 input.position(lim);
|
| SignatureSpi.java | 151 int lim = input.limit(); local
152 engineUpdate(b, ofs + pos, lim - pos);
153 input.position(lim);
|
| /libcore/ojluni/src/main/java/javax/crypto/ |
| MacSpi.java | 109 int lim = input.limit(); local
110 engineUpdate(b, ofs + pos, lim - pos);
111 input.position(lim);
|
| /external/iproute2/tc/ |
| q_tbf.c | 205 double lim = rate64*(double)latency/TIME_UNITS_PER_SEC + buffer; local
210 if (lim2 < lim)
211 lim = lim2;
213 opt.limit = lim;
|
| /external/linux-kselftest/tools/testing/selftests/vm/ |
| compaction_test.c | 158 struct rlimit lim; local
173 lim.rlim_cur = RLIM_INFINITY;
174 lim.rlim_max = RLIM_INFINITY;
175 if (setrlimit(RLIMIT_MEMLOCK, &lim)) {
|
| /external/ltp/android/include/ |
| bionic-compat.h | 46 struct rlimit lim; local
47 int err = getrlimit(RLIMIT_NOFILE, &lim);
51 return lim.rlim_cur;
|
| /external/ltp/testcases/kernel/mem/hugetlb/hugemmap/ |
| hugemmap06.c | 74 int i, lim, a, b, c; local
77 lim = rand() % 10;
78 for (i = 0; i < lim; i++) {
|
| /external/ltp/testcases/kernel/mem/tunable/ |
| overcommit_memory.c | 99 struct rlimit lim; local
123 SAFE_GETRLIMIT(RLIMIT_AS, &lim);
125 if (lim.rlim_cur != RLIM_INFINITY) {
126 lim.rlim_cur = RLIM_INFINITY;
127 lim.rlim_max = RLIM_INFINITY;
131 SAFE_SETRLIMIT(RLIMIT_AS, &lim);
|
| /external/protobuf/java/core/src/test/java/com/google/protobuf/ |
| IsValidUtf8TestUtil.java | 160 final long lim; field in class:IsValidUtf8TestUtil.Shard
164 public Shard(long index, long start, long lim, long expected) {
165 assertTrue(start < lim);
168 this.lim = lim;
213 long LIM = 1L << 32;
214 long increment = LIM / numShards;
215 assertTrue(LIM % numShards == 0);
243 * @param lim the limit of bytes to process encoded as a long as big-endian,
247 ByteStringFactory factory, int numBytes, long expectedCount, long start, long lim) {
[all...] |
| /external/webrtc/webrtc/modules/audio_coding/test/ |
| utility.cc | 203 uint32_t lim; local
205 lim = _buffLen;
207 lim = _idx;
210 for (uint32_t n = 0; n < lim; n++) {
221 uint32_t lim; local
223 lim = _buffLen;
225 lim = _idx;
228 for (uint32_t n = 0; n < lim; n++) {
|
| /libcore/ojluni/src/main/java/java/nio/ |
| ByteBufferAsDoubleBuffer.java | 38 int mark, int pos, int lim, int cap,
40 super(mark, pos, lim, cap);
60 int lim = this.limit(); local
61 assert (pos <= lim);
62 int rem = (pos <= lim ? lim - pos : 0);
136 int lim = limit(); local
137 assert (pos <= lim);
138 int rem = (pos <= lim ? lim - pos : 0)
[all...] |
| ByteBufferAsFloatBuffer.java | 37 int mark, int pos, int lim, int cap,
39 super(mark, pos, lim, cap);
59 int lim = this.limit(); local
60 assert (pos <= lim);
61 int rem = (pos <= lim ? lim - pos : 0);
135 int lim = limit(); local
136 assert (pos <= lim);
137 int rem = (pos <= lim ? lim - pos : 0)
[all...] |
| ByteBufferAsIntBuffer.java | 37 int mark, int pos, int lim, int cap,
39 super(mark, pos, lim, cap);
59 int lim = this.limit(); local
60 assert (pos <= lim);
61 int rem = (pos <= lim ? lim - pos : 0);
135 int lim = limit(); local
136 assert (pos <= lim);
137 int rem = (pos <= lim ? lim - pos : 0)
[all...] |
