| /external/chromium/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/chromium_org/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/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());
|
| /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/jmonkeyengine/engine/src/test/jme3test/model/shape/ |
| TestBillboard.java | 85 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/libelf/ |
| elf32_fsize.c | 93 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
|
| /external/llvm/unittests/IR/ |
| MetadataTest.cpp | 92 MDNode *n2 = MDNode::get(Context, c1); local
93 Value *const c2 = n2;
98 EXPECT_NE(n1, n2);
105 EXPECT_EQ(n5, n2);
113 EXPECT_EQ(1u, n2->getNumOperands());
114 EXPECT_EQ(n1, n2->getOperand(0));
138 MDNode *n2 = MDNode::get(Context, V2); local
144 NMD->addOperand(n2);
|
| /external/icu4c/samples/uciter8/ |
| uciter8.c | 46 UCharIterator *iter2, const char *n2) {
54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
69 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2);
77 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
86 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));
96 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));
114 log_err("%s->move(start) failed\n", n2);
118 log_err("%s->hasNext() at the start returns FALSE\n", n2);
126 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
136 log_err("%s->hasNext() at the end returns TRUE\n", n2);
[all...] |
| /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]);
|
| /system/core/sh/ |
| parser.c | 152 union node *n1, *n2, *n3; local
160 n2 = andor();
163 if (n2->type == NCMD || n2->type == NPIPE) {
164 n2->ncmd.backgnd = 1;
165 } else if (n2->type == NREDIR) {
166 n2->type = NBACKGND;
170 n3->nredir.n = n2;
172 n2 = n3;
176 n1 = n2;
222 union node *n1, *n2, *n3; local
249 union node *n1, *n2, *pipenode; local
290 union node *n1, *n2; local
533 union node *n = NULL, *n2; local
[all...] |
| /external/chromium_org/chrome/browser/task_manager/ |
| task_manager_notification_browsertest.cc | 72 scoped_refptr<NotificationDelegate> del2(new MockNotificationDelegate("n2"));
73 Notification n2(
79 notifications->Add(n2, browser()->profile());
83 notifications->CancelById(n2.notification_id());
|
| /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;
|
| /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...] |
| /libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/ |
| SHA1withDSA_SignatureImpl.java | 201 int n, n1, n2; local
250 n2 = sBytes.length;
252 n2++;
255 signature = new byte[6 + n1 + n2]; // 48 is max. possible length of signature
257 signature[1] = (byte) (4 + n1 + n2); // total length of two INTEGERs
261 signature[5 + n1] = (byte) n2; // length of s
270 if (n2 == sBytes.length) {
323 int n1, n2; local
332 n2 = sigBytes[offset + n1 + 5];
336 || sigBytes[offset + 1] != (n1 + n2 + 4) || n1 > 2
[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/chromium_org/third_party/mesa/src/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/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...] |
| /frameworks/base/services/common_time/ |
| common_clock.cpp | 132 uint32_t n2 = 1000000 + cur_slew_; local
139 LinearTransform::reduce(&n2, &d1);
140 LinearTransform::reduce(&n2, &d2);
144 cur_trans_.a_to_b_numer = n1 * n2;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| ax25.h | 89 unsigned int n2, n2count; member in struct:ax25_info_struct_deprecated
99 unsigned int n2, n2count; member in struct:ax25_info_struct
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| ax25.h | 89 unsigned int n2, n2count; member in struct:ax25_info_struct_deprecated
99 unsigned int n2, n2count; member in struct:ax25_info_struct
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| ax25.h | 89 unsigned int n2, n2count; member in struct:ax25_info_struct_deprecated
99 unsigned int n2, n2count; member in struct:ax25_info_struct
|
| /external/chromium_org/chrome/android/javatests/src/org/chromium/chrome/browser/test/ |
| ProviderBookmarkNodeTest.java | 107 private static boolean isSameHierarchyDownwards(BookmarkNode n1, BookmarkNode n2) {
108 if (n1 == null && n2 == null) return true;
109 if (n1 == null || n2 == null) return false;
110 if (!n1.equalContents(n2)) return false;
112 if (!isSameHierarchyDownwards(n1.children().get(i), n2.children().get(i))) return false;
|
