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

1234567891011>>

/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.awk29 n1[1] = "SIG_IGN, \\[HUP INT\\], SA_RESTORER\\|SA_RESTART, 0x[0-9a-f]+"
32 n1[2] = "0x[0-9a-f]+, \\[QUIT TERM\\], SA_RESTORER\\|SA_SIGINFO, 0x[0-9a-f]+"
35 n1[3] = "SIG_DFL, \\[\\], SA_RESTORER, 0x[0-9a-f]+"
38 n1[4] = "SIG_DFL, ~\\[HUP( ((RT|SIGRT)[^] ]+|[3-9][0-9]|1[0-9][0-9]))*\\], SA_RESTORER, 0x[0-9a-f]+"
44 o1[i] = n1[i - 1]
54 "\\{" n1[i] "\\}, \\{" o1[i] "\\}, " a1 "|" \
/external/v8/test/cctest/compiler/
H A Dtest-node.cc148 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
152 CHECK_USES(n0, n1, n2);
154 CHECK_INPUTS(n1, n0);
160 CHECK_USES(n1, NONE);
162 CHECK_USES(n3, n1, n2);
164 CHECK_INPUTS(n1, n3);
174 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
176 CHECK_USES(n0, n1);
177 CHECK_USES(n1, NONE);
179 n1
199 Node* n1 = graph.NewNode(&dummy_operator0); local
228 Node* n1 = graph.NewNode(&dummy_operator0); local
246 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
278 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
301 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
330 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
361 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
384 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
412 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
436 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
465 Node* n1 = graph.NewNode(&dummy_operator0); local
485 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
493 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
501 Node* n1 = graph.NewNode(&dummy_operator0); local
511 Node* n1 = graph.NewNode(&dummy_operator0); local
521 Node* n1 = graph.NewNode(&dummy_operator0); local
554 Node* n1 = graph.NewNode(&dummy_operator0); local
566 Node* n1 = graph.NewNode(&dummy_operator0); local
576 Node* n1 = graph.NewNode(&dummy_operator0); local
590 Node* n1 = graph.NewNode(&dummy_operator0); local
604 Node* n1 = graph.NewNode(&dummy_operator0); local
649 Node* n1 = graph.NewNode(&dummy_operator0); local
662 Node* n1 = graph.NewNode(&dummy_operator0); local
675 Node* n1 = graph.NewNode(&dummy_operator0); local
719 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
748 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
[all...]
/external/opencv3/modules/calib3d/src/
H A Ddls.h163 int n1 = nn - 1; local
185 while (n1 >= low) {
188 int l = n1;
203 if (l == n1) {
204 H[n1][n1] = H[n1][n1] + exshift;
205 d[n1] = H[n1][n
[all...]
/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/unittests/compiler/
H A Dnode-unittest.cc49 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
51 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1));
52 EXPECT_EQ(0, n1->UseCount());
53 EXPECT_EQ(1, n1->InputCount());
54 EXPECT_EQ(n0, n1->InputAt(0));
55 Node* n0_n1[] = {n0, n1};
58 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2));
59 EXPECT_THAT(n1->uses(), UnorderedElementsAre(n2));
62 EXPECT_EQ(n1, n2->InputAt(1));
74 Node* n1 local
81 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
96 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
103 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
113 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
137 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
153 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
159 node->AppendInput(zone(), n1); local
165 node->AppendInput(zone(), n1); local
172 Node* n1 = Node::New(zone(), 1, &kOp0, 0, nullptr, false); local
192 node->AppendInput(zone(), n1); local
242 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); 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/testng/src/test/java/test/tmp/
H A DTest_TestListenerAppender.java15 public void verifyData1(String n1, Integer n2) { argument
16 System.out.println(n1 + " " + n2);
/external/opencv3/modules/photo/src/
H A Darrays.hpp54 int n1,n2; member in struct:cv::Array2d
58 a(array2d.a), n1(array2d.n1), n2(array2d.n2), needToDeallocArray(false)
67 a(_a), n1(_n1), n2(_n2), needToDeallocArray(false)
72 n1(_n1), n2(_n2), needToDeallocArray(true)
74 a = new T[n1*n2];
98 int n1,n2,n3; member in struct:cv::Array3d
102 a(_a), n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(false)
107 n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(true)
109 a = new T[n1*n
134 int n1,n2,n3,n4; member in struct:cv::Array4d
[all...]
/external/opencv3/modules/core/src/
H A Dlda.cpp325 int n1 = nn - 1; local
347 while (n1 >= low) {
350 int l = n1;
365 if (l == n1) {
366 H[n1][n1] = H[n1][n1] + exshift;
367 d[n1] = H[n1][n
[all...]
/external/chromium-trace/catapult/telemetry/telemetry/util/
H A Dcolor_histogram.py27 n1 = sum_func(hist1)
29 if (n1 == 0 or n2 == 0) and default_color is None:
31 if n1 == 0:
33 n1 = 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/clang/test/SemaCXX/
H A Dpr18284-crash-on-invalid.cpp4 namespace n1 { namespace
13 } // namespace n1
/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
229 ebitmap_node_t *n1 = e1->node; local
[all...]
/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/opencv3/modules/cudev/include/opencv2/cudev/functional/
H A Dtuple_adapter.hpp78 template <class Op, int n0, int n1> struct BinaryTupleAdapter
87 return op(get<n0>(t), get<n1>(t));
91 template <int n0, int n1, class Op>
92 __host__ __device__ BinaryTupleAdapter<Op, n0, n1> binaryTupleAdapter(const Op& op)
94 BinaryTupleAdapter<Op, n0, n1> a;
/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/vulkan-validation-layers/tests/gtest-1.7.0/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/webrtc/webrtc/system_wrappers/include/
H A Dntp_time.h55 inline bool operator==(const NtpTime& n1, const NtpTime& n2) { argument
56 return n1.seconds() == n2.seconds() && n1.fractions() == n2.fractions();
58 inline bool operator!=(const NtpTime& n1, const NtpTime& n2) { argument
59 return !(n1 == n2);
/external/bzip2/
H A Dbzmore16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
/external/elfutils/libelf/
H A Delf32_fsize.c67 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
/external/v8/src/compiler/
H A Dgraph.h67 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); } argument
68 Node* NewNode(const Operator* op, Node* n1, Node* n2) { argument
69 Node* nodes[] = {n1, n2};
72 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument
73 Node* nodes[] = {n1, n2, n3};
76 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument
77 Node* nodes[] = {n1, n2, n3, n4};
80 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
82 Node* nodes[] = {n1, n
85 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6) argument
90 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7) argument
95 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8) argument
100 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) argument
[all...]
/external/v8/test/mjsunit/compiler/
H A Dosr-infinite.js25 function n1() { function
72 test(n1);
/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

Completed in 1209 milliseconds

1234567891011>>