Searched refs:n1 (Results 151 - 175 of 311) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/mips/dspr2/
H A Dvp9_convolve2_avg_horiz_dspr2.c129 uint32_t p1, p2, p3, p4, n1; local
255 [n1] "=&r" (n1),
/external/icu/icu4c/source/i18n/
H A Dgregoimp.cpp109 int32_t n1 = ClockMath::floorDivide(doy, 365, doy); local
110 year = 400*n400 + 100*n100 + 4*n4 + n1;
111 if (n100 == 4 || n1 == 4) {
/external/libvpx/libvpx/vp9/common/mips/dspr2/
H A Dvp9_convolve2_avg_horiz_dspr2.c129 uint32_t p1, p2, p3, p4, n1; local
255 [n1] "=&r" (n1),
/external/chromium_org/chrome/browser/notifications/
H A Dmessage_center_settings_controller.cc104 bool operator() (Notifier* n1, Notifier* n2) { argument
106 collator_, n1->name, n2->name) == UCOL_LESS;
113 bool SimpleCompareNotifiers(Notifier* n1, Notifier* n2) { argument
114 return n1->name < n2->name;
/external/chromium_org/components/bookmarks/browser/
H A Dbookmark_utils.h78 // Returns true if |n1| was added more recently than |n2|.
79 bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2);
H A Dbookmark_model.h294 bool operator()(const BookmarkNode* n1, const BookmarkNode* n2) const { argument
295 return n1->url() < n2->url();
H A Dbookmark_model.cc58 // Returns true if |n1| preceeds |n2|.
59 bool operator()(const BookmarkPermanentNode* n1, argument
61 bool n1_visible = client_->IsPermanentNodeVisible(n1);
78 // Returns true if |n1| preceeds |n2|.
79 bool operator()(const BookmarkNode* n1, const BookmarkNode* n2) { argument
80 if (n1->type() == n2->type()) {
83 return n1->GetTitle() < n2->GetTitle();
85 collator_, n1->GetTitle(), n2->GetTitle()) == UCOL_LESS;
88 return n1->is_folder();
/external/chromium_org/courgette/
H A Danalyze_stress_test25 | tail -n1)
/external/chromium_org/tools/telemetry/telemetry/core/
H A Dbitmap.py39 n1 = sum(hist1)
41 if n1 == 0:
49 remainder += value1 * n2 - value2 * n1
54 return abs(float(total) / n1 / n2)
/external/clang/test/Modules/
H A Dmacros.c155 int n1 = TOP_OTHER_REDEF1; // expected-warning{{ambiguous expansion of macro 'TOP_OTHER_REDEF1'}} variable
/external/clang/test/Sema/
H A Dstruct-packed-align.c130 extern int n1[sizeof(struct nS) == 9 ? 1 : -1];
/external/icu/icu4c/source/test/cintltst/
H A Dcustrtst.c1188 compareIterators(UCharIterator *iter1, const char *n1, argument
1197 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
1206 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
1220 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
1229 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));
1239 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));
1247 log_err("%s->move(start) failed\n", n1);
1251 log_err("%s->hasNext() at the start returns FALSE\n", n1);
1269 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
1275 log_err("%s->hasNext() at the end returns TRUE\n", n1);
[all...]
H A Dputiltst.c51 double n1=0.0, y1=0.0, expn1, expy1; local
57 y1 = uprv_modf(value1, &n1);
60 if(y1 != expy1 || n1 != expn1){
62 expn1, n1, expy1, y1);
65 log_verbose("[float] x = %f n = %f y = %f\n", value1, n1, y1);
/external/sqlite/android/
H A Dsqlite3_android.cpp37 static int collate16(void *p, int n1, const void *v1, int n2, const void *v2) argument
40 UCollationResult result = ucol_strcoll(coll, (const UChar *) v1, n1,
52 static int collate8(void *p, int n1, const void *v1, int n2, const void *v2) argument
58 uiter_setUTF8(&i1, (const char *) v1, n1);
/external/chromium_org/ui/message_center/
H A Dnotification_list_unittest.cc650 const Notification* n1 = GetNotification(id1); local
651 EXPECT_FALSE(n1->shown_as_popup());
652 EXPECT_TRUE(n1->IsRead());
656 n1 = GetNotification(id1);
657 EXPECT_TRUE(n1->shown_as_popup());
658 EXPECT_TRUE(n1->IsRead());
672 n1 = GetNotification(id1);
673 EXPECT_TRUE(n1 == NULL);
/external/fio/t/
H A Dgenzipf.c165 const struct node *n1 = p1; local
168 return n2->hits - n1->hits;
/external/valgrind/main/auxprogs/
H A Dvalgrind-di-server.c443 static Frame* mk_Frame_le64 ( const HChar* tag, ULong n1 )
450 write_ULong_le(&f->data[4 + 0*8], n1);
454 static Frame* mk_Frame_le64_le64 ( const HChar* tag, ULong n1, ULong n2 ) argument
461 write_ULong_le(&f->data[4 + 0*8], n1);
467 /*OUT*/ULong* n1, /*OUT*/ULong* n2,
475 *n1 = read_ULong_le(&fr->data[4 + 0*8]);
483 ULong n1, ULong n2, ULong n3, ULong n_data,
491 write_ULong_le(&f->data[4 + 0*8], n1);
466 parse_Frame_le64_le64_le64( Frame* fr, const HChar* tag, ULong* n1, ULong* n2, ULong* n3 ) argument
481 mk_Frame_le64_le64_le64_bytes( const HChar* tag, ULong n1, ULong n2, ULong n3, ULong n_data, UChar** data ) argument
/external/chromium_org/third_party/icu/source/test/cintltst/
H A Dputiltst.c51 double n1=0.0, y1=0.0, expn1, expy1; local
57 y1 = uprv_modf(value1, &n1);
60 if(y1 != expy1 || n1 != expn1){
62 expn1, n1, expy1, y1);
65 log_verbose("[float] x = %f n = %f y = %f\n", value1, n1, y1);
/external/opencv/ml/src/
H A Dmlboost.cpp213 int n1 = node->get_num_valid(vi); local
215 assert( 0 <= split_point && split_point < n1-1 );
226 for( ; i < n1; i++ )
251 int n1 = node->get_num_valid(vi); local
260 for( i = n1; i < n; i++ )
275 for( i = 0; i < n1 - 1; i++ )
300 for( i = 0; i < n1 - 1; i++ )
447 int n1 = node->get_num_valid(vi); local
453 for( i = n1; i < n; i++ )
462 for( i = 0; i < n1
577 int n1 = node->get_num_valid(vi); local
[all...]
/external/openssl/crypto/ec/
H A Dectest.c198 BIGNUM *n1, *n2, *order; local
204 n1 = BN_new(); n2 = BN_new(); order = BN_new();
225 if (!BN_set_word(n1, i)) ABORT;
228 if (!EC_POINT_mul(group, P, n1, NULL, NULL, ctx)) ABORT;
230 if (!BN_one(n1)) ABORT;
231 /* n1 = 1 - order */
232 if (!BN_sub(n1, n1, order)) ABORT;
233 if (!EC_POINT_mul(group, Q, NULL, P, n1, ctx)) ABORT;
242 if (!BN_mul(n2, n1, n
[all...]
/external/qemu/block/
H A Dqcow2.c317 int n1; local
321 n1 = 0;
323 n1 = bs->total_sectors - sector_num;
324 memset(buf + n1 * 512, 0, 512 * (nb_sectors - n1));
325 return n1;
387 int index_in_cluster, n1; local
429 n1 = qcow2_backing_read1(bs->backing_hd, acb->sector_num,
431 if (n1 > 0) {
/external/chromium_org/testing/gtest/test/
H A Dgtest_output_test_.cc261 // waits for n1 | SCOPED_TRACE("Trace B");
263 // | notifies n1
281 Notification n1; member in struct:CheckPoints
291 check_points->n1.Notify();
309 check_points.n1.WaitForNotification();
/external/chromium_org/v8/test/mjsunit/
H A Djson.js32 var n1 = new Date(10000);
33 n1.toISOString = function () { return "foo"; };
34 assertEquals("foo", n1.toJSON());
/external/glide/third_party/gif_decoder/src/main/java/com/bumptech/glide/gifdecoder/
H A DGifDecoder.java354 int n1 = (previousFrame.iy + i) * header.width + previousFrame.ix;
355 int n2 = n1 + previousFrame.iw;
356 for (int k = n1; k < n2; k++) {
/external/gtest/test/
H A Dgtest_output_test_.cc256 // waits for n1 | SCOPED_TRACE("Trace B");
258 // | notifies n1
276 Notification n1; member in struct:CheckPoints
286 check_points->n1.Notify();
304 check_points.n1.WaitForNotification();

Completed in 2855 milliseconds

1234567891011>>