Home
last modified time | relevance | path

Searched refs:n2 (Results 1 – 25 of 305) sorted by relevance

12345678910>>...13

/external/v8/test/cctest/compiler/
Dtest-node.cc148 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST() local
151 CHECK_USES(n0, n1, n2); in TEST()
154 CHECK_INPUTS(n2, n0); in TEST()
160 CHECK_USES(n2, NONE); in TEST()
161 CHECK_USES(n3, n1, n2); in TEST()
164 CHECK_INPUTS(n2, n3); in TEST()
182 Node* n2 = graph.NewNode(&dummy_operator0); in TEST() local
184 n1->ReplaceUses(n2); in TEST()
188 CHECK_USES(n2, n1); in TEST()
197 Node* n2 = graph.NewNode(&dummy_operator0); in TEST() local
[all …]
/external/opencv3/modules/photo/src/
Darrays.hpp54 int n1,n2; member
58 a(array2d.a), n1(array2d.n1), n2(array2d.n2), needToDeallocArray(false) in Array2d()
67 a(_a), n1(_n1), n2(_n2), needToDeallocArray(false) in Array2d()
72 n1(_n1), n2(_n2), needToDeallocArray(true) in Array2d()
74 a = new T[n1*n2]; in Array2d()
85 return a + i*n2; in operator []()
98 int n1,n2,n3; member
102 a(_a), n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(false) in Array3d()
107 n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(true) in Array3d()
109 a = new T[n1*n2*n3]; in Array3d()
[all …]
/external/boringssl/src/crypto/bn/
Dmul.c316 static void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, in bn_mul_recursive() argument
318 int n = n2 / 2, c1, c2; in bn_mul_recursive()
326 if (n2 == 8 && dna == 0 && dnb == 0) { in bn_mul_recursive()
332 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) { in bn_mul_recursive()
333 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb); in bn_mul_recursive()
335 memset(&r[2 * n2 + dna + dnb], 0, sizeof(BN_ULONG) * -(dna + dnb)); in bn_mul_recursive()
379 bn_mul_comba4(&(t[n2]), t, &(t[n])); in bn_mul_recursive()
381 memset(&(t[n2]), 0, 8 * sizeof(BN_ULONG)); in bn_mul_recursive()
385 bn_mul_comba4(&(r[n2]), &(a[n]), &(b[n])); in bn_mul_recursive()
389 bn_mul_comba8(&(t[n2]), t, &(t[n])); in bn_mul_recursive()
[all …]
/external/selinux/libsepol/src/
Debitmap.c20 ebitmap_node_t *n1, *n2, *new, *prev; in ebitmap_or() local
25 n2 = e2->node; in ebitmap_or()
27 while (n1 || n2) { in ebitmap_or()
34 if (n1 && n2 && n1->startbit == n2->startbit) { in ebitmap_or()
36 new->map = n1->map | n2->map; in ebitmap_or()
38 n2 = n2->next; in ebitmap_or()
39 } else if (!n2 || (n1 && n1->startbit < n2->startbit)) { in ebitmap_or()
44 new->startbit = n2->startbit; in ebitmap_or()
45 new->map = n2->map; in ebitmap_or()
46 n2 = n2->next; in ebitmap_or()
[all …]
/external/libcxx/test/std/localization/locales/locale/locale.operators/
Deq.pass.cpp24 std::locale n2(LOCALE_en_US_UTF_8); in main() local
32 assert(cloc != n2); in main()
40 assert(copy != n2); in main()
48 assert(n1 == n2); in main()
53 assert(n2 != cloc); in main()
54 assert(n2 != copy); in main()
55 assert(n2 == n1); in main()
56 assert(n2 == n2); in main()
57 assert(n2 != noname1); in main()
58 assert(n2 != nonamec); in main()
[all …]
/external/icu/icu4c/source/common/
Dunorm.cpp49 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheck() local
50 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheck()
57 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheckWithOptions() local
59 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_quickCheckWithOptions()
64 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheckWithOptions()
72 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalized() local
73 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalized()
80 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalizedWithOptions() local
82 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_isNormalizedWithOptions()
87 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalizedWithOptions()
[all …]
Dnormlzr.cpp139 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); in normalize() local
142 FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)). in normalize()
145 n2->normalize(source, *dest, status); in normalize()
174 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); in quickCheck() local
177 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)). in quickCheck()
180 return n2->quickCheck(source, status); in quickCheck()
191 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); in isNormalized() local
194 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)). in isNormalized()
197 return n2->isNormalized(source, status); in isNormalized()
225 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, errorCode); in concatenate() local
[all …]
/external/v8/src/compiler/
Dgraph.h49 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() argument
50 Node* nodes[] = {n1, n2}; in NewNode()
53 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() argument
54 Node* nodes[] = {n1, n2, n3}; in NewNode()
57 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() argument
58 Node* nodes[] = {n1, n2, n3, n4}; in NewNode()
61 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
63 Node* nodes[] = {n1, n2, n3, n4, n5}; in NewNode()
66 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() argument
68 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; in NewNode()
[all …]
/external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/
Dtest_object_graph.py51 n2 = Node("n2")
61 graph.addNode(n2)
71 self.assertTrue(graph.findNode(n2) is n2)
74 self.assertTrue(graph.findNode("n2") is n2)
111 n2 = graph.createNode(ArgNode, "n2", 1)
115 graph.createReference(n1, n2, "n1-n2")
135 graph.removeReference(n1, n2)
143 graph.createReference(n1, n2, "foo")
152 n2 = graph.createNode(ArgNode, "n2", 2)
162 graph.createReference(n1, n2)
[all …]
/external/v8/test/unittests/compiler/
Dnode-unittest.cc56 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); in TEST_F() local
58 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2)); in TEST_F()
59 EXPECT_THAT(n1->uses(), UnorderedElementsAre(n2)); in TEST_F()
60 EXPECT_EQ(2, n2->InputCount()); in TEST_F()
61 EXPECT_EQ(n0, n2->InputAt(0)); in TEST_F()
62 EXPECT_EQ(n1, n2->InputAt(1)); in TEST_F()
83 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); in TEST_F() local
84 EXPECT_THAT(n2->inputs(), ElementsAre(n0, n1)); in TEST_F()
105 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); in TEST_F() local
106 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2)); in TEST_F()
[all …]
Dgraph-reducer-unittest.cc508 Node* n2 = graph()->NewNode(&kOpA1, n1); in TEST_F() local
510 Node* end = graph()->NewNode(&kOpA2, n2, n3); in TEST_F()
514 EXPECT_CALL(r1, Reduce(n2)).InSequence(s1); in TEST_F()
541 Node* n2 = graph()->NewNode(&kOpA1, n1); in TEST_F() local
543 Node* end = graph()->NewNode(&kOpA2, n2, n3); in TEST_F()
553 EXPECT_EQ(&kOpB1, n2->op()); in TEST_F()
554 EXPECT_EQ(n1, n2->InputAt(0)); in TEST_F()
558 EXPECT_EQ(n2, end->InputAt(0)); in TEST_F()
566 Node* n2 = graph()->NewNode(&kOpA1, n1); in TEST_F() local
568 Node* end = graph()->NewNode(&kOpA2, n2, n3); in TEST_F()
[all …]
/external/strace/tests/
Dsigaction.awk30 n2[1] = "SIG_IGN, \\[HUP INT\\], SA_RESTART"
33 n2[2] = "0x[0-9a-f]+, \\[QUIT TERM\\], SA_SIGINFO"
36 n2[3] = "SIG_DFL, \\[\\], 0"
39 n2[4] = "SIG_DFL, ~\\[HUP( ((RT|SIGRT)[^] ]+|[3-9][0-9]|1[0-9][0-9]))*\\], 0"
45 o2[i] = n2[i - 1]
55 "\\{" n2[i] "\\}, \\{" o2[i] "\\}, " a2 "|" \
56 "\\{" n2[i] "\\}, \\{" o2[i] "\\}, " a3 ")\\) = 0$"
/external/icu/icu4c/source/samples/uciter8/
Duciter8.c44 UCharIterator *iter2, const char *n2) { in compareIterators() argument
52 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); in compareIterators()
67 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2); 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 …xt()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(ite… in compareIterators()
94 …=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(ite… in compareIterators()
112 log_err("%s->move(start) failed\n", n2); in compareIterators()
116 log_err("%s->hasNext() at the start returns FALSE\n", n2); 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()
134 log_err("%s->hasNext() at the end returns TRUE\n", n2); 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()
901 (n2 * n2 * (n2 - 1d))); in df()
931 double n2) { 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/llvm/test/Analysis/DependenceAnalysis/
DSymbolicRDIV.ll10 ;; for (long int j = 0; j < n2; j++)
13 define void @symbolicrdiv0(i32* %A, i32* %B, i64 %n1, i64 %n2) nounwind uwtable ssp {
33 %cmp21 = icmp eq i64 %n2, 0
60 %exitcond7 = icmp ne i64 %inc10, %n2
72 ;; A[2*i + 5*n2] = i;
73 ;; for (long int j = 0; j < n2; j++)
74 ;; *B++ = A[3*j + 2*n2];
76 define void @symbolicrdiv1(i32* %A, i32* %B, i64 %n1, i64 %n2) nounwind uwtable ssp {
96 %cmp31 = icmp eq i64 %n2, 0
106 %mul1 = mul i64 %n2, 5
[all …]
/external/libvorbis/lib/
Dmdct.c57 int n2=n>>1; in mdct_init() local
68 T[n2+i*2]=FLOAT_CONV(cos((M_PI/(2*n))*(2*i+1))); in mdct_init()
69 T[n2+i*2+1]=FLOAT_CONV(sin((M_PI/(2*n))*(2*i+1))); in mdct_init()
399 int n2=n>>1; in mdct_backward() local
404 DATA_TYPE *iX = in+n2-7; in mdct_backward()
405 DATA_TYPE *oX = out+n2+n4; in mdct_backward()
418 iX = in+n2-8; in mdct_backward()
419 oX = out+n2+n4; in mdct_backward()
432 mdct_butterflies(init,out+n2,n2); in mdct_backward()
438 DATA_TYPE *oX1=out+n2+n4; in mdct_backward()
[all …]
/external/chromium-trace/catapult/telemetry/telemetry/util/
Dcolor_histogram.py28 n2 = sum_func(hist2)
29 if (n1 == 0 or n2 == 0) and default_color is None:
34 if n2 == 0:
36 n2 = 1
39 remainder = np.multiply(hist1, n2) - np.multiply(hist2, n1)
46 remainder += value1 * n2 - value2 * n1
51 return abs(float(total) / n1 / n2)
/external/mesa3d/src/mesa/program/
Dregister_allocate.c296 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2) in ra_add_node_adjacency() argument
298 g->nodes[n1].adjacency[n2] = GL_TRUE; in ra_add_node_adjacency()
299 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2; in ra_add_node_adjacency()
336 unsigned int n1, unsigned int n2) in ra_add_node_interference() argument
338 if (!g->nodes[n1].adjacency[n2]) { in ra_add_node_interference()
339 ra_add_node_adjacency(g, n1, n2); in ra_add_node_interference()
340 ra_add_node_adjacency(g, n2, n1); in ra_add_node_interference()
351 unsigned int n2 = g->nodes[n].adjacency_list[j]; in pq_test() local
352 unsigned int n2_class = g->nodes[n2].class; in pq_test()
354 if (n != n2 && !g->nodes[n2].in_stack) { in pq_test()
[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()
203 n2 = icunf.parse(s2); 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()
238 n2 = icunf.parse(s2); 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/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()
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/webrtc/webrtc/system_wrappers/include/
Dntp_time.h55 inline bool operator==(const NtpTime& n1, const NtpTime& n2) {
56 return n1.seconds() == n2.seconds() && n1.fractions() == n2.fractions();
58 inline bool operator!=(const NtpTime& n1, const NtpTime& n2) {
59 return !(n1 == n2);
/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 …void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type) + ALIGNMENT_DEFAULT + sizeof(void *)) * (n2); }
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/apache-xml/src/main/java/org/apache/xalan/transformer/
DNodeSorter.java127 NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support) in compare() argument
141 n2Num = ((Double) n2.m_key1Value).doubleValue(); in compare()
146 n2Num = ((Double) n2.m_key2Value).doubleValue(); in compare()
161 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node, in compare()
174 result = compare(n1, n2, kIndex + 1, support); in compare()
204 n2String = (CollationKey) n2.m_key1Value; in compare()
209 n2String = (CollationKey) n2.m_key2Value; in compare()
224 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node, in compare()
260 result = compare(n1, n2, kIndex + 1, support); in compare()
272 result = dtm.isNodeAfter(n1.m_node, n2.m_node) ? -1 : 1; in compare()
/external/libvpx/libvpx/vp8/common/mips/dspr2/
Dfilter_dspr2.c133 unsigned int n1, n2, n3; in vp8_filter_block2d_first_pass_4() local
226 [p3] "=&r" (p3), [n1] "=&r" (n1), [n2] "=&r" (n2), in vp8_filter_block2d_first_pass_4()
297 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), in vp8_filter_block2d_first_pass_4()
329 unsigned int n1, n2, n3, n4; in vp8_filter_block2d_first_pass_8_all() local
420 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), in vp8_filter_block2d_first_pass_8_all()
468 : [tn1] "=&r" (tn1), [n2] "=&r" (n2), in vp8_filter_block2d_first_pass_8_all()
547 [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4), in vp8_filter_block2d_first_pass_8_all()
588 : [tn1] "=&r" (tn1), [p2] "=&r" (p2), [n2] "=&r" (n2), in vp8_filter_block2d_first_pass_8_all()
629 unsigned int n1, n2, n3, n4; in vp8_filter_block2d_first_pass16_6tap() local
691 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), in vp8_filter_block2d_first_pass16_6tap()
[all …]

12345678910>>...13