Home
last modified time | relevance | path

Searched refs:n1 (Results 1 – 25 of 265) sorted by relevance

1234567891011

/external/v8/test/cctest/compiler/
Dtest-node.cc22 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
24 CHECK(n2->id() != n1->id()); in TEST()
30 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
32 CHECK(n1->op() == &dummy_operator); in TEST()
49 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); in TEST()
53 CHECK(n1 == n2->InputAt(1)); in TEST()
60 Node* n1 = graph.NewNode(&dummy_operator); in TEST() local
61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1); in TEST()
64 CHECK(n1 == n2->InputAt(1)); in TEST()
[all …]
Dtest-graph-reducer.cc201 Node* n1 = graph.NewNode(&OPA0); in TEST() local
202 Node* end = graph.NewNode(&OPA1, n1); in TEST()
209 recorder.CheckContains(n1); in TEST()
217 Node* n1 = graph.NewNode(&OPA0); in TEST() local
218 Node* n2 = graph.NewNode(&OPA1, n1); in TEST()
219 Node* n3 = graph.NewNode(&OPA1, n1); in TEST()
227 recorder.CheckContains(n1); in TEST()
237 Node* n1 = graph.NewNode(&OPA0); in TEST() local
238 Node* end = graph.NewNode(&OPA1, n1); in TEST()
250 CHECK_EQ(&OPB0, n1->op()); in TEST()
[all …]
/external/libcxx/test/std/localization/locales/locale/locale.operators/
Deq.pass.cpp23 std::locale n1(LOCALE_en_US_UTF_8); in main() local
25 std::locale noname1 = n1.combine<std::ctype<char> >(cloc); in main()
27 std::locale noname2 = n1.combine<std::ctype<char> >(cloc); in main()
31 assert(cloc != n1); in main()
39 assert(copy != n1); in main()
45 assert(n1 != cloc); in main()
46 assert(n1 != copy); in main()
47 assert(n1 == n1); in main()
48 assert(n1 == n2); in main()
49 assert(n1 != noname1); in main()
[all …]
/external/selinux/libsepol/src/
Debitmap.c20 ebitmap_node_t *n1, *n2, *new, *prev; in ebitmap_or() local
24 n1 = e1->node; in ebitmap_or()
27 while (n1 || n2) { in ebitmap_or()
34 if (n1 && n2 && n1->startbit == n2->startbit) { in ebitmap_or()
35 new->startbit = n1->startbit; in ebitmap_or()
36 new->map = n1->map | n2->map; in ebitmap_or()
37 n1 = n1->next; in ebitmap_or()
39 } else if (!n2 || (n1 && n1->startbit < n2->startbit)) { in ebitmap_or()
40 new->startbit = n1->startbit; in ebitmap_or()
41 new->map = n1->map; in ebitmap_or()
[all …]
/external/v8/src/compiler/
Dgraph.h34 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); } in NewNode() argument
35 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() argument
36 Node* nodes[] = {n1, n2}; in NewNode()
39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() argument
40 Node* nodes[] = {n1, n2, n3}; in NewNode()
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() argument
44 Node* nodes[] = {n1, n2, n3, n4}; in NewNode()
47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
49 Node* nodes[] = {n1, n2, n3, n4, n5}; in NewNode()
52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
[all …]
Dgraph-builder.h31 Node* NewNode(const Operator* op, Node* n1) { return MakeNode(op, 1, &n1); } in NewNode() argument
33 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() argument
34 Node* buffer[] = {n1, n2}; in NewNode()
38 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() argument
39 Node* buffer[] = {n1, n2, n3}; in NewNode()
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() argument
44 Node* buffer[] = {n1, n2, n3, n4}; in NewNode()
48 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
50 Node* buffer[] = {n1, n2, n3, n4, n5}; in NewNode()
54 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
[all …]
Dvalue-numbering-reducer-unittest.cc41 Node* n1 = graph()->NewNode(&kOp0, na); in TEST_F() local
43 EXPECT_FALSE(Reduce(n1).Changed()); in TEST_F()
50 Node* n1 = graph()->NewNode(&kOp1, n0); in TEST_F() local
51 EXPECT_FALSE(Reduce(n1).Changed()); in TEST_F()
52 n1->Kill(); in TEST_F()
70 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); in TEST_F() local
71 Reduction r1 = Reduce(n1); in TEST_F()
80 EXPECT_EQ(n1, r2.replacement()); in TEST_F()
/external/eigen/unsupported/Eigen/src/FFT/
Dei_fftw_impl.h82 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
83 …if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERV…
87 void inv2( complex_type * dst,complex_type * src,int n0,int n1) {
88 …if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESER…
124 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
125 …if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE…
129 void inv2( complex_type * dst,complex_type * src,int n0,int n1) {
130 …if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERV…
165 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
166 …if (m_plan==NULL) m_plan = fftwl_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERV…
[all …]
/external/iproute2/ip/
Drtmon.c34 struct nlmsghdr *n1 = (void*)buf; in write_stamp() local
37 n1->nlmsg_type = 15; in write_stamp()
38 n1->nlmsg_flags = 0; in write_stamp()
39 n1->nlmsg_seq = 0; in write_stamp()
40 n1->nlmsg_pid = 0; in write_stamp()
41 n1->nlmsg_len = NLMSG_LENGTH(4*2); in write_stamp()
43 ((__u32*)NLMSG_DATA(n1))[0] = tv.tv_sec; in write_stamp()
44 ((__u32*)NLMSG_DATA(n1))[1] = tv.tv_usec; in write_stamp()
45 fwrite((void*)n1, 1, NLMSG_ALIGN(n1->nlmsg_len), fp); in write_stamp()
/external/icu/icu4c/source/samples/uciter8/
Duciter8.c43 compareIterators(UCharIterator *iter1, const char *n1, in compareIterators() argument
52 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); in compareIterators()
61 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1); in compareIterators()
75 … log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); in compareIterators()
84 …log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter… in compareIterators()
94 …->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->… in compareIterators()
102 log_err("%s->move(start) failed\n", n1); in compareIterators()
106 log_err("%s->hasNext() at the start returns FALSE\n", n1); in compareIterators()
124 …log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, U… in compareIterators()
130 log_err("%s->hasNext() at the end returns TRUE\n", n1); in compareIterators()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/
DTTestImpl.java898 protected double df(double v1, double v2, double n1, double n2) { in df() argument
899 return (((v1 / n1) + (v2 / n2)) * ((v1 / n1) + (v2 / n2))) / in df()
900 ((v1 * v1) / (n1 * n1 * (n1 - 1d)) + (v2 * v2) / in df()
930 protected double t(double m1, double m2, double v1, double v2, double n1, in t() argument
932 return (m1 - m2) / FastMath.sqrt((v1 / n1) + (v2 / n2)); in t()
948 double v2, double n1, double n2) { in homoscedasticT() argument
949 double pooledVariance = ((n1 - 1) * v1 + (n2 -1) * v2 ) / (n1 + n2 - 2); in homoscedasticT()
950 return (m1 - m2) / FastMath.sqrt(pooledVariance * (1d / n1 + 1d / n2)); in homoscedasticT()
986 double n1, double n2) in tTest() argument
988 double t = FastMath.abs(t(m1, m2, v1, v2, n1, n2)); in tTest()
[all …]
/external/strace/tests/
Dsigaction.awk2 n1[1] = "SIG_IGN, \\[HUP INT\\], SA_RESTORER\\|SA_RESTART, 0x[0-9a-f]+"
5 n1[2] = "0x[0-9a-f]+, \\[QUIT TERM\\], SA_RESTORER\\|SA_SIGINFO, 0x[0-9a-f]+"
8 n1[3] = "SIG_DFL, \\[\\], SA_RESTORER, 0x[0-9a-f]+"
11 …n1[4] = "SIG_DFL, ~\\[HUP( ((RT|SIGRT)[^] ]+|[3-9][0-9]|1[0-9][0-9]))*\\], SA_RESTORER, 0x[0-9a-f]…
17 o1[i] = n1[i - 1]
27 "\\{" n1[i] "\\}, \\{" o1[i] "\\}, " a1 "|" \
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/
Dsplice_after_flist.pass.cpp31 int n1 = 0; in testd() local
32 for (; n1 < p; ++n1, ++i) in testd()
33 assert(*i == t1[n1]); in testd()
36 for (; n1 < size_t1; ++n1, ++i) in testd()
37 assert(*i == t1[n1]); in testd()
Dsplice_after_one.pass.cpp31 int n1 = 0; in testd() local
32 for (; n1 < p; ++n1, ++i) in testd()
33 assert(*i == t1[n1]); in testd()
36 for (; n1 < size_t1; ++n1, ++i) in testd()
37 assert(*i == t1[n1]); in testd()
/external/llvm/test/Analysis/DependenceAnalysis/
DSymbolicRDIV.ll8 ;; for (long int i = 0; i < n1; i++)
9 ;; A[2*i + n1] = i;
11 ;; *B++ = A[3*j + 3*n1];
13 define void @symbolicrdiv0(i32* %A, i32* %B, i64 %n1, i64 %n2) nounwind uwtable ssp {
15 %cmp4 = icmp eq i64 %n1, 0
43 %add = add i64 %mul, %n1
47 %exitcond = icmp ne i64 %inc, %n1
53 %mul56 = add i64 %j.03, %n1
71 ;; for (long int i = 0; i < n1; i++)
76 define void @symbolicrdiv1(i32* %A, i32* %B, i64 %n1, i64 %n2) nounwind uwtable ssp {
[all …]
/external/icu/icu4j/main/tests/localespi/src/com/ibm/icu/dev/test/localespi/
DNumberFormatTest.java183 Number n1, n2; in TestICUEquivalent() local
195 n1 = n2 = null; in TestICUEquivalent()
197 n1 = nf.parse(s1); in TestICUEquivalent()
211 } else if (!pe1 && !pe2 && !n1.equals(n2)) { in TestICUEquivalent()
213 … + methodName[0] + ") in locale " + loc + " - JDK:" + n1 + " ICU:" + n2); in TestICUEquivalent()
230 n1 = n2 = null; in TestICUEquivalent()
232 n1 = nf.parse(s1); in TestICUEquivalent()
246 } else if (!pe1 && !pe2 && !n1.equals(n2)) { in TestICUEquivalent()
248 … + methodName[0] + ") in locale " + loc + " - JDK:" + n1 + " ICU:" + n2); in TestICUEquivalent()
265 n1 = n2 = null; in TestICUEquivalent()
[all …]
/external/protobuf/gtest/samples/
Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); in MapTester() local
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { in MapTester()
107 EXPECT_EQ(2 * n1->element(), n2->element()); in MapTester()
/external/google-breakpad/src/testing/gtest/samples/
Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); in MapTester() local
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { in MapTester()
107 EXPECT_EQ(2 * n1->element(), n2->element()); in MapTester()
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
DNodeSorter.java127 NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support) in compare() argument
140 n1Num = ((Double) n1.m_key1Value).doubleValue(); in compare()
145 n1Num = ((Double) n1.m_key2Value).doubleValue(); in compare()
159 XObject r1 = k.m_selectPat.execute(m_execContext, n1.m_node, in compare()
174 result = compare(n1, n2, kIndex + 1, support); in compare()
203 n1String = (CollationKey) n1.m_key1Value; in compare()
208 n1String = (CollationKey) n1.m_key2Value; in compare()
222 XObject r1 = k.m_selectPat.execute(m_execContext, n1.m_node, in compare()
260 result = compare(n1, n2, kIndex + 1, support); in compare()
271 DTM dtm = support.getDTM(n1.m_node); // %OPT% in compare()
[all …]
/external/apache-xml/src/main/java/org/apache/xpath/objects/
DXNodeSet.java754 abstract boolean compareNumbers(double n1, double n2); in compareNumbers() argument
787 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
789 return n1 < n2; in compareNumbers()
823 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
825 return n1 <= n2; in compareNumbers()
859 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
861 return n1 > n2; in compareNumbers()
895 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
897 return n1 >= n2; in compareNumbers()
930 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
[all …]
/external/aac/libSYS/include/
DgenericStds.h172 #define C_ALLOC_MEM2(name,type,n1,n2) \ argument
173 …type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKcalloc(n1, sizeof(type))); …
175 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
184 #define C_AALLOC_MEM2(name,type,n1,n2) \ argument
185 …type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKaalloc((n1)*sizeof(type), A…
187 …UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type) + ALIGNMENT_DEFAUL…
196 #define C_ALLOC_MEM2_L(name,type,n1,n2,s) \ argument
197 …type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return (type*)FDKcalloc_L(n1, sizeof(type), s…
199 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
208 #define C_AALLOC_MEM2_L(name,type,n1,n2,s) \ argument
[all …]
/external/boringssl/src/crypto/ec/
Dsimple.c616 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; in ec_GFp_simple_add() local
642 n1 = BN_CTX_get(ctx); in ec_GFp_simple_add()
659 if (!BN_copy(n1, &a->X) || !BN_copy(n2, &a->Y)) { in ec_GFp_simple_add()
666 !field_mul(group, n1, &a->X, n0, ctx)) { in ec_GFp_simple_add()
700 if (!BN_mod_sub_quick(n5, n1, n3, p) || in ec_GFp_simple_add()
724 if (!BN_mod_add_quick(n1, n1, n3, p) || in ec_GFp_simple_add()
758 !field_mul(group, n3, n1, n4, ctx) || in ec_GFp_simple_add()
776 if (!field_mul(group, n1, n2, n5, ctx) || in ec_GFp_simple_add()
777 !BN_mod_sub_quick(n0, n0, n1, p)) { in ec_GFp_simple_add()
807 BIGNUM *n0, *n1, *n2, *n3; in ec_GFp_simple_dbl() local
[all …]
/external/guava/guava-tests/benchmark/com/google/common/math/
DBigIntegerMathBenchmark.java70 private static BigInteger oldSlowFactorial(int n1, int n2) { in oldSlowFactorial() argument
71 assert n1 <= n2; in oldSlowFactorial() local
72 if (IntMath.log2(n2, CEILING) * (n2 - n1) < Long.SIZE - 1) { in oldSlowFactorial()
75 for (int i = n1 + 1; i <= n2; i++) { in oldSlowFactorial()
85 int mid = (n1 + n2) >>> 1; in oldSlowFactorial()
86 return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2)); in oldSlowFactorial()
/external/opencv/cxcore/src/
Dcxsvd.cpp247 int nm, m1, n1; in icvSVD_64f() local
263 n1 = n; in icvSVD_64f()
301 memset( temp, 0, n1 * sizeof( temp[0] )); in icvSVD_64f()
304 icvMatrAXPY_64f( m1, n1 - 1, a + 1, lda, hv, temp + 1, 0 ); in icvSVD_64f()
305 for( k = 1; k < n1; k++ ) temp[k] *= h; in icvSVD_64f()
308 icvMatrAXPY_64f( m1, n1 - 1, temp + 1, 0, hv, a + 1, lda ); in icvSVD_64f()
323 n1--; in icvSVD_64f()
327 if( n1 == 0 ) in icvSVD_64f()
331 update_v = vT && n1 > n - nv; in icvSVD_64f()
335 for( j = 0; j < n1; j++ ) in icvSVD_64f()
[all …]
/external/mesa3d/src/mesa/program/
Dprog_noise.c220 float n0, n1; in _mesa_noise1() local
229 n1 = t1 * t1 * grad1(perm[i1 & 0xff], x1); in _mesa_noise1()
233 return 0.25f * (n0 + n1); in _mesa_noise1()
244 float n0, n1, n2; /* Noise contributions from the three corners */ in _mesa_noise2() local
299 n1 = 0.0f; in _mesa_noise2()
302 n1 = t1 * t1 * grad2(perm[ii + i1 + perm[jj + j1]], x1, y1); in _mesa_noise2()
315 return 40.0f * (n0 + n1 + n2); /* TODO: The scale factor is preliminary! */ in _mesa_noise2()
327 float n0, n1, n2, n3; /* Noise contributions from the four corners */ in _mesa_noise3() local
441 n1 = 0.0f; in _mesa_noise3()
444 n1 = in _mesa_noise3()
[all …]

1234567891011