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

123

/external/chromium_org/third_party/smhasher/src/
H A DStats.cpp85 int n3 = (int)n2; local
87 if(n3 == 0)
91 char x = '0' + char(n3);
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-node.cc123 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 Dtest-node-algorithm.cc59 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 Dtest-graph-reducer.cc219 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/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/flac/include/share/
H A Dalloc.h54 // malloc(n1 * (n2 + n3))
55 static inline void *safe_malloc_muladd2_(size_t n1, size_t n2, size_t n3) argument
57 unsigned long long n = n1 * (n2 + n3);
/external/stlport/test/unit/
H A Dmismatch_test.cpp42 int n3[5] = { 1, 2, 3, 2, 1 }; local
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
/external/chromium_org/chrome/browser/undo/
H A Dbookmark_undo_service_test.cc158 const BookmarkNode* n3 = model->AddURL(model->other_node(), local
168 EXPECT_EQ(model->other_node()->GetChild(2), n3);
173 EXPECT_EQ(model->other_node()->GetChild(1), n3);
191 const BookmarkNode* n3 = model->AddURL(model->other_node(), local
197 model->Move(n3, f1, 0);
204 EXPECT_EQ(model->other_node()->GetChild(2), n3);
215 EXPECT_EQ(f1->GetChild(0), n3);
/external/clang/test/Modules/
H A Dmacros2.c77 int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
H A Dmacros.c164 int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable
/external/chromium_org/v8/src/compiler/
H A Dgraph.h39 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};
/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/llvm/unittests/IR/
H A DMetadataTest.cpp94 MDNode *n3 = MDNode::get(Context, V); local
100 EXPECT_EQ(n1, n3);
102 (void) n3;
/external/openssl/crypto/objects/
H A Dobj_xref.c210 int n1, n2, n3; local
224 rv = OBJ_find_sigid_algs(n1, &n2, &n3);
226 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
228 rv = OBJ_find_sigid_by_algs(&n1, n2, n3);
230 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/mips/dspr2/
H A Dvp9_convolve8_avg_horiz_dspr2.c36 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 Dvp9_convolve8_horiz_dspr2.c36 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/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/vp9/common/mips/dspr2/
H A Dvp9_convolve8_avg_horiz_dspr2.c36 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 Dvp9_convolve8_horiz_dspr2.c36 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/qemu/slirp/
H A Dtcp_subr.c612 u_int n1, n2, n3, n4, n5, n6; local
970 &n1, &n2, &n3, &n4, &n5, &n6, buff);
974 laddr = htonl((n1 << 24) | (n2 << 16) | (n3 << 8) | (n4));
989 n3 = ((laddr >> 8) & 0xff);
995 n1, n2, n3, n4, n5, n6, x==7?buff:"");
1002 &n1, &n2, &n3, &n4, &n5, &n6, buff);
1006 laddr = htonl((n1 << 24) | (n2 << 16) | (n3 << 8) | (n4));
1021 n3 = ((laddr >> 8) & 0xff);
1027 n1, n2, n3, n4, n5, n6, x==7?buff:"");
/external/chromium_org/testing/gtest/test/
H A Dgtest_output_test_.cc269 // 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();
/external/chromium_org/third_party/boringssl/src/crypto/ec/
H A Dsimple.c617 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
641 n3 = BN_CTX_get(ctx);
675 /* n3, n4 */
677 if (!BN_copy(n3, &b->X))
681 /* n3 = X_b */
686 if (!field_mul(group, n3, &b->X, n0, ctx))
688 /* n3 = X_b * Z_a^2 */
698 if (!BN_mod_sub_quick(n5, n1, n3, p))
702 /* n5 = n1 - n3 */
722 if (!BN_mod_add_quick(n1, n1, n3,
802 BIGNUM *n0, *n1, *n2, *n3; local
[all...]
/external/chromium_org/third_party/libvpx/source/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...]

Completed in 1909 milliseconds

123