Searched refs:n2 (Results 1 - 25 of 203) sorted by relevance

123456789

/external/v8/test/mjsunit/
H A Dthis-property-assignment.js40 var n2 = new Node();
41 assertEquals(3, n2.a);
/external/strace/tests/
H A Dsigaction.awk3 n2[1] = "SIG_IGN, \\[HUP INT\\], SA_RESTART"
6 n2[2] = "0x[0-9a-f]+, \\[QUIT TERM\\], SA_SIGINFO"
9 n2[3] = "SIG_DFL, \\[\\], 0"
12 n2[4] = "SIG_DFL, ~\\[HUP( ((RT|SIGRT)[^] ]+|[3-9][0-9]|1[0-9][0-9]))*\\], 0"
18 o2[i] = n2[i - 1]
28 "\\{" n2[i] "\\}, \\{" o2[i] "\\}, " a2 "|" \
29 "\\{" n2[i] "\\}, \\{" o2[i] "\\}, " a3 ")\\) = 0$"
/external/libutf/
H A Dutfutf.c29 long f, n1, n2; local
37 n2 = strlen(s2);
39 if(strncmp(p, s2, n2) == 0)
/external/v8/test/cctest/compiler/
H A Dtest-node.cc23 Node* n2 = graph.NewNode(&dummy_operator); local
24 CHECK(n2->id() != n1->id());
31 Node* n2 = graph.NewNode(&dummy_operator); local
33 CHECK(n2->op() == &dummy_operator);
40 Node* n2 = graph.NewNode(&dummy_operator, n0); local
41 CHECK_EQ(1, n2->InputCount());
42 CHECK(n0 == n2->InputAt(0));
50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
51 CHECK_EQ(2, n2->InputCount());
52 CHECK(n0 == n2
61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1); local
122 Node* n2 = graph.NewNode(&dummy_operator); local
136 Node* n2 = graph.NewNode(&dummy_operator, n0); local
184 Node* n2 = graph.NewNode(&dummy_operator); local
241 Node* n2 = graph.NewNode(&dummy_operator, n0); local
257 Node* n2 = graph.NewNode(&dummy_operator, n0); local
288 Node* n2 = graph.NewNode(&dummy_operator, n0); local
303 Node* n2 = graph.NewNode(&dummy_operator, n0); local
346 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
367 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
404 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
422 Node* n2 = graph.NewNode(&dummy_operator, n0); local
445 Node* n2 = graph.NewNode(&dummy_operator, n0); local
481 Node* n2 = graph.NewNode(&dummy_operator, n0); local
523 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
545 Node* n2 = graph.NewNode(&dummy_operator, n0); local
580 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
591 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
602 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
612 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); local
621 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); local
656 Node* n2 = graph.NewNode(&dummy_operator); local
672 Node* n2 = graph.NewNode(&dummy_operator); local
687 Node* n2 = graph.NewNode(&dummy_operator); local
700 Node* n2 = graph.NewNode(&dummy_operator); local
713 Node* n2 = graph.NewNode(&dummy_operator); local
732 Node* n2 = graph.NewNode(&dummy_operator, n0); local
747 Node* n2 = graph.NewNode(&dummy_operator, n0); local
761 Node* n2 = graph.NewNode(&dummy_operator, n0); local
773 Node* n2 = graph.NewNode(&dummy_operator, n0); local
785 Node* n2 = graph.NewNode(&dummy_operator, n0); local
803 Node* n2; local
[all...]
H A Dtest-node-algorithm.cc58 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local
59 Node* n3 = graph.NewNode(&dummy_operator, n2);
60 Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
61 Node* n5 = graph.NewNode(&dummy_operator, n4, n2);
69 CHECK(n2->id() == node_visitor.nodes_[1]->id());
78 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local
79 Node* n3 = graph.NewNode(&dummy_operator, n2);
80 Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
81 Node* n5 = graph.NewNode(&dummy_operator, n4, n2);
89 CHECK(n2
97 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local
124 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local
161 Node* n2 = graph.NewNode(&dummy_operator, n1); local
220 Node* n2 = graph.NewNode(&dummy_operator, n0); local
314 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local
[all...]
/external/libcxx/test/std/localization/locales/locale/locale.operators/
H A Deq.pass.cpp24 std::locale n2(LOCALE_en_US_UTF_8);
32 assert(cloc != n2);
40 assert(copy != n2);
48 assert(n1 == n2);
53 assert(n2 != cloc);
54 assert(n2 != copy);
55 assert(n2 == n1);
56 assert(n2 == n2);
57 assert(n2 !
[all...]
/external/clang/test/SemaCXX/
H A Dpr18284-crash-on-invalid.cpp15 namespace n2 { namespace
24 } // namespace n2
/external/v8/src/compiler/
H A Dgraph.h35 Node* NewNode(const Operator* op, Node* n1, Node* n2) { argument
36 Node* nodes[] = {n1, n2};
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, n
[all...]
H A Dgraph-builder.h33 Node* NewNode(const Operator* op, Node* n1, Node* n2) { argument
34 Node* buffer[] = {n1, n2};
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, n
[all...]
/external/boringssl/src/crypto/bn/
H A Dmul.c305 /* r is 2*n2 words in size,
306 * a and b are both n2 words in size.
307 * n2 must be a power of 2.
309 * t must be 2*n2 words in size
315 /* dnX may not be positive, but n2/2+dnX has to be */
316 static void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
318 int n = n2 / 2, c1, c2;
323 /* Only call bn_mul_comba 8 if n2 == 8 and the
326 if (n2 == 8 && dna == 0 && dnb == 0) {
332 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMA
450 int i, j, n2 = n * 2; local
724 bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument
[all...]
/external/icu/icu4c/source/common/
H A Dunorm.cpp49 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
50 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
57 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
59 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
64 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
72 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
73 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
80 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
82 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
87 return unorm2_isNormalized((const UNormalizer2 *)n2, sr
99 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
115 _iterate(UCharIterator *src, UBool forward, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UBool doNormalize, UBool *pNeededToNormalize, UErrorCode *pErrorCode) argument
180 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
223 _concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UErrorCode *pErrorCode) argument
264 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
[all...]
/external/bzip2/
H A Dbzmore16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
/external/selinux/libsepol/src/
H A Debitmap.c20 ebitmap_node_t *n1, *n2, *new, *prev; local
25 n2 = e2->node;
27 while (n1 || n2) {
34 if (n1 && n2 && n1->startbit == n2->startbit) {
36 new->map = n1->map | n2->map;
38 n2 = n2->next;
39 } else if (!n2 || (n1 && n1->startbit < n2
152 ebitmap_node_t *n1, *n2; local
202 ebitmap_node_t *n1, *n2; local
[all...]
/external/clang/test/Sema/
H A Dattr-section.c14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
/external/google-breakpad/src/testing/gtest/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
/external/protobuf/gtest/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
/external/guava/guava-tests/benchmark/com/google/common/math/
H A DBigIntegerMathBenchmark.java68 * Returns the product of {@code n1} exclusive through {@code n2} inclusive.
70 private static BigInteger oldSlowFactorial(int n1, int n2) { argument
71 assert n1 <= n2;
72 if (IntMath.log2(n2, CEILING) * (n2 - n1) < Long.SIZE - 1) {
75 for (int i = n1 + 1; i <= n2; i++) {
85 int mid = (n1 + n2) >>> 1;
86 return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/
H A DTTestImpl.java228 * &nbsp;&nbsp;<code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
231 * <strong><code> n2</code></strong> is the size of second sample;
237 * <code>var = sqrt(((n1 - 1)var1 + (n2 - 1)var2) / ((n1-1) + (n2-1)))</code>
270 * &nbsp;&nbsp; <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
273 * <strong><code> n2</code></strong> is the size of the second sample;
309 * &nbsp;&nbsp; <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
312 * <strong><code> n2</code></strong> is the size of the second sample;
350 * &nbsp;&nbsp;<code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
353 * <strong><code> n2</cod
898 df(double v1, double v2, double n1, double n2) argument
930 t(double m1, double m2, double v1, double v2, double n1, double n2) argument
947 homoscedasticT(double m1, double m2, double v1, double v2, double n1, double n2) argument
985 tTest(double m1, double m2, double v1, double v2, double n1, double n2) argument
1010 homoscedasticTTest(double m1, double m2, double v1, double v2, double n1, double n2) argument
[all...]
/external/jmonkeyengine/engine/src/test/jme3test/model/shape/
H A DTestBillboard.java85 n2=new Node("parentParent");
86 n2.setLocalTranslation(Vector3f.UNIT_X.mult(5));
87 n2.attachChild(n);
89 rootNode.attachChild(n2);
96 Node n2; field in class:TestBillboard
102 n2.rotate(0, 0, -tpf);
/external/elfutils/src/libelf/
H A Delf32_fsize.c70 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
/external/icu/icu4c/source/samples/uciter8/
H A Duciter8.c44 UCharIterator *iter2, const char *n2) {
52 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
67 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2);
75 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
84 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
94 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
112 log_err("%s->move(start) failed\n", n2);
116 log_err("%s->hasNext() at the start returns FALSE\n", n2);
124 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
134 log_err("%s->hasNext() at the end returns TRUE\n", n2);
43 compareIterators(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2) argument
[all...]
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/
H A Dsplice_after_flist.pass.cpp34 for (int n2 = 0; n2 < l; ++n2, ++i)
35 assert(*i == t2[n2]);
/external/v8/test/mjsunit/tools/
H A Dprofile_view.js84 view.sort(function(n1, n2) {
85 return cmpStrs(n1.internalFuncName, n2.internalFuncName) ||
86 (n1.selfTime - n2.selfTime);
/external/libvorbis/lib/
H A Dmdct.c57 int n2=n>>1; local
68 T[n2+i*2]=FLOAT_CONV(cos((M_PI/(2*n))*(2*i+1)));
69 T[n2+i*2+1]=FLOAT_CONV(sin((M_PI/(2*n))*(2*i+1)));
399 int n2=n>>1; local
404 DATA_TYPE *iX = in+n2-7;
405 DATA_TYPE *oX = out+n2+n4;
418 iX = in+n2-8;
419 oX = out+n2+n4;
432 mdct_butterflies(init,out+n2,n2);
495 int n2=n>>1; local
[all...]
/external/icu/icu4j/main/tests/localespi/src/com/ibm/icu/dev/test/localespi/
H A DNumberFormatTest.java183 Number n1, n2;
195 n1 = n2 = null;
203 n2 = icunf.parse(s2);
211 } else if (!pe1 && !pe2 && !n1.equals(n2)) {
213 + methodName[0] + ") in locale " + loc + " - JDK:" + n1 + " ICU:" + n2);
230 n1 = n2 = null;
238 n2 = icunf.parse(s2);
246 } else if (!pe1 && !pe2 && !n1.equals(n2)) {
248 + methodName[0] + ") in locale " + loc + " - JDK:" + n1 + " ICU:" + n2);
265 n1 = n2
[all...]

Completed in 1435 milliseconds

123456789