Searched defs:n3 (Results 1 - 25 of 51) sorted by relevance

123

/external/v8/test/mjsunit/compiler/
H A Dosr-infinite.js33 function n3() { function
74 test(n3);
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
H A Dp5.cpp5 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 Dp3-0x.cpp45 int n3 = g(i); // expected-error{{no matching function for call to 'g'}} member in namespace:std_example
/external/clang/test/Modules/
H A Dmacros2.c80 int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
H A Dmacros.c197 int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
/external/v8/test/cctest/compiler/
H A Dtest-graph-visualizer.cc110 Node* n3 = graph.NewNode(&dummy_operator1, graph.start()); local
113 Node* n6 = graph.NewNode(&dummy_operator1, n3);
114 Node* n7 = graph.NewNode(&dummy_operator1, n3);
H A Dtest-node.cc150 Node* n3 = graph.NewNode(&dummy_operator0); local
157 n0->ReplaceUses(n3);
162 CHECK_USES(n3, n1, n2);
164 CHECK_INPUTS(n1, n3);
165 CHECK_INPUTS(n2, n3);
201 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2); local
204 CHECK_USES(n0, n3);
205 CHECK_USES(n1, n3);
206 CHECK_USES(n2, n3);
207 CHECK_USES(n3, NON
237 Node* n3 = graph.NewNode(&dummy_operator1, n0); local
257 Node* n3 = graph.NewNode(&dummy_operator0); local
288 Node* n3 = graph.NewNode(&dummy_operator1, n0); local
303 Node* n3 = graph.NewNode(&dummy_operator3, n0, n1, n2); local
369 Node* n3 = graph.NewNode(&dummy_operator0); local
414 Node* n3 = graph.NewNode(&dummy_operator1, n0); local
438 Node* n3 = graph.NewNode(&dummy_operator0); local
471 Node* n3 = graph.NewNode(&dummy_operator1, n0); local
[all...]
/external/v8/test/unittests/compiler/
H A Dnode-unittest.cc174 Node* n3 = Node::New(zone(), 3, &kOp0, 0, nullptr, false); local
204 node->AppendInput(zone(), n3); local
206 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3));
210 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4));
214 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5));
218 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5, n6));
222 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5, n6, n7));
225 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5));
229 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n4, n5, n8));
233 EXPECT_THAT(node->inputs(), ElementsAre(n1, n3, n
[all...]
/external/libunwind/tests/
H A DGia64-test-stack.c58 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/opencv3/modules/photo/src/
H A Darrays.hpp98 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)
109 a = new T[n1*n2*n3];
120 Array2d<T> array2d(a + i*n2*n3, n2, n3);
126 return a + i1*n2*n3 + i2*n3;
134 int n1,n2,n3,n4; member in struct:cv::Array4d
140 steps[0] = n2*n3*n
[all...]
/external/v8/src/compiler/
H A Dgraph.h72 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument
73 Node* nodes[] = {n1, n2, n3};
76 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument
77 Node* nodes[] = {n1, n2, n3, n4};
80 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
82 Node* nodes[] = {n1, n2, n3, n4, n5};
85 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
87 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
90 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
92 Node* nodes[] = {n1, n2, n3, n
95 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8) argument
100 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) argument
[all...]
H A Dbytecode-graph-builder.h69 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument
70 Node* buffer[] = {n1, n2, n3};
74 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument
75 Node* buffer[] = {n1, n2, n3, n4};
/external/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_deadlock_detector_test.cc97 // 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 DInsnFormat.java543 * @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/vpx_dsp/mips/
H A Dconvolve8_avg_horiz_dspr2.c34 uint32_t n1, n2, n3, n4; local
88 "preceu.ph.qbr %[n3], %[tn2] \n\t"
92 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t"
106 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t"
128 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
H A Dconvolve8_horiz_dspr2.c34 uint32_t n1, n2, n3, n4; local
85 "preceu.ph.qbr %[n3], %[tn2] \n\t"
89 "dpa.w.ph $ac3, %[n3], %[vector3b] \n\t"
99 "dpa.w.ph $ac2, %[n3], %[vector2b] \n\t"
117 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
H A Didct32x32_msa.c15 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
18 LD_SH8(input, 32, m0, n0, m1, n1, m2, n2, m3, n3);
20 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3,
21 m0, n0, m1, n1, m2, n2, m3, n3);
24 ST_SH8(m0, n0, m1, n1, m2, n2, m3, n3, (tmp_buf), 8);
29 LD_SH8((input + 16), 32, m0, n0, m1, n1, m2, n2, m3, n3);
31 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3,
32 m0, n0, m1, n1, m2, n2, m3, n3);
36 ST_SH4(m2, n2, m3, n3, (tmp_buf + 20 * 8), 8);
248 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n local
548 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
[all...]
/external/boringssl/src/crypto/ec/
H A Dsimple.c568 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
596 n3 = BN_CTX_get(ctx);
630 /* n3, n4 */
632 if (!BN_copy(n3, &b->X) || !BN_copy(n4, &b->Y)) {
635 /* n3 = X_b */
639 !field_mul(group, n3, &b->X, n0, ctx)) {
642 /* n3 = X_b * Z_a^2 */
652 if (!BN_mod_sub_quick(n5, n1, n3, p) ||
656 /* n5 = n1 - n3 */
676 if (!BN_mod_add_quick(n1, n1, n3,
759 BIGNUM *n0, *n1, *n2, *n3; local
[all...]
/external/google-breakpad/src/testing/gtest/test/
H A Dgtest_output_test_.cc252 // 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 Dgtest_output_test_.cc264 // 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 Dfilter_dspr2.c133 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/llvm/lib/ProfileData/
H A DSampleProfReader.cpp114 size_t n3 = Rest.find(' '); local
115 if (n3 == StringRef::npos) {
119 if (Rest.substr(0, n3).getAsInteger(10, NumSamples))
122 while (n3 != StringRef::npos) {
123 n3 += Rest.substr(n3).find_first_not_of(' ');
124 Rest = Rest.substr(n3);
125 n3 = Rest.find(' ');
127 if (n3 != StringRef::npos) {
128 pair = Rest.substr(0, n3);
138 size_t n3 = Rest.find_last_of(':'); local
[all...]
/external/opencv3/modules/shape/src/
H A DemdL1.cpp107 bool EmdL1::initBaseTrees(int n1, int n2, int n3) argument
109 if(binsDim1==n1 && binsDim2==n2 && binsDim3==n3)
113 binsDim3 = n3;
/external/speex/libspeex/
H A Dlsp.c532 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 Devents.c90 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

Completed in 3750 milliseconds

123