| /frameworks/compile/libbcc/tests/debuginfo/host-tests/ |
| pass-struct.c | 12 // CHECK: $1 = {n = 10, n2 = {20, 21}}
17 int n2[2]; member in struct:int_struct
23 s.n2[1]++;
24 return s.n > s.n2[0] ? s.n : s.n2[0];
32 s.n2[0] = 20;
33 s.n2[1] = 21;
|
| /external/strace/tests/ |
| sigaction.awk | 30 n2[1] = "SIG_IGN, \\[HUP INT\\], SA_RESTART"
33 n2[2] = "0x[0-9a-f]+, \\[QUIT TERM\\], SA_SIGINFO"
36 n2[3] = "SIG_DFL, \\[\\], 0"
39 n2[4] = "SIG_DFL, ~\\[HUP( ((RT|SIGRT)[^] ]+|[3-9][0-9]|1[0-9][0-9]))*\\], 0"
45 o2[i] = n2[i - 1]
55 "\\{" n2[i] "\\}, \\{" o2[i] "\\}, " a2 "|" \
56 "\\{" n2[i] "\\}, \\{" o2[i] "\\}, " a3 ")\\) = 0$"
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| lexcmp_test.cpp | 35 char n2[size] = "shine"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
44 char n2[size] = "shine"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| mismatch_test.cpp | 41 int n2[5] = { 1, 2, 3, 4, 5 }; local
44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
72 char const* n2[size]; local
73 copy(n1, n1 + 5, (char const**)n2);
74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
78 n2[2] = "QED";
79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size))
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| lexcmp_test.cpp | 35 char n2[size] = "shine"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
44 char n2[size] = "shine"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| mismatch_test.cpp | 41 int n2[5] = { 1, 2, 3, 4, 5 }; local
44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
72 char const* n2[size]; local
73 copy(n1, n1 + 5, (char const**)n2);
74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
78 n2[2] = "QED";
79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size))
[all...] |
| /external/opencv3/modules/photo/src/ |
| arrays.hpp | 54 int n1,n2; member in struct:cv::Array2d
58 a(array2d.a), n1(array2d.n1), n2(array2d.n2), needToDeallocArray(false)
67 a(_a), n1(_n1), n2(_n2), needToDeallocArray(false)
72 n1(_n1), n2(_n2), needToDeallocArray(true)
74 a = new T[n1*n2];
85 return a + i*n2;
98 int n1,n2,n3; member in struct:cv::Array3d
102 a(_a), n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(false)
107 n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(true
134 int n1,n2,n3,n4; member in struct:cv::Array4d
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-node.cc | 148 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
151 CHECK_USES(n0, n1, n2);
154 CHECK_INPUTS(n2, n0);
160 CHECK_USES(n2, NONE);
161 CHECK_USES(n3, n1, n2);
164 CHECK_INPUTS(n2, n3);
182 Node* n2 = graph.NewNode(&dummy_operator0); local
184 n1->ReplaceUses(n2);
188 CHECK_USES(n2, n1);
197 Node* n2 = graph.NewNode(&dummy_operator0) local
229 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
245 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
278 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
296 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
324 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
354 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
376 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
403 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
426 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
454 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
489 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
499 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
509 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
518 Node* n2 = graph.NewNode(&dummy_operator2, n0, n0); local
526 Node* n2 = graph.NewNode(&dummy_operator2, n0, n0); local
563 Node* n2 = graph.NewNode(&dummy_operator0); local
577 Node* n2 = graph.NewNode(&dummy_operator0); local
591 Node* n2 = graph.NewNode(&dummy_operator0); local
604 Node* n2 = graph.NewNode(&dummy_operator0); local
616 Node* n2 = graph.NewNode(&dummy_operator0); local
635 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
648 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
661 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
673 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
685 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
704 Node* n2; local
[all...] |
| /external/libutf/ |
| utfutf.c | 29 long f, n1, n2; local
37 n2 = strlen(s2);
39 if(strncmp(p, s2, n2) == 0)
|
| /external/libcxx/test/std/localization/locales/locale/locale.operators/ |
| eq.pass.cpp | 24 std::locale n2(LOCALE_en_US_UTF_8);
32 assert(cloc != n2);
40 assert(copy != n2);
48 assert(n1 == n2);
53 assert(n2 != cloc);
54 assert(n2 != copy);
55 assert(n2 == n1);
56 assert(n2 == n2);
57 assert(n2 != noname1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locales/locale/locale.operators/ |
| eq.pass.cpp | 24 std::locale n2(LOCALE_en_US_UTF_8);
32 assert(cloc != n2);
40 assert(copy != n2);
48 assert(n1 == n2);
53 assert(n2 != cloc);
54 assert(n2 != copy);
55 assert(n2 == n1);
56 assert(n2 == n2);
57 assert(n2 != noname1)
[all...] |
| /external/testng/src/test/java/test/tmp/ |
| Test_TestListenerAppender.java | 15 public void verifyData1(String n1, Integer n2) {
16 System.out.println(n1 + " " + n2);
|
| /ndk/sources/android/support/src/musl-multibyte/ |
| mbsnrtowcs.c | 11 size_t l, cnt=0, n2; local
22 while ( s && wn && ( (n2=n/4)>=wn || n2>32 ) ) {
23 if (n2>=wn) n2=wn;
24 n -= n2;
25 l = mbsrtowcs(ws, &s, n2, st);
|
| wcsnrtombs.c | 11 size_t l, cnt=0, n2; local
18 while ( ws && n && ( (n2=wn)>=n || n2>32 ) ) {
19 if (n2>=n) n2=n;
20 wn -= n2;
21 l = wcsrtombs(s, &ws, n2, 0);
|
| /external/clang/test/SemaCXX/ |
| pr18284-crash-on-invalid.cpp | 15 namespace n2 { namespace
24 } // namespace n2
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| SystemTest.java | 42 long n2 = System.nanoTime(); local
46 long nanos = n2 - n1;
64 long n2 = System.nanoTime(); local
66 long nanos = n2 - n1;
|
| /external/selinux/libsepol/src/ |
| ebitmap.c | 20 ebitmap_node_t *n1, *n2, *new, *prev; local
25 n2 = e2->node;
27 while (n1 || n2) {
34 if (n1 && n2 && n1->startbit == n2->startbit) {
36 new->map = n1->map | n2->map;
38 n2 = n2->next;
39 } else if (!n2 || (n1 && n1->startbit < n2->startbit))
152 ebitmap_node_t *n1, *n2; local
202 ebitmap_node_t *n1, *n2; local
230 ebitmap_node_t *n2 = e2->node; local
[all...] |
| /external/chromium-trace/catapult/telemetry/telemetry/util/ |
| color_histogram.py | 28 n2 = sum_func(hist2)
29 if (n1 == 0 or n2 == 0) and default_color is None:
34 if n2 == 0:
36 n2 = 1
39 remainder = np.multiply(hist1, n2) - np.multiply(hist2, n1)
46 remainder += value1 * n2 - value2 * n1
51 return abs(float(total) / n1 / n2)
|
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/audio/wavelib/ |
| DspFftServer.java | 53 int ii, jj, kk, n1, n2, aa; local
58 n2 = mN / 2;
60 n1 = n2;
79 n2 = 1;
81 n1 = n2;
82 n2 = n2 + n2;
89 for (kk = jj; kk < mN; kk = kk + n2) {
|
| /external/webrtc/webrtc/system_wrappers/include/ |
| ntp_time.h | 55 inline bool operator==(const NtpTime& n1, const NtpTime& n2) {
56 return n1.seconds() == n2.seconds() && n1.fractions() == n2.fractions();
58 inline bool operator!=(const NtpTime& n1, const NtpTime& n2) {
59 return !(n1 == n2);
|
| /external/boringssl/src/crypto/bn/ |
| mul.c | 305 /* r is 2*n2 words in size,
306 * a and b are both n2 words in size.
307 * n2 must be a power of 2.
309 * t must be 2*n2 words in size
315 /* dnX may not be positive, but n2/2+dnX has to be */
316 static void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
318 int n = n2 / 2, c1, c2;
323 /* Only call bn_mul_comba 8 if n2 == 8 and the
326 if (n2 == 8 && dna == 0 && dnb == 0) {
332 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL)
450 int i, j, n2 = n * 2; local
[all...] |
| /external/icu/icu4c/source/common/ |
| unorm.cpp | 49 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
50 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
57 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
59 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
64 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
72 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
73 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
80 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
82 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
87 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode)
99 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
180 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
264 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
[all...] |
| /external/bzip2/ |
| bzmore | 16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
|
| /external/elfutils/libelf/ |
| elf32_fsize.c | 67 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
|
| /art/test/963-default-range-smali/src/ |
| Iface.java | 18 String n2,
|
