/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/ |
H A D | p5.cpp | 5 alignas(1) alignas(2) alignas(4) int n3; // ok variable
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
H A D | p3-0x.cpp | 45 int n3 = g(i); // expected-error{{no matching function for call to 'g'}} member in namespace:std_example
|
/external/v8/test/cctest/compiler/ |
H A D | test-node.cc | 123 Node* n3 = graph.NewNode(&dummy_operator, n2); local 128 USE(n3); 137 Node* n3 = graph.NewNode(&dummy_operator); local 142 n0->ReplaceUses(n3); 143 Node::Uses::iterator i2(n3->uses().begin()); 148 CHECK_EQ(n3, *i3); 152 CHECK_EQ(n3, *i4); 162 Node* n3 = graph.NewNode(&dummy_operator); local 169 n1->ReplaceUses(n3); 173 Node::Uses::iterator i2(n3 185 Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2); local 245 Node* n3 = graph.NewNode(&dummy_operator, n0); local 265 Node* n3 = graph.NewNode(&dummy_operator); local 292 Node* n3 = graph.NewNode(&dummy_operator, n0); local 304 Node* n3 = graph.NewNode(&dummy_operator, n0, n1, n2); local 379 Node* n3 = graph.NewNode(&dummy_operator); local 423 Node* n3 = graph.NewNode(&dummy_operator, n0); local 446 Node* n3 = graph.NewNode(&dummy_operator); local 482 Node* n3 = graph.NewNode(&dummy_operator); local 512 n1->ReplaceUsesIf(FixedPredicate<false>(), n3); local 550 Node* n3 = graph.NewNode(&dummy_operator, n0); local [all...] |
H A D | test-node-algorithm.cc | 59 Node* n3 = graph.NewNode(&dummy_operator, n2); local 60 Node* n4 = graph.NewNode(&dummy_operator, n2, n3); 70 CHECK(n3->id() == node_visitor.nodes_[2]->id()); 79 Node* n3 = graph.NewNode(&dummy_operator, n2); local 80 Node* n4 = graph.NewNode(&dummy_operator, n2, n3); 91 CHECK(n3->id() == node_visitor.nodes_[4]->id()); 98 Node* n3 = graph.NewNode(&dummy_operator, graph.start()); local 102 Node* n7 = graph.NewNode(&dummy_operator, n3); 117 CHECK(n3->id() == node_visitor.nodes_[6]->id()); 125 Node* n3 local 221 Node* n3 = graph.NewNode(&dummy_operator, n2); local 315 Node* n3 = graph.NewNode(&dummy_operator, graph.start()); local [all...] |
H A D | test-graph-reducer.cc | 219 Node* n3 = graph.NewNode(&OPA1, n1); local 220 Node* end = graph.NewNode(&OPA2, n2, n3); 229 recorder.CheckContains(n3); 262 Node* n3 = graph.NewNode(&OPA1, n1); local 263 Node* end = graph.NewNode(&OPA2, n2, n3); 278 CHECK_EQ(&OPB1, n3->op()); 279 CHECK_EQ(n1, n3->InputAt(0)); 282 CHECK_EQ(n3, end->InputAt(1)); 292 Node* n3 = graph.NewNode(&OPA1, n1); local 293 Node* end = graph.NewNode(&OPA2, n2, n3); 402 Node* n3 = graph.NewNode(&OPA1, n1); local 457 Node* n3 = graph.NewNode(&OPA1, n1); local 492 Node* n3 = graph.NewNode(&OPA1, n1); local [all...] |
/external/clang/test/Modules/ |
H A D | macros2.c | 77 int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
|
H A D | macros.c | 170 int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
|
/external/v8/src/compiler/ |
H A D | graph.h | 39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument 40 Node* nodes[] = {n1, n2, n3}; 43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument 44 Node* nodes[] = {n1, n2, n3, n4}; 47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 49 Node* nodes[] = {n1, n2, n3, n4, n5}; 52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 54 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
|
H A D | graph-builder.h | 38 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument 39 Node* buffer[] = {n1, n2, n3}; 43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument 44 Node* buffer[] = {n1, n2, n3, n4}; 48 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 50 Node* buffer[] = {n1, n2, n3, n4, n5}; 54 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument 56 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
|
/external/libunwind/tests/ |
H A D | Gia64-test-stack.c | 58 unw_word_t ip, sp, bsp, v0, v1, v2, v3, n0, n1, n2, n3, cfm, sof, sol, r32; local 83 n0 = n1 = n2 = n3 = 0; 92 || (ret = unw_get_reg (&c, UNW_IA64_NAT + reg + 3, &n3)) < 0); 99 n2 ? '*' : ' ', v2, n3 ? '*' : ' ', v3);
|
/external/compiler-rt/lib/sanitizer_common/tests/ |
H A D | 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/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | InsnFormat.java | 543 * @param n3 {@code 0..15;} high nibble 546 protected static short codeUnit(int n0, int n1, int n2, int n3) { argument 559 if ((n3 & 0xf) != n3) { 560 throw new IllegalArgumentException("n3 out of range 0..15"); 563 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
|
/external/libvpx/libvpx/vp9/common/mips/dspr2/ |
H A D | vp9_convolve8_avg_horiz_dspr2.c | 36 uint32_t n1, n2, n3, n4; local 90 "preceu.ph.qbr %[n3], %[tn2] \n\t" 94 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t" 108 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t" 130 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
|
H A D | vp9_convolve8_horiz_dspr2.c | 36 uint32_t n1, n2, n3, n4; local 87 "preceu.ph.qbr %[n3], %[tn2] \n\t" 91 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t" 101 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t" 119 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
|
/external/boringssl/src/crypto/ec/ |
H A D | simple.c | 616 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local 644 n3 = BN_CTX_get(ctx); 678 /* n3, n4 */ 680 if (!BN_copy(n3, &b->X) || !BN_copy(n4, &b->Y)) { 683 /* n3 = X_b */ 687 !field_mul(group, n3, &b->X, n0, ctx)) { 690 /* n3 = X_b * Z_a^2 */ 700 if (!BN_mod_sub_quick(n5, n1, n3, p) || 704 /* n5 = n1 - n3 */ 724 if (!BN_mod_add_quick(n1, n1, n3, 807 BIGNUM *n0, *n1, *n2, *n3; local [all...] |
/external/google-breakpad/src/testing/gtest/test/ |
H A D | gtest_output_test_.cc | 252 // waits for n3 | generates failure #3 255 // | notifies n3 266 Notification n3; member in struct:CheckPoints 282 check_points->n3.Notify(); 299 check_points.n3.WaitForNotification();
|
/external/gtest/test/ |
H A D | 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();
|
/external/libvpx/libvpx/vp8/common/mips/dspr2/ |
H A D | filter_dspr2.c | 133 unsigned int n1, n2, n3; local 197 "preceu.ph.qbr %[n3], %[tn2] \n\t" 201 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t" 208 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t" 227 [n3] "=&r" (n3), [Temp1] "=&r" (Temp1), [Temp2] "=&r" (Temp2), 273 "preceu.ph.qbr %[n3], %[tn1] \n\t" 282 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t" 297 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), 329 unsigned int n1, n2, n3, n4; local 629 unsigned int n1, n2, n3, n4; local 961 unsigned int n1, n2, n3; local [all...] |
/external/speex/libspeex/ |
H A D | lsp.c | 532 float *pw,*n1,*n2,*n3,*n4=NULL; local 564 n3 = n2 + 1; 565 n4 = n3 + 1; 567 xout2 = xin2 - 2.f*x_freq[i2+1] * *n3 + *n4; 569 *n4 = *n3; 571 *n3 = xin2;
|
/external/valgrind/callgrind/ |
H A D | 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; 89 register_event_group3(int id, const HChar* n1, const HChar* n2, const HChar* n3) argument 100 register_event_group4(int id, const HChar* n1, const HChar* n2, const HChar* n3, const HChar* n4) argument
|
/external/icu/icu4c/source/test/intltest/ |
H A D | svccoll.cpp | 346 int32_t n1, n2, n3; local 467 n3 = checkAvailable("after unregister"); 468 assertTrue("count after unregister == count before register", n3 == n1);
|
/external/mesa3d/src/mesa/program/ |
H A D | prog_noise.c | 327 float n0, n1, n2, n3; /* Noise contributions from the four corners */ local 461 n3 = 0.0f; 464 n3 = 472 return 32.0f * (n0 + n1 + n2 + n3); /* TODO: The scale factor is preliminary! */ 484 float n0, n1, n2, n3, n4; /* Noise contributions from the five corners */ local 616 n3 = 0.0f; 619 n3 = 637 return 27.0f * (n0 + n1 + n2 + n3 + n4); /* TODO: The scale factor is preliminary! */
|
/external/opencv/cv/src/ |
H A D | cvcontourtree.cpp | 52 CvPoint t3, int n3, double *s, double *s_c, 596 CvPoint t3, int n3, double *s, double *s_c, 621 *s_c = cvContourArea( contour, cvSlice(n1, n3+1)); 595 icvCalcTriAttr( const CvSeq * contour, CvPoint t2, CvPoint t1, int n1, CvPoint t3, int n3, double *s, double *s_c, double *h, double *a, double *b ) argument
|
/external/protobuf/gtest/test/ |
H A D | gtest_output_test_.cc | 238 // waits for n3 | generates failure #3 241 // | notifies n3 252 Notification n3; member in struct:CheckPoints 268 check_points->n3.Notify(); 285 check_points.n3.WaitForNotification();
|
/external/clang/test/CXX/expr/expr.const/ |
H A D | p2-0x.cpp | 232 constexpr int n3 = n1 + 1; // ok member in namespace:UndefinedBehavior::Overflow 233 constexpr int n4 = n3 + 1; // expected-error {{constant expression}} expected-note {{value 2147483648 is outside the range of }} 236 constexpr int n7 = -n3 + -1; // ok 238 constexpr int n9 = n3 - 0; // ok 239 constexpr int n10 = n3 - -1; // expected-error {{constant expression}} expected-note {{value 2147483648 is outside the range of }} 240 constexpr int n11 = -1 - n3; // ok 241 constexpr int n12 = -2 - n3; // expected-error {{constant expression}} expected-note {{value -2147483649 is outside the range of }} 243 constexpr int n14 = n3 - n5; // expected-error {{constant expression}} expected-note {{value 4294967295 is outside the range of }}
|