Searched refs:n1 (Results 101 - 125 of 311) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/libvpx/source/libvpx/build/make/
H A Dversion.sh36 changelog_version=`head -n1 "${p}/CHANGELOG" | awk '{print $2}'`
/external/chromium_org/ui/message_center/
H A Dnotification_list.h38 bool operator()(Notification* n1, Notification* n2);
42 bool operator()(Notification* n1, Notification* n2);
/external/clang/test/CodeGenCXX/
H A Dconstructor-init.cpp60 N n1; local
61 n1.PR();
/external/libvpx/libvpx/build/make/
H A Dversion.sh36 changelog_version=`head -n1 "${p}/CHANGELOG" | awk '{print $2}'`
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-node-algorithm.cc160 Node* n1 = graph.NewNode(&dummy_operator, n0); local
161 Node* n2 = graph.NewNode(&dummy_operator, n1);
171 CHECK(n1->id() == node_visitor.nodes_[1]->id());
219 Node* n1 = graph.NewNode(&dummy_operator, n0); local
236 CHECK(n1->id() == visitor.edges_[0].second);
237 CHECK(n1->id() == visitor.nodes_[1]);
239 CHECK(-n1->id() == visitor.edges_[1].second);
252 CHECK(n1->id() == visitor.edges_[5].second);
253 CHECK(n1->id() == visitor.nodes_[5]);
255 CHECK(-n1
[all...]
H A Dtest-schedule.cc35 Node* n1 = graph.NewNode(&dummy_operator); local
41 schedule.AddNode(entry, n1);
44 CHECK_EQ(entry, schedule.block(n1));
45 CHECK(schedule.SameBasicBlock(n0, n1));
/external/qemu/slirp/
H A Dtcp_subr.c612 u_int n1, n2, n3, n4, n5, n6; local
641 if (sscanf(so_rcv->sb_data, "%u%*[ ,]%u", &n1, &n2) == 2) {
642 HTONS(n1);
649 tmpso->so_fport == n1) {
659 "%d,%d\r\n", n1, n2);
970 &n1, &n2, &n3, &n4, &n5, &n6, buff);
974 laddr = htonl((n1 << 24) | (n2 << 16) | (n3 << 8) | (n4));
987 n1 = ((laddr >> 24) & 0xff);
995 n1, n2, n3, n4, n5, n6, x==7?buff:"");
1002 &n1,
[all...]
/external/bzip2/
H A Dhuffman.c72 Int32 nNodes, nHeap, n1, n2, i, j, k; local
101 n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
104 parent[n1] = parent[n2] = nNodes;
105 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
/external/chromium_org/build/
H A Dtree_truth.sh21 ( cd $1 && git log HEAD -n1 --format='%H' | cat )
/external/chromium_org/third_party/WebKit/Source/core/xml/
H A DXPathParser.cpp244 String n1; local
245 if (!lexNCName(n1))
253 name = n1;
261 name = n1 + ":" + n2;
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
H A Dp5.cpp3 alignas(1) int n1; // expected-error {{requested alignment is less than minimum alignment of 4 for type 'int'}} variable
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
H A Dp3-0x.cpp43 int n1 = f(i); member in namespace:std_example
/external/clang/test/Modules/
H A Dmacros2.c68 int n1 = TOP_OTHER_REDEF1; // expected-warning{{ambiguous expansion of macro 'TOP_OTHER_REDEF1'}} variable
/external/clang/tools/diag-build/
H A Ddiag-build.sh103 head -n1 |
/external/ltrace/testsuite/ltrace.main/
H A Dsystem_calls.exp98 set n1 [GetDefault $d1 $key 0]
100 set sum [expr $n1 - $n2]
/external/qemu/slirp-android/
H A Dtcp_subr.c767 u_int n1, n2, n3, n4, n5, n6; local
795 if (sscanf(so_rcv->sb_data, "%u%*[ ,]%u", &n1, &n2) == 2) {
801 tmpso->so_faddr_port == n1) {
810 "%d,%d\r\n", n1, n2);
825 &n1, &n2, &n3, &n4, &n5, &n6, buff);
829 laddr = (n1 << 24) | (n2 << 16) | (n3 << 8) | (n4);
842 n1 = ((laddr >> 24) & 0xff);
850 n1, n2, n3, n4, n5, n6, x==7?buff:"");
857 &n1, &n2, &n3, &n4, &n5, &n6, buff);
861 laddr = (n1 << 2
[all...]
/external/chromium_org/chrome/browser/undo/
H A Dbookmark_undo_service_test.cc114 const BookmarkNode* n1 = model->AddURL(model->other_node(), local
119 model->SetTitle(n1, ASCIIToUTF16("bar"));
120 model->SetURL(n1, GURL("http://www.bar.com"));
150 const BookmarkNode* n1 = model->AddURL(model->other_node(), local
162 model->Move(n1, model->other_node(), 3);
166 EXPECT_EQ(model->other_node()->GetChild(0), n1);
174 EXPECT_EQ(model->other_node()->GetChild(2), n1);
183 const BookmarkNode* n1 = model->AddURL(model->other_node(), local
202 EXPECT_EQ(model->other_node()->GetChild(0), n1);
211 EXPECT_EQ(model->other_node()->GetChild(0), n1);
[all...]
/external/opencv/cvaux/src/
H A Dcvhmmobs.cpp136 int n1 = dctSize.height, m1 = n1 / 2; local
182 if( n1 & 1 )
192 float t1 = img[x + (n1 - 1 - j) * imgStep];
220 if( n1 & 1 )
331 int n1 = dctSize.height, m1 = n1 / 2; local
379 if( n1 & 1 )
389 float t1 = img[x + (n1 - 1 - j) * imgStep];
417 if( n1
[all...]
/external/stlport/src/c_locale_dummy/
H A Dc_locale_dummy.c293 const char* s1, size_t n1, const char* s2, size_t n2) {
296 while (n1 > 0 || n2 > 0) {
297 size_t bufsize1 = n1 < 63 ? n1 : 63;
304 s1 += bufsize1; n1 -= bufsize1;
313 const wchar_t* s1, size_t n1, const wchar_t* s2, size_t n2) {
316 while (n1 > 0 || n2 > 0) {
317 size_t bufsize1 = n1 < 63 ? n1 : 63;
324 s1 += bufsize1; n1
292 _Locale_strcmp(struct _Locale_collate* lcol UNUSED, const char* s1, size_t n1, const char* s2, size_t n2) argument
312 _WLocale_strcmp(struct _Locale_collate* lcol UNUSED, const wchar_t* s1, size_t n1, const wchar_t* s2, size_t n2) argument
[all...]
/external/stlport/src/c_locale_glibc/
H A Dc_locale_glibc2.c363 const char *s1, size_t n1,
367 while (n1 > 0 || n2 > 0) {
368 size_t bufsize1 = n1 < 63 ? n1 : 63;
375 s1 += bufsize1; n1 -= bufsize1;
383 const wchar_t *s1, size_t n1,
387 while (n1 > 0 || n2 > 0) {
388 size_t bufsize1 = n1 < 63 ? n1 : 63;
395 s1 += bufsize1; n1
362 _Locale_strcmp(struct _Locale_collate * __loc, const char *s1, size_t n1, const char *s2, size_t n2) argument
382 _WLocale_strcmp(struct _Locale_collate *__loc, const wchar_t *s1, size_t n1, const wchar_t *s2, size_t n2) argument
[all...]
/external/chromium_org/third_party/icu/source/test/cintltst/
H A Dcustrtst.c1192 compareIterators(UCharIterator *iter1, const char *n1, argument
1201 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
1210 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
1224 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
1233 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));
1243 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));
1251 log_err("%s->move(start) failed\n", n1);
1255 log_err("%s->hasNext() at the start returns FALSE\n", n1);
1273 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
1279 log_err("%s->hasNext() at the end returns TRUE\n", n1);
1544 compareIterNoIndexes(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2, int32_t middle) argument
[all...]
/external/chromium_org/base/third_party/nspr/
H A Dprtime.cc902 int n1, n2, n3; local
911 n1 = (*s++ - '0'); /* first 1, 2 or 4 digits */
914 n1 = n1*10 + (*s++ - '0');
918 n1 = n1*10 + (*s++ - '0');
921 n1 = n1*10 + (*s++ - '0');
969 if (n1 > 31 || n1
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DTreeWizard.cs435 int n1 = adaptor.GetChildCount(t1);
437 if (n1 != n2) {
440 for (int i = 0; i < n1; i++) {
514 int n1 = adaptor.GetChildCount(t1);
516 if (n1 != n2) {
519 for (int i = 0; i < n1; i++) {
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DTreeWizard.cs499 int n1 = adaptor.GetChildCount( t1 );
501 if ( n1 != n2 )
505 for ( int i = 0; i < n1; i++ )
588 int n1 = adaptor.GetChildCount( t1 );
590 if ( n1 != n2 )
594 for ( int i = 0; i < n1; i++ )
/external/antlr/antlr-3.4/runtime/Python/antlr3/
H A Dtreewizard.py567 n1 = self.adaptor.getChildCount(t1)
569 if n1 != n2:
572 for i in range(n1):
608 n1 = adaptor.getChildCount(t1)
610 if n1 != n2:
613 for i in range(n1):

Completed in 2915 milliseconds

1234567891011>>