| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
| test_pytree.py | 144 n3 = pytree.Node(1001, ())
145 self.assertNotEqual(n1, n3)
154 n3 = pytree.Node(1000, [l3])
155 self.assertNotEqual(n1, n3)
186 n3 = pytree.Node(1000, [l3])
187 n1 = pytree.Node(1000, [n2, n3])
195 n3 = pytree.Node(1000, [])
196 n1 = pytree.Node(1000, [n2, n3])
199 self.assertEqual(n3.depth(), 1)
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_deadlock_detector_test.cc | 97 // Cycle: n1->n2->n3->n1
103 uptr n3 = d.newNode(3); local
111 EXPECT_FALSE(d.onLock(&dtls, n3));
112 d.onUnlock(&dtls, n3);
115 EXPECT_FALSE(d.onLock(&dtls, n3));
121 EXPECT_EQ(path[2], n3);
124 EXPECT_EQ(d.getData(n3), 3U);
126 d.onUnlock(&dtls, n3);
|
| /external/chromium_org/testing/gtest/test/ |
| gtest_output_test_.cc | 269 // waits for n3 | generates failure #3
272 // | notifies n3
283 Notification n3; member in struct:CheckPoints
299 check_points->n3.Notify();
316 check_points.n3.WaitForNotification();
|
| gtest_unittest.cc | 2274 const int n3 = 4; local
2297 int n3 = 0; local
2301 n1++, n2++, n3++, n4++, n5++) local
[all...] |
| /external/gtest/test/ |
| gtest_output_test_.cc | 264 // waits for n3 | generates failure #3
267 // | notifies n3
278 Notification n3; member in struct:CheckPoints
294 check_points->n3.Notify();
311 check_points.n3.WaitForNotification();
|
| gtest_unittest.cc | 2281 const int n3 = 4; local
2304 int n3 = 0; local
2308 n1++, n2++, n3++, n4++, n5++) local
[all...] |
| /external/javassist/src/test/test/javassist/convert/ |
| ArrayAccessReplaceTest.java | 409 Number n1, n2, n3, n4; local
422 n3 = ns[3];
426 n3.intValue();
|
| /ndk/sources/third_party/googletest/googletest/test/ |
| gtest_output_test_.cc | 264 // waits for n3 | generates failure #3
267 // | notifies n3
278 Notification n3; member in struct:CheckPoints
294 check_points->n3.Notify();
311 check_points.n3.WaitForNotification();
|
| gtest_unittest.cc | 2290 const int n3 = 4; local
2313 int n3 = 0; local
2317 n1++, n2++, n3++, n4++, n5++) local
[all...] |
| /external/chromium_org/v8/src/compiler/ |
| raw-machine-assembler.h | 396 Node* Phi(MachineType type, Node* n1, Node* n2, Node* n3) {
397 return NewNode(common()->Phi(type, 3), n1, n2, n3);
399 Node* Phi(MachineType type, Node* n1, Node* n2, Node* n3, Node* n4) {
400 return NewNode(common()->Phi(type, 4), n1, n2, n3, n4);
|
| /external/valgrind/main/callgrind/ |
| events.c | 90 const HChar* n2, const HChar* n3)
95 eg->name[2] = n3;
101 const HChar* n2, const HChar* n3,
107 eg->name[2] = n3;
|
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/ |
| SHA1PRNG_SecureRandomTest.java | 162 int n3 = 100; local
173 for (int k = 0; k < n3; k++) {
|
| /libcore/luni/src/test/java/org/apache/harmony/security/tests/provider/crypto/ |
| SHA1PRNG_SecureRandomTest.java | 154 int n3 = 100; local
165 for (int k = 0; k < n3; k++) {
|
| /bionic/libc/upstream-openbsd/lib/libc/stdio/ |
| vfwprintf.c | 283 int n, n2, n3; /* handy integers (short term usage) */ local
351 * BEWARE, these `goto error' on error, PRINT uses 'n3',
352 * PAD uses `n' and 'n3', and PRINTANDPAD uses 'n', 'n2', and 'n3'.
355 for (n3 = 0; n3 < (len); n3++) { \
356 if ((__xfputwc((ptr)[n3], fp)) == WEOF) \
[all...] |
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| svccoll.cpp | 345 int32_t n1, n2, n3; local
463 n3 = checkAvailable("after unregister");
464 assertTrue("count after unregister == count before register", n3 == n1);
|
| /external/icu/icu4c/source/test/intltest/ |
| svccoll.cpp | 345 int32_t n1, n2, n3; local
465 n3 = checkAvailable("after unregister");
466 assertTrue("count after unregister == count before register", n3 == n1);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_ast.py | 313 n3 = ast.Num(3)
315 x = ast.BinOp(n1, addop, n3)
318 self.assertEqual(x.right, n3)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_ast.py | 313 n3 = ast.Num(3)
315 x = ast.BinOp(n1, addop, n3)
318 self.assertEqual(x.right, n3)
|
| /external/tcpdump/ |
| print-rx.c | 668 #define FIDOUT() { unsigned long n1, n2, n3; \
674 n3 = EXTRACT_32BITS(bp); \
676 printf(" fid %d/%d/%d", (int) n1, (int) n2, (int) n3); \
788 #define DESTSERVEROUT() { unsigned long n1, n2, n3; \
794 n3 = EXTRACT_32BITS(bp); \
796 printf(" server %d:%d:%d", (int) n1, (int) n2, (int) n3); \
[all...] |
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/notifications/ |
| NotificationListenerVerifierActivity.java | 133 Notification n3 = new Notification.Builder(mContext) local
143 mNm.notify(mTag3, mId3, n3);
|
| /external/skia/tests/ |
| PDFPrimitivesTest.cpp | 413 SkAutoTUnref<SkPDFName> n3(new SkPDFName("n3"));
415 dict->insert(n3.get(), array.get());
417 "<</n1 42\n/n2 0.5\n/n3 [1 0.5 0]\n>>");
|
| /external/valgrind/main/cachegrind/ |
| cg_main.c | 328 void log_3Ir(InstrInfo* n, InstrInfo* n2, InstrInfo* n3)
332 n3->parent->Ir.a++;
373 void log_3IrNoX_0D_cache_access(InstrInfo* n, InstrInfo* n2, InstrInfo* n3)
380 // n3, n3->instr_addr, n3->instr_len);
387 cachesim_I1_doref_NoX(n3->instr_addr, n3->instr_len,
388 &n3->parent->Ir.m1, &n3->parent->Ir.mL)
[all...] |
| /external/chromium_org/v8/test/cctest/compiler/ |
| test-scheduler.cc | 723 Node* n3 = graph.NewNode(op, n0); local
724 USE(n3);
725 n11->ReplaceInput(1, n3);
734 n8->ReplaceInput(1, n3);
873 Node* n3 = graph.NewNode(op, n0); local
874 USE(n3);
875 n9->ReplaceInput(0, n3);
997 Node* n3 = graph.NewNode(op, n0); local
998 USE(n3);
999 n10->ReplaceInput(0, n3);
1246 Node* n3 = graph.NewNode(op, n0); local
1554 Node* n3 = graph.NewNode(op, n0); local
[all...] |
| /external/valgrind/main/auxprogs/ |
| valgrind-di-server.c | 468 /*OUT*/ULong* n3 )
477 *n3 = read_ULong_le(&fr->data[4 + 2*8]);
483 ULong n1, ULong n2, ULong n3, ULong n_data,
493 write_ULong_le(&f->data[4 + 2*8], n3);
[all...] |
| /external/protobuf/gtest/test/ |
| gtest_unittest.cc | 2558 const int n3 = 4; local
2581 int n3 = 0; local
2585 n1++, n2++, n3++, n4++, n5++) local
[all...] |
