| /external/clang/test/Sema/ |
| attr-section.c | 14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| sample3_unittest.cc | 105 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/ |
| sample3_unittest.cc | 105 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/v8/src/compiler/ |
| graph.h | 49 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
50 Node* nodes[] = {n1, n2};
53 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
54 Node* nodes[] = {n1, n2, n3};
57 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
58 Node* nodes[] = {n1, n2, n3, n4};
61 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
63 Node* nodes[] = {n1, n2, n3, n4, n5};
66 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
68 Node* nodes[] = {n1, n2, n3, n4, n5, n6}
[all...] |
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| sample3_unittest.cc | 105 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());
|
| /libcore/ojluni/src/main/java/sun/misc/ |
| ASCIICaseInsensitiveComparator.java | 41 int n1=s1.length(), n2=s2.length(); local
42 int minLen = n1 < n2 ? n1 : n2;
55 return n1 - n2;
|
| /ndk/sources/third_party/googletest/googletest/samples/ |
| sample3_unittest.cc | 105 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/ |
| BigIntegerMathBenchmark.java | 68 * Returns the product of {@code n1} exclusive through {@code n2} inclusive.
70 private static BigInteger oldSlowFactorial(int n1, int n2) {
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/v8/test/unittests/compiler/ |
| node-unittest.cc | 56 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local
58 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2));
59 EXPECT_THAT(n1->uses(), UnorderedElementsAre(n2));
60 EXPECT_EQ(2, n2->InputCount());
61 EXPECT_EQ(n0, n2->InputAt(0));
62 EXPECT_EQ(n1, n2->InputAt(1));
83 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local
84 EXPECT_THAT(n2->inputs(), ElementsAre(n0, n1));
105 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local
106 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2));
118 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local
139 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local
173 Node* n2 = Node::New(zone(), 2, &kOp0, 0, nullptr, false); local
196 node->AppendInput(zone(), n2); local
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/ld128/ |
| s_expl.c | 205 int k, n, n2; local
268 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */
276 n2 = (unsigned)n % INTERVALS;
289 * expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2).
295 t = tbl[n2].lo + tbl[n2].hi;
298 t = SUM2P(tbl[n2].hi - 1, tbl[n2].lo * (r1 + 1) + t * q +
299 tbl[n2].hi * r1)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/ |
| TTestImpl.java | 228 * <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 * <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
273 * <strong><code> n2</code></strong> is the size of the second sample;
309 * <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
312 * <strong><code> n2</code></strong> is the size of the second sample;
350 * <code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
353 * <strong><code> n2</code></strong> is the size of second sample
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_object_graph.py | 51 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"
[all...] |
| /external/testng/src/main/java/org/testng/ |
| SuiteResult.java | 54 String n2 = other.getTestContext().getName(); local
55 result = n1.compareTo(n2);
|
| /external/icu/icu4c/source/samples/uciter8/ |
| uciter8.c | 44 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);
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_flist.pass.cpp | 34 for (int n2 = 0; n2 < l; ++n2, ++i)
35 assert(*i == t2[n2]);
|
| /external/opencv3/modules/photo/test/ |
| test_inpaint.cpp | 95 double n2 = cvtest::norm(diff2.reshape(1), NORM_INF, inv_mask.reshape(1)); local
97 if (n1 != 0 || n2 != 0)
107 n2 = cvtest::norm(diff2.reshape(1), NORM_INF, mask.reshape(1));
110 if (n1 > jpeg_thres || n2 > jpeg_thres)
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_flist.pass.cpp | 34 for (int n2 = 0; n2 < l; ++n2, ++i)
35 assert(*i == t2[n2]);
|
| /ndk/sources/host-tools/toolbox/ |
| cmp_win.c | 70 int n1, n2, ret = 0; local
73 n2 = fread(buf2, 1, BUFSIZE, f2);
74 ret = (n1 != n2) || memcmp(buf1, buf2, n1) != 0;
|
| /external/toybox/toys/other/ |
| xxd.c | 98 int n1, n2; local
101 if ((n1 = n2 = dehex(fgetc(fp))) < 0 || (n2 = dehex(fgetc(fp))) < 0) {
103 if (n1 == -2 || n2 == -2) continue;
108 fputc((n1 << 4) | (n2 & 0xf), stdout);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
| test_pytree.py | 134 n2 = pytree.Node(1000, [n1, l3])
138 self.assertEqual(n2.get_suffix(), "")
142 n2 = pytree.Node(1000, [], context=(" ", (1, 0)))
143 self.assertEqual(n1, n2)
151 n2 = pytree.Node(1000, [l2])
152 self.assertEqual(n1, n2)
185 n2 = pytree.Node(1000, [l1, l2])
187 n1 = pytree.Node(1000, [n2, n3])
194 n2 = pytree.Node(1000, [l1, l2])
196 n1 = pytree.Node(1000, [n2, n3]
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
| test_pytree.py | 134 n2 = pytree.Node(1000, [n1, l3])
138 self.assertEqual(n2.get_suffix(), "")
142 n2 = pytree.Node(1000, [], context=(" ", (1, 0)))
143 self.assertEqual(n1, n2)
151 n2 = pytree.Node(1000, [l2])
152 self.assertEqual(n1, n2)
185 n2 = pytree.Node(1000, [l1, l2])
187 n1 = pytree.Node(1000, [n2, n3])
194 n2 = pytree.Node(1000, [l1, l2])
196 n1 = pytree.Node(1000, [n2, n3]
[all...] |
| /external/libvorbis/lib/ |
| mdct.c | 57 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/ |
| NumberFormatTest.java | 183 Number n1, n2; local
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 = null
[all...] |
| /external/mesa3d/src/mesa/program/ |
| register_allocate.c | 296 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
298 g->nodes[n1].adjacency[n2] = GL_TRUE;
299 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
336 unsigned int n1, unsigned int n2)
338 if (!g->nodes[n1].adjacency[n2]) {
339 ra_add_node_adjacency(g, n1, n2);
340 ra_add_node_adjacency(g, n2, n1);
351 unsigned int n2 = g->nodes[n].adjacency_list[j]; local
352 unsigned int n2_class = g->nodes[n2].class;
354 if (n != n2 && !g->nodes[n2].in_stack)
427 unsigned int n2 = g->nodes[n].adjacency_list[i]; local
516 unsigned int n2 = g->nodes[n].adjacency_list[j]; local
[all...] |
| /external/aac/libSYS/include/ |
| genericStds.h | 172 #define C_ALLOC_MEM2(name,type,n1,n2) \
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) \
185 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKaalloc((n1)*sizeof(type), ALIGNMENT_DEFAULT)); } \
187 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type) + ALIGNMENT_DEFAULT + sizeof(void *)) * (n2); }
196 #define C_ALLOC_MEM2_L(name,type,n1,n2,s) \
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)
[all...] |
