/bionic/libc/stdlib/ |
bsearch.c | 36 * divide the work in half by moving either left or right. If lim 37 * is odd, moving left simply involves halving lim: e.g., when lim 38 * is 5 we look at item 2, so we change lim to 2 so that we will 39 * look at items 0 & 1. If lim is even, the same applies. If lim 40 * is odd, moving right again involes halving lim, this time moving 41 * the base up one item past p: e.g., when lim is 5 we change base 42 * to item 3 and make lim 2 so that we will look at items 3 and 4. 43 * If lim is even, however, we have to shrink it by one befor 53 int lim, cmp; local [all...] |
/external/stlport/test/unit/ |
limits_test.cpp | 71 typedef numeric_limits<_Tp> lim; typedef 73 CHECK_COND(lim::is_specialized); 74 CHECK_COND(lim::is_exact); 75 CHECK_COND(lim::is_integer); 76 CHECK_COND(!lim::is_iec559); 77 CHECK_COND(lim::min() < lim::max()); 78 CHECK_COND((unknown_sign && ((lim::is_signed && (lim::min() != 0)) || (!lim::is_signed && (lim::min() == 0)))) | 92 typedef numeric_limits<_Tp> lim; typedef 125 typedef numeric_limits<_Tp> lim; typedef 234 typedef numeric_limits<_Tp> lim; typedef [all...] |
/ndk/tests/device/test-gnustl-full/unit/ |
limits_test.cpp | 71 typedef numeric_limits<_Tp> lim; typedef 73 CHECK_COND(lim::is_specialized); 74 CHECK_COND(lim::is_exact); 75 CHECK_COND(lim::is_integer); 76 CHECK_COND(!lim::is_iec559); 77 CHECK_COND(lim::min() < lim::max()); 78 CHECK_COND((unknown_sign && ((lim::is_signed && (lim::min() != 0)) || (!lim::is_signed && (lim::min() == 0)))) | 92 typedef numeric_limits<_Tp> lim; typedef 125 typedef numeric_limits<_Tp> lim; typedef 234 typedef numeric_limits<_Tp> lim; typedef [all...] |
/ndk/tests/device/test-stlport/unit/ |
limits_test.cpp | 71 typedef numeric_limits<_Tp> lim; typedef 73 CHECK_COND(lim::is_specialized); 74 CHECK_COND(lim::is_exact); 75 CHECK_COND(lim::is_integer); 76 CHECK_COND(!lim::is_iec559); 77 CHECK_COND(lim::min() < lim::max()); 78 CHECK_COND((unknown_sign && ((lim::is_signed && (lim::min() != 0)) || (!lim::is_signed && (lim::min() == 0)))) | 92 typedef numeric_limits<_Tp> lim; typedef 125 typedef numeric_limits<_Tp> lim; typedef 234 typedef numeric_limits<_Tp> lim; typedef [all...] |
/external/valgrind/main/none/tests/ |
closeall.c | 8 struct rlimit lim; local 11 getrlimit(RLIMIT_NOFILE, &lim); 13 for ( fd = 3; fd < lim.rlim_cur; fd++ )
|
/external/libvpx/vp8/common/arm/ |
loopfilter_arm.c | 44 vp8_mbloop_filter_horizontal_edge_armv6(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 47 vp8_mbloop_filter_horizontal_edge_armv6(u_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 50 vp8_mbloop_filter_horizontal_edge_armv6(v_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 60 vp8_loop_filter_simple_horizontal_edge_armv6(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 68 vp8_mbloop_filter_vertical_edge_armv6(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 71 vp8_mbloop_filter_vertical_edge_armv6(u_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 74 vp8_mbloop_filter_vertical_edge_armv6(v_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 84 vp8_loop_filter_simple_vertical_edge_armv6(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 92 vp8_loop_filter_horizontal_edge_armv6(y_ptr + 4 * y_stride, y_stride, lfi->flim, lfi->lim, lfi->thr, 2); 93 vp8_loop_filter_horizontal_edge_armv6(y_ptr + 8 * y_stride, y_stride, lfi->flim, lfi->lim, lfi->thr, 2) [all...] |
/external/libvpx/vp8/common/x86/ |
loopfilter_x86.c | 48 vp8_mbloop_filter_horizontal_edge_mmx(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 51 vp8_mbloop_filter_horizontal_edge_mmx(u_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 54 vp8_mbloop_filter_horizontal_edge_mmx(v_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 65 vp8_loop_filter_simple_horizontal_edge_mmx(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 74 vp8_mbloop_filter_vertical_edge_mmx(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 77 vp8_mbloop_filter_vertical_edge_mmx(u_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 80 vp8_mbloop_filter_vertical_edge_mmx(v_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 91 vp8_loop_filter_simple_vertical_edge_mmx(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 100 vp8_loop_filter_horizontal_edge_mmx(y_ptr + 4 * y_stride, y_stride, lfi->flim, lfi->lim, lfi->thr, 2); 101 vp8_loop_filter_horizontal_edge_mmx(y_ptr + 8 * y_stride, y_stride, lfi->flim, lfi->lim, lfi->thr, 2) [all...] |
/external/libvpx/vp8/common/ppc/ |
loopfilter_altivec.c | 59 mbloop_filter_horizontal_edge_y_ppc(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr); 62 mbloop_filter_horizontal_edge_uv_ppc(u_ptr, v_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr); 80 mbloop_filter_vertical_edge_y_ppc(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr); 83 mbloop_filter_vertical_edge_uv_ppc(u_ptr, v_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr); 102 loop_filter_horizontal_edge_y_ppc(y_ptr + 4 * y_stride, y_stride, lfi->flim, lfi->lim, lfi->thr); 103 loop_filter_horizontal_edge_y_ppc(y_ptr + 8 * y_stride, y_stride, lfi->flim, lfi->lim, lfi->thr); 104 loop_filter_horizontal_edge_y_ppc(y_ptr + 12 * y_stride, y_stride, lfi->flim, lfi->lim, lfi->thr); 107 loop_filter_horizontal_edge_uv_ppc(u_ptr + 4 * uv_stride, v_ptr + 4 * uv_stride, uv_stride, lfi->flim, lfi->lim, lfi->thr); 127 loop_filter_vertical_edge_y_ppc(y_ptr, y_stride, lfi->flim, lfi->lim, lfi->thr); 130 loop_filter_vertical_edge_uv_ppc(u_ptr + 4, v_ptr + 4, uv_stride, lfi->flim, lfi->lim, lfi->thr) [all...] |
/external/chromium/chrome/browser/extensions/ |
extensions_quota_service_unittest.cc | 115 QuotaLimitHeuristic* lim, 121 EXPECT_TRUE(lim->Apply(b, start_time + TimeDelta::FromSeconds(10 + m))); 127 EXPECT_TRUE(lim->Apply(b, start_time + TimeDelta::FromSeconds(15 + m))); 131 EXPECT_TRUE(lim->Apply(b, start_time + TimeDelta::FromSeconds(20 + m))); 133 EXPECT_TRUE(lim->Apply(b, start_time + TimeDelta::FromSeconds(50 + m))); 140 TimedLimit lim(k2PerMinute, new MockMapper()); 144 EXPECT_TRUE(lim.Apply(&b, kStartTime)); 146 EXPECT_TRUE(lim.Apply(&b, kStartTime + TimeDelta::FromSeconds(30))); 148 EXPECT_FALSE(lim.Apply(&b, k1MinuteAfterStart)); 151 EXPECT_TRUE(lim.Apply(&b, k1MinuteAfterStart - TimeDelta::FromSeconds(1))) [all...] |
/external/expat/xmlwf/ |
codepage.c | 24 int j, lim; local 27 lim = info.LeadByte[i + 1]; 28 for (j = info.LeadByte[i]; j <= lim; j++)
|
/external/libvpx/vp8/common/ |
loopfilter.c | 31 vp8_mbloop_filter_horizontal_edge_c(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 34 vp8_mbloop_filter_horizontal_edge_c(u_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 37 vp8_mbloop_filter_horizontal_edge_c(v_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 47 vp8_loop_filter_simple_horizontal_edge_c(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 55 vp8_mbloop_filter_vertical_edge_c(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 58 vp8_mbloop_filter_vertical_edge_c(u_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 61 vp8_mbloop_filter_vertical_edge_c(v_ptr, uv_stride, lfi->mbflim, lfi->lim, lfi->thr, 1); 71 vp8_loop_filter_simple_vertical_edge_c(y_ptr, y_stride, lfi->mbflim, lfi->lim, lfi->thr, 2); 79 vp8_loop_filter_horizontal_edge_c(y_ptr + 4 * y_stride, y_stride, lfi->flim, lfi->lim, lfi->thr, 2); 80 vp8_loop_filter_horizontal_edge_c(y_ptr + 8 * y_stride, y_stride, lfi->flim, lfi->lim, lfi->thr, 2) [all...] |
loopfilter.h | 31 DECLARE_ALIGNED(16, signed char, lim[16]);
|
/external/strace/ |
resource.c | 117 sprintrlim(lim) 118 long lim; 122 if (lim == RLIM_INFINITY) 124 else if (lim > 1024 && lim%1024 == 0) 125 sprintf(buf, "%ld*1024", lim/1024); 127 sprintf(buf, "%ld", lim); 179 sprintrlim64(lim) 180 rlim64_t lim; 184 if (lim == RLIM64_INFINITY [all...] |
/bootable/recovery/minzip/ |
Hash.h | 154 int lim = pIter->pHashTable->tableSize; local 155 for ( ; i < lim; i++) {
|
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_2/String/ |
split-002.js | 146 lim = Math.pow(2, 31 ) -1; 148 lim = ToUint32( limit ); 164 if (lim == 0) return A; // 7 196 if (A.length == lim) return A; // 18 206 if (A.length == lim) return A; // 24
|
/dalvik/vm/ |
Hash.h | 189 int lim = pIter->pHashTable->tableSize; local 190 for ( ; i < lim; i++) {
|
Init.cpp | 901 int lim = atoi(argv[i] + 15); local 902 if (lim < 200 || (lim % 100) != 0) { 907 gDvm.jniGrefLimit = lim; [all...] |
/external/iproute2/tc/ |
q_tbf.c | 181 double lim = opt.rate.rate*(double)latency/TIME_UNITS_PER_SEC + buffer; local 184 if (lim2 < lim) 185 lim = lim2; 187 opt.limit = lim;
|
/external/dropbear/ |
dbutil.c | 698 struct rlimit lim; local 699 lim.rlim_cur = lim.rlim_max = 0; 700 setrlimit(RLIMIT_CORE, &lim);
|
/external/ipsec-tools/src/libipsec/ |
pfkey.c | [all...] |
/external/bison/src/ |
scan-gram.l | 747 char const *lim = token + size; 751 for (p = token; p < lim; p++) 796 char const *lim = buf + bytes_read; 803 if (r == lim) 815 if (r == lim) [all...] |
scan-gram.c | 3401 char const *lim = token + size; local 3450 char const *lim = buf + bytes_read; local [all...] |