| /external/clang/test/Sema/ |
| atomic-requires-library-error.c | 5 int big[128]; member in struct:foo
|
| /external/valgrind/main/memcheck/tests/ |
| big_blocks_freed_list.c | 2 /* To be run with --freelist-vol=1000000 --freelist-big-blocks=50000 */
10 char *big = NULL; local
16 /* Verify that access via a dangling pointer to a big block bigger than
19 big = malloc (1000001);
21 free(big);
22 if (big[1000] > 0x0) jumped();
26 by doing big alloc/free. */
31 but not for the big block, which has been removed from the free list
33 if (big[2000] > 0x0) jumped();
36 big = NULL
[all...] |
| sbfragment.c | 39 char *big = NULL; local
43 unsigned long bigsize = 8; // current size of the (reallocated) big block.
57 big = malloc (bigsize);
58 if (big == NULL)
62 printf("big 0x%p\n", big);
71 free (big);
72 big = newbig;
74 printf("big 0x%p\n", big);
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/meta/meta.trans/meta.trans.sign/ |
| make_signed.pass.cpp | 21 big = 0xFFFFFFFFFFFFFFFFULL enumerator in enum:BigEnum
|
| make_unsigned.pass.cpp | 21 big = 0xFFFFFFFFFFFFFFFFULL enumerator in enum:BigEnum
|
| /external/chromium_org/base/profiler/ |
| tracked_time_unittest.cc | 25 // Now create a big time, to check that it is wrapped modulo 2^32.
26 base::TimeTicks big = base::TimeTicks() + local
28 EXPECT_EQ(kReallyBigMilliseconds, (big - base::TimeTicks()).InMilliseconds());
30 TrackedTime wrapped_big(big);
|
| /external/chromium_org/v8/test/cctest/ |
| test-bignum.cc | 84 uint64_t big = V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF); local
85 bignum.AssignUInt64(big);
89 big = V8_2PART_UINT64_C(0x12345678, 9ABCDEF0);
90 bignum.AssignUInt64(big);
[all...] |
| /external/llvm/unittests/Support/ |
| EndianTest.cpp | 27 EXPECT_EQ(BigAsHost, (endian::read<int32_t, big, unaligned>(bigval)));
31 EXPECT_EQ((endian::read<int32_t, big, unaligned>(bigval + 1)),
37 endian::write<int32_t, big, unaligned>(data, -1362446643);
42 endian::write<int32_t, big, unaligned>(data + 1, -1362446643);
62 unsigned char big[] = {0x00, 0x01, 0x02, 0x03, 0x04}; local
65 reinterpret_cast<big32_t *>(big + 1);
|
| /external/skia/gm/ |
| verylargebitmap.cpp | 64 int big = 60*1024; // 32K < size < 64K variable
71 show_bm(canvas, big, small, SK_ColorBLUE);
|
| /external/v8/test/cctest/ |
| test-bignum.cc | 84 uint64_t big = V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF); local
85 bignum.AssignUInt64(big);
89 big = V8_2PART_UINT64_C(0x12345678, 9ABCDEF0);
90 bignum.AssignUInt64(big);
[all...] |
| /libcore/luni/src/test/java/libcore/java/math/ |
| OldBigDecimalTest.java | 34 BigDecimal big = new BigDecimal(123E04); local
37 big.toString().equals("1230000"));
38 big = new BigDecimal(123.375);
39 assertTrue("init(D) failed for 123.375; became " + big,
40 big.toString().equals("123.375") );
41 big = new BigDecimal(Math.pow(2, -33));
42 assertTrue("init(D) failed for 2^(-33) = 1.16415321826934814453125E-10; became " + big,
43 big.toString().equals("1.16415321826934814453125E-10") );
44 big = new BigDecimal(123456 * Math.pow(2, -33));
45 assertTrue("init(D) failed for 123456 * 2^(-33) = 0.000014372169971466064453125; became " + big,
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| html-string-funcs.js | 34 var simple = { big: 'big', blink: 'blink', bold: 'b',
|
| /external/eigen/bench/btl/libs/blitz/ |
| blitz_LU_solve_interface.hh | 92 real big = 0. ; local
98 big = 0. ;
100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ;
102 if( big==0. ) {
106 ImplicitScaling( i ) = 1./big ;
118 big = 0. ;
124 if( (ImplicitScaling( i )*abs( theSum ))>=big ) {
126 big = dum ;
|
| /external/eigen/bench/btl/libs/gmm/ |
| gmm_LU_solve_interface.hh | 92 real big = 0. ; local
98 big = 0. ;
100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ;
102 if( big==0. ) {
106 ImplicitScaling( i ) = 1./big ;
118 big = 0. ;
124 if( (ImplicitScaling( i )*abs( theSum ))>=big ) {
126 big = dum ;
|
| /external/eigen/bench/btl/libs/mtl4/ |
| mtl4_LU_solve_interface.hh | 92 real big = 0. ; local
98 big = 0. ;
100 if( abs( LU( i, j ) )>=big ) big = abs( LU( i, j ) ) ;
102 if( big==0. ) {
106 ImplicitScaling( i ) = 1./big ;
118 big = 0. ;
124 if( (ImplicitScaling( i )*abs( theSum ))>=big ) {
126 big = dum ;
|
| /external/eigen/test/ |
| stable_norm.cpp | 56 Scalar big = internal::random<Scalar>() * ((std::numeric_limits<RealScalar>::max)() * RealScalar(1e-4)); local
64 vbig.fill(big);
76 VERIFY(!isFinite(internal::sqrt(-internal::abs(big))));
79 VERIFY(isFinite(internal::sqrt(size)*internal::abs(big)));
80 VERIFY_IS_NOT_APPROX(internal::sqrt(copy(vbig.squaredNorm())), internal::abs(internal::sqrt(size)*big)); // here the default norm must fail
81 VERIFY_IS_APPROX(vbig.stableNorm(), internal::sqrt(size)*internal::abs(big));
82 VERIFY_IS_APPROX(vbig.blueNorm(), internal::sqrt(size)*internal::abs(big));
83 VERIFY_IS_APPROX(vbig.hypotNorm(), internal::sqrt(size)*internal::abs(big));
|
| diagonalmatrices.cpp | 67 BigMatrix big; local
68 big.setZero(2*rows, 2*cols);
70 big.block(i,j,rows,cols) = m1;
71 big.block(i,j,rows,cols) = v1.asDiagonal() * big.block(i,j,rows,cols);
73 VERIFY_IS_APPROX((big.block(i,j,rows,cols)) , v1.asDiagonal() * m1 );
75 big.block(i,j,rows,cols) = m1;
76 big.block(i,j,rows,cols) = big.block(i,j,rows,cols) * rv1.asDiagonal();
77 VERIFY_IS_APPROX((big.block(i,j,rows,cols)) , m1 * rv1.asDiagonal() )
[all...] |
| /external/skia/tests/ |
| InfRectTest.cpp | 70 SkScalar big = SkIntToScalar(100); local
74 SkRect rect = SkRect::MakeXYWH(small, small, big, big);
79 check_invalid(reporter, small, small, big, invalid[i]);
80 check_invalid(reporter, small, small, invalid[i], big);
81 check_invalid(reporter, small, invalid[i], big, big);
82 check_invalid(reporter, invalid[i], small, big, big);
|
| /external/v8/test/mjsunit/ |
| html-string-funcs.js | 34 var simple = { big: 'big', blink: 'blink', bold: 'b',
|
| /external/srec/srec/clib/ |
| matrix_i.c | 105 double big, dumm, sum, temp; local
112 big = 0;
114 if ((temp = (double) fabs(mat[ii][jj])) > big) big = temp;
115 if (big <= SIGNIFICANT)
120 vv[ii] = 1 / big;
133 big = 0;
140 if ((dumm = (double)(vv[ii] * fabs(sum))) >= big)
142 big = dumm;
|
| /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| NumberFormatTest.java | 63 java.math.BigInteger big; local
65 big = new java.math.BigInteger(String.valueOf(Long.MAX_VALUE))
67 out = format.format(big, new StringBuffer(), pos);
72 big = new java.math.BigInteger(String.valueOf(Long.MIN_VALUE))
74 out = format.format(big, new StringBuffer(), pos);
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| BitSetTest.java | 190 private static BitSet big() { method in class:BitSetTest
203 BitSet result = big();
207 result.and(big()); method
210 result = big();
214 result.andNot(big()); method
217 assertFalse(big().intersects(small()));
218 assertFalse(small().intersects(big()));
220 result = big();
224 result.or(big()); method
227 result = big();
231 result.xor(big()); method
[all...] |
| /external/guava/guava-tests/test/com/google/common/primitives/ |
| UnsignedLongTest.java | 220 BigInteger big = local
222 equalsTester.addEqualityGroup(UnsignedLong.asUnsigned(a), UnsignedLong.valueOf(big),
223 UnsignedLong.valueOf(big.toString()), UnsignedLong.valueOf(big.toString(16), 16));
|
| /external/chromium_org/base/containers/ |
| small_map.h | 115 typedef struct { char dummy[2]; } big; typedef in struct:base::internal::has_key_equal
119 template <typename U> static big test(typename U::key_equal*);
123 static const bool value = (sizeof(test<M>(0)) == sizeof(big));
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| common.h | 69 // We need to guarantee the smallest class size is big enough to hold the
120 // want this big to avoid locking the central free-list too often. It
121 // should not hurt to make this list somewhat big because the
157 // it too big may temporarily cause unnecessary memory wastage in the
192 const bool big = (s > kMaxSmallSize); local
193 const int add_amount = big ? (127 + (120<<7)) : 7;
194 const int shift_amount = big ? 7 : 3;
236 // it too big may temporarily cause unnecessary memory wastage in the
|
