Searched refs:n1 (Results 1 - 25 of 224) sorted by relevance

123456789

/external/v8/test/mjsunit/
H A Dthis-property-assignment.js37 var n1 = new Node();
38 assertEquals(3, n1.a);
/external/strace/tests/
H A 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/localization/locales/locale/locale.operators/
H A Deq.pass.cpp23 std::locale n1(LOCALE_en_US_UTF_8);
25 std::locale noname1 = n1.combine<std::ctype<char> >(cloc);
27 std::locale noname2 = n1.combine<std::ctype<char> >(cloc);
31 assert(cloc != n1);
39 assert(copy != n1);
45 assert(n1 != cloc);
46 assert(n1 != copy);
47 assert(n1 == n1);
48 assert(n1
[all...]
/external/libutf/
H A Dutfutf.c29 long f, n1, n2; local
32 n1 = chartorune(&r, s2);
38 for(p=s1; (p=utfrune(p, f)) != 0; p+=n1)
/external/v8/test/cctest/compiler/
H A Dtest-node.cc22 Node* n1 = graph.NewNode(&dummy_operator); local
24 CHECK(n2->id() != n1->id());
30 Node* n1 = graph.NewNode(&dummy_operator); local
32 CHECK(n1->op() == &dummy_operator);
49 Node* n1 = graph.NewNode(&dummy_operator); local
50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
53 CHECK(n1 == n2->InputAt(1));
60 Node* n1 = graph.NewNode(&dummy_operator); local
61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1);
71 Node* n1 = graph.NewNode(&dummy_operator); local
84 Node* n1 = graph.NewNode(&dummy_operator, n0); local
95 Node* n1 = graph.NewNode(&dummy_operator); local
110 Node* n1 = graph.NewNode(&dummy_operator, n0); local
121 Node* n1 = graph.NewNode(&dummy_operator); local
135 Node* n1 = graph.NewNode(&dummy_operator, n0); local
161 Node* n1 = graph.NewNode(&dummy_operator, n0); local
183 Node* n1 = graph.NewNode(&dummy_operator); local
236 Node* n1 = graph.NewNode(&dummy_operator); local
254 Node* n1 = graph.NewNode(&dummy_operator, n0); local
284 Node* n1 = graph.NewNode(&dummy_operator, n0); local
302 Node* n1 = graph.NewNode(&dummy_operator, n0); local
345 Node* n1 = graph.NewNode(&dummy_operator, n0); local
366 Node* n1 = graph.NewNode(&dummy_operator, n0); local
403 Node* n1 = graph.NewNode(&dummy_operator, n0); local
421 Node* n1 = graph.NewNode(&dummy_operator, n0); local
444 Node* n1 = graph.NewNode(&dummy_operator, n0); local
480 Node* n1 = graph.NewNode(&dummy_operator, n0); local
485 n2->ReplaceUsesIf(FixedPredicate<true>(), n1); local
487 n2->ReplaceUsesIf(FixedPredicate<false>(), n1); local
491 n3->ReplaceUsesIf(FixedPredicate<true>(), n1); local
493 n3->ReplaceUsesIf(FixedPredicate<false>(), n1); local
498 n0->ReplaceUsesIf(FixedPredicate<false>(), n1); local
501 n0->ReplaceUsesIf(FixedPredicate<true>(), n1); local
509 n3->ReplaceUsesIf(FixedPredicate<true>(), n1); local
522 Node* n1 = graph.NewNode(&dummy_operator, n0); local
544 Node* n1 = graph.NewNode(&dummy_operator); local
562 Node* n1 = graph.NewNode(&dummy_operator, n0); local
571 Node* n1 = graph.NewNode(&dummy_operator, n0); local
579 Node* n1 = graph.NewNode(&dummy_operator); local
590 Node* n1 = graph.NewNode(&dummy_operator); local
601 Node* n1 = graph.NewNode(&dummy_operator); local
635 Node* n1 = graph.NewNode(&dummy_operator); local
645 Node* n1 = graph.NewNode(&dummy_operator); local
655 Node* n1 = graph.NewNode(&dummy_operator); local
671 Node* n1 = graph.NewNode(&dummy_operator); local
686 Node* n1 = graph.NewNode(&dummy_operator); local
731 Node* n1 = graph.NewNode(&dummy_operator); local
746 Node* n1 = graph.NewNode(&dummy_operator); local
760 Node* n1 = graph.NewNode(&dummy_operator); local
802 Node* n1 = graph.NewNode(&dummy_operator, n0); local
831 Node* n1 = graph.NewNode(&dummy_operator, n0); local
[all...]
H A Dtest-graph-reducer.cc201 Node* n1 = graph.NewNode(&OPA0); local
202 Node* end = graph.NewNode(&OPA1, n1);
209 recorder.CheckContains(n1);
217 Node* n1 = graph.NewNode(&OPA0); local
218 Node* n2 = graph.NewNode(&OPA1, n1);
219 Node* n3 = graph.NewNode(&OPA1, n1);
227 recorder.CheckContains(n1);
237 Node* n1 = graph.NewNode(&OPA0); local
238 Node* end = graph.NewNode(&OPA1, n1);
250 CHECK_EQ(&OPB0, n1
260 Node* n1 = graph.NewNode(&OPA0); local
290 Node* n1 = graph.NewNode(&OPA0); local
367 Node* n1 = nend->InputAt(0); local
378 Node* n1 = graph.NewNode(&OPA0); local
400 Node* n1 = graph.NewNode(&OPA0); local
430 Node* n1 = graph.NewNode(&OPA0); local
455 Node* n1 = graph.NewNode(&OPA0); local
490 Node* n1 = graph.NewNode(&OPA0); local
575 Node* n1 = end->InputAt(0); local
598 Node* n1 = graph.NewNode(&OPA0); local
645 Node* n1 = graph.NewNode(&OPA0); local
[all...]
/external/clang/test/CodeGen/
H A D2002-09-18-UnionProblem.c13 short __udivmodhi4 (char n1, char bm) { argument
18 rr.s.high = n1;
/external/v8/src/compiler/
H A Dgraph.h34 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); } argument
35 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, n
52 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6) argument
[all...]
H A Dvalue-numbering-reducer-unittest.cc41 Node* n1 = graph()->NewNode(&kOp0, na); local
43 EXPECT_FALSE(Reduce(n1).Changed());
50 Node* n1 = graph()->NewNode(&kOp1, n0); local
51 EXPECT_FALSE(Reduce(n1).Changed());
52 n1->Kill();
70 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); local
71 Reduction r1 = Reduce(n1);
80 EXPECT_EQ(n1, r2.replacement());
/external/clang/test/SemaCXX/
H A Dpr18284-crash-on-invalid.cpp4 namespace n1 { namespace
13 } // namespace n1
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/
H A Dsplice_after_flist.pass.cpp31 int n1 = 0; local
32 for (; n1 < p; ++n1, ++i)
33 assert(*i == t1[n1]);
36 for (; n1 < size_t1; ++n1, ++i)
37 assert(*i == t1[n1]);
/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/selinux/libsepol/src/
H A Debitmap.c20 ebitmap_node_t *n1, *n2, *new, *prev; local
24 n1 = e1->node;
27 while (n1 || n2) {
34 if (n1 && n2 && n1->startbit == n2->startbit) {
35 new->startbit = n1->startbit;
36 new->map = n1->map | n2->map;
37 n1 = n1->next;
39 } else if (!n2 || (n1
152 ebitmap_node_t *n1, *n2; local
202 ebitmap_node_t *n1, *n2; local
[all...]
/external/bzip2/
H A Dbzmore16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/
H A DTestDotTreeGenerator.cs68 + @" n1 [label=""*""];" + newline
69 + @" n1 [label=""*""];" + newline
74 + @" n0 -> n1 // """" -> ""*""" + newline
75 + @" n1 -> n2 // ""*"" -> ""3""" + newline
76 + @" n1 -> n3 // ""*"" -> ""x""" + newline
/external/clang/test/Sema/
H A Dattr-section.c13 __attribute__((section("NEAR,x"))) int n1; // expected-error {{'section' attribute only applies to functions and global variables}} local
/external/llvm/utils/
H A DGetRepositoryPath22 git remote -v | grep 'fetch' | awk '{ print $2 }' | head -n1
/external/iproute2/ip/
H A Drtmon.c34 struct nlmsghdr *n1 = (void*)buf; local
37 n1->nlmsg_type = 15;
38 n1->nlmsg_flags = 0;
39 n1->nlmsg_seq = 0;
40 n1->nlmsg_pid = 0;
41 n1->nlmsg_len = NLMSG_LENGTH(4*2);
43 ((__u32*)NLMSG_DATA(n1))[0] = tv.tv_sec;
44 ((__u32*)NLMSG_DATA(n1))[1] = tv.tv_usec;
45 fwrite((void*)n1, 1, NLMSG_ALIGN(n1
[all...]
/external/eigen/unsupported/Eigen/src/FFT/
H A Dei_fftw_impl.h82 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) { argument
83 if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
87 void inv2( complex_type * dst,complex_type * src,int n0,int n1) { argument
88 if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
124 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) { argument
125 if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
129 void inv2( complex_type * dst,complex_type * src,int n0,int n1) { argument
130 if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
165 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) { argument
166 if (m_plan==NULL) m_plan = fftwl_plan_dft_2d(n0,n1,sr
170 inv2( complex_type * dst,complex_type * src,int n0,int n1) argument
204 fwd2(Complex * dst, const Complex * src, int n0,int n1) argument
206 get_plan(n0,n1,false,dst,src).fwd2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local
225 inv2(Complex * dst, const Complex * src, int n0,int n1) argument
227 get_plan(n0,n1,true,dst,src).inv2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local
248 get_plan(int n0,int n1,bool inverse,void * dst,const void * src) argument
[all...]
/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>
230 * where <strong><code>n1</code></strong> is the size of first 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>
272 * where <strong><code>n1</code></strong> is the size of the first sample
309 * &nbsp;&nbsp; <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
311 * where <strong><code>n1</code></strong> is the size of the first sample;
350 * &nbsp;&nbsp;<code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
352 * where <strong><code>n1</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/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/clang/test/CodeGenCXX/
H A Dnested-base-member-access.cpp50 N n1; local
51 n1.PR();
/external/elfutils/src/libelf/
H A Delf32_fsize.c70 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
/external/skia/platform_tools/android/bin/
H A Dandroid_gdb_native48 GDB_COMMAND=$(command ls "$ANDROID_TOOLCHAIN"/*-gdb | head -n1)

Completed in 975 milliseconds

123456789