HomeSort by relevance Sort by last modified time
    Searched defs:small (Results 1 - 25 of 78) sorted by null

1 2 3 4

  /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mmix/
odd-1.s 0 small GREG #abc
3 TRIP 1,$100,small
5 UNSAVE small
7 CMPU small,$4,rC
8 SET small,$2
1 small GREG #abc label
  /prebuilts/go/darwin-x86/test/fixedbugs/
issue8961.go 7 // Issue 8961. Empty composite literals to small globals were not filled in
10 type small struct { a int } type
11 var foo small
15 foo = small{}
  /prebuilts/go/linux-x86/test/fixedbugs/
issue8961.go 7 // Issue 8961. Empty composite literals to small globals were not filled in
10 type small struct { a int } type
11 var foo small
15 foo = small{}
  /external/python/cpython3/Include/
accu.h 11 * of keeping a huge number of small separate objects, and the quadratic
19 #undef small /* defined by some Windows headers */ macro
23 PyObject *small; /* Pending small strings */ member in struct:__anon33111
  /external/clang/test/SemaCXX/
attr-print.cpp 23 // CHECK: int small __attribute__((mode(byte)));
24 int small __attribute__((mode(byte))); variable
builtin-object-size-cxx14.cpp 96 SmallStruct small; local
97 copy5CharsIntoStrict(small.buf); // expected-error{{no matching function for call}}
  /external/valgrind/memcheck/tests/
big_blocks_freed_list.c 11 char *small = NULL; local
25 /* Then verify that dangling pointers for small blocks is not hampered
27 small = malloc (10000);
28 free(small);
32 with the malloc of small above. */
41 if (small[10] > 0x0) jumped();
55 if (small[10] > 0x0) jumped();
  /external/libbrillo/brillo/
any_internal_impl_unittest.cc 77 struct Small {
79 } small = {}; local
80 buffer.Assign(small);
83 EXPECT_STREQ(GetTypeTag<Small>(), buffer.GetDataPtr()->GetTypeTag());
  /external/skia/gm/
bigmatrix.cpp 35 SkScalar small = 1 / (500 * SK_Scalar1); local
38 path.addCircle(pt.fX, pt.fY, small);
43 SkRect rect = {pt.fX - small, pt.fY - small,
44 pt.fX + small, pt.fY + small};
63 rect.setLTRB(pt.fX - small, pt.fY - small,
64 pt.fX + small, pt.fY + small);
    [all...]
  /external/skqp/gm/
bigmatrix.cpp 35 SkScalar small = 1 / (500 * SK_Scalar1); local
38 path.addCircle(pt.fX, pt.fY, small);
43 SkRect rect = {pt.fX - small, pt.fY - small,
44 pt.fX + small, pt.fY + small};
63 rect.setLTRB(pt.fX - small, pt.fY - small,
64 pt.fX + small, pt.fY + small);
    [all...]
  /packages/inputmethods/LatinIME/native/jni/src/utils/
char_utils.cpp 30 unsigned short small; member in struct:latinime::LatinCapitalSmallPair
211 { 0x01C5, 0x01C6 }, // LATIN CAPITAL LETTER D WITH SMALL LETTER Z WITH CARON
213 { 0x01C8, 0x01C9 }, // LATIN CAPITAL LETTER L WITH SMALL LETTER J
215 { 0x01CB, 0x01CC }, // LATIN CAPITAL LETTER N WITH SMALL LETTER J
234 { 0x01F2, 0x01F3 }, // LATIN CAPITAL LETTER D WITH SMALL LETTER Z
278 { 0x024A, 0x024B }, // LATIN CAPITAL LETTER SMALL Q WITH HOOK TAIL
    [all...]
  /prebuilts/go/darwin-x86/src/strconv/
itoa.go 7 const fastSmalls = true // enable fast path for small integers
14 return small(int(i))
25 return small(int(i))
40 return append(dst, small(int(i))...)
50 return append(dst, small(int(i))...)
56 // small returns the string for an i with 0 <= i < nSmalls.
57 func small(i int) string { func
  /prebuilts/go/linux-x86/src/strconv/
itoa.go 7 const fastSmalls = true // enable fast path for small integers
14 return small(int(i))
25 return small(int(i))
40 return append(dst, small(int(i))...)
50 return append(dst, small(int(i))...)
56 // small returns the string for an i with 0 <= i < nSmalls.
57 func small(i int) string { func
  /external/skia/tests/
InfRectTest.cpp 62 SkScalar small = SkIntToScalar(10); local
67 SkRect rect = SkRect::MakeXYWH(small, small, big, big);
72 check_invalid(reporter, small, small, big, invalid[i]);
73 check_invalid(reporter, small, small, invalid[i], big);
74 check_invalid(reporter, small, invalid[i], big, big);
75 check_invalid(reporter, invalid[i], small, big, big);
  /external/skqp/tests/
InfRectTest.cpp 62 SkScalar small = SkIntToScalar(10); local
67 SkRect rect = SkRect::MakeXYWH(small, small, big, big);
72 check_invalid(reporter, small, small, big, invalid[i]);
73 check_invalid(reporter, small, small, invalid[i], big);
74 check_invalid(reporter, small, invalid[i], big, big);
75 check_invalid(reporter, invalid[i], small, big, big);
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/types/
MergeTagTest.java 47 Map<Object, Object> small = (Map<Object, Object>) list.get(3); local
48 assertEquals(1, small.size());
49 assertEquals(new Integer(1), small.get("r"));
  /toolchain/binutils/binutils-2.27/libiberty/
objalloc.c 49 We handle large and small allocation requests differently. If we
64 contains small objects, this is NULL. */
75 hold small objects. */
200 struct objalloc_chunk *p, *small; local
204 and set Q to the last small object chunk we see before P. */
205 small = NULL;
212 small = p;
230 /* The block is in a chunk containing small objects. We can
231 free every chunk through SMALL, because they have certainly
232 been allocated more recently. After SMALL, we will not se
    [all...]
  /bionic/tests/
stdatomic_test.cpp 67 atomic_char small; local
68 ASSERT_TRUE(atomic_is_lock_free(&small));
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
cgitb.py 47 def small(text): function
49 return '<small>' + text + '</small>'
116 indent = '<tt>' + small('&nbsp;' * 5) + '&nbsp;</tt>'
144 num = small('&nbsp;' * (5-len(str(i))) + str(i)) + '&nbsp;'
168 rows.append('<tr><td>%s</td></tr>' % small(grey(', '.join(dump))))
  /external/eigen/bench/
dense_solvers.cpp 103 const int small = 8; local
104 sizes.push_back(Array2i(small,small));
108 sizes.push_back(Array2i(10000,small));
  /external/eigen/test/
stable_norm.cpp 66 Scalar small = factor * ((std::numeric_limits<RealScalar>::min)() * RealScalar(1e4)); local
74 vsmall.fill(small);
95 VERIFY((numext::isfinite)(sqrt(size)*abs(small)));
96 VERIFY_IS_NOT_APPROX(sqrt(copy(vsmall.squaredNorm())), abs(sqrt(size)*small)); // here the default norm must fail
97 VERIFY_IS_APPROX(vsmall.stableNorm(), sqrt(size)*abs(small));
98 VERIFY_IS_APPROX(vsmall.blueNorm(), sqrt(size)*abs(small));
99 VERIFY_IS_APPROX(vsmall.hypotNorm(), sqrt(size)*abs(small));
  /external/icu/icu4c/source/test/cintltst/
sorttest.c 32 uint16_t small[]={ 8, 1, 2, 5, 4, 3, 7, 6 }; local
40 /* sort small array (stable) */
42 uprv_sortArray(small, UPRV_LENGTHOF(small), sizeof(small[0]), uprv_uint16Comparator, NULL, TRUE, &errorCode);
44 log_err("uprv_sortArray(small) failed - %s\n", u_errorName(errorCode));
47 for(i=1; i<UPRV_LENGTHOF(small); ++i) {
48 if(small[i-1]>small[i]) {
49 log_err("uprv_sortArray(small) mis-sorted [%d]=%u > [%d]=%u\n", i-1, small[i-1], i, small[i])
    [all...]
  /external/mesa3d/src/gallium/drivers/virgl/
virgl_screen.c 371 int small = vformat % 32; local
372 if (!(vscreen->caps.caps.v1.vertexbuffer.bitmask[big] & (1 << small)))
454 int small = format % 32; local
455 if (!(vscreen->caps.caps.v1.render.bitmask[big] & (1 << small)))
501 int small = format % 32; local
502 if (!(vscreen->caps.caps.v1.sampler.bitmask[big] & (1 << small)))
  /external/python/cpython2/Lib/
cgitb.py 47 def small(text): function
49 return '<small>' + text + '</small>'
116 indent = '<tt>' + small('&nbsp;' * 5) + '&nbsp;</tt>'
144 num = small('&nbsp;' * (5-len(str(i))) + str(i)) + '&nbsp;'
168 rows.append('<tr><td>%s</td></tr>' % small(grey(', '.join(dump))))
  /external/python/cpython3/Lib/
cgitb.py 46 def small(text): function
48 return '<small>' + text + '</small>'
115 indent = '<tt>' + small('&nbsp;' * 5) + '&nbsp;</tt>'
143 num = small('&nbsp;' * (5-len(str(i))) + str(i)) + '&nbsp;'
167 rows.append('<tr><td>%s</td></tr>' % small(grey(', '.join(dump))))

Completed in 850 milliseconds

1 2 3 4