/external/opencv/cxcore/src/ |
H A D | cxmeansdv.cpp | 312 #define ICV_MEAN_SDV_EXIT_CN( total, sqtotal, idx ) \ 314 mean[idx] = tmp = scale*(double)total##idx; \ 318 #define ICV_MEAN_SDV_EXIT_C1( total, sqtotal ) \ 320 ICV_MEAN_SDV_EXIT_CN( total, sqtotal, 0 ) 322 #define ICV_MEAN_SDV_EXIT_C2( total, sqtotal ) \ 324 ICV_MEAN_SDV_EXIT_CN( total, sqtotal, 0 ); \ 325 ICV_MEAN_SDV_EXIT_CN( total, sqtotal, 1 ) 327 #define ICV_MEAN_SDV_EXIT_C3( total, sqtotal ) \ 329 ICV_MEAN_SDV_EXIT_CN( total, sqtotal, 0 ); \ 330 ICV_MEAN_SDV_EXIT_CN( total, sqtota [all...] |
/external/valgrind/massif/tests/ |
H A D | basic.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 52 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 68 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 84 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 98 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 114 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 130 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 146 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
H A D | long-names.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 49 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
H A D | new-cpp.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 54 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
H A D | overloaded-new.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 54 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
|
H A D | long-time.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 48 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 62 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 89 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 100 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 115 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 130 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 141 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 157 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) 175 n time(B) total( [all...] |
/external/webrtc/src/common_audio/vad/ |
H A D | vad_core.h | 46 WebRtc_Word16 total[3]; member in struct:VadInstT_
|
/external/zlib/src/examples/ |
H A D | gun.c | 115 output file, a running CRC-32 check on the output and the total number of 121 int check; /* true if checking crc and total */ 123 unsigned long total; member in struct:outd 126 /* Write output buffer and update the CRC-32 and total bytes written. write() 138 me->total += len; 470 outd.total = 0; 494 if (NEXT() != (int)(outd.total & 0xff) || 495 NEXT() != (int)((outd.total >> 8) & 0xff) || 496 NEXT() != (int)((outd.total >> 16) & 0xff) || 497 NEXT() != (int)((outd.total >> 2 [all...] |
/external/zlib/src/test/ |
H A D | infcover.c | 27 and high water mark of total bytes requested, optionally set a limit on the 28 total memory that can be allocated, and when done check for memory leaks. 36 mem_limit(&strm, limit) sets a limit on the total bytes requested -- a 41 mem_used(&strm, "msg") prints to stderr "msg" and the total bytes used 65 size_t total, highwater; /* total allocations, and largest total */ member in struct:mem_zone 79 if (zone == NULL || (zone->limit && zone->total + len > zone->limit)) 103 zone->total += item->size; 104 if (zone->total > zon [all...] |
/external/freetype/src/cache/ |
H A D | ftcsbits.c | 219 FT_UInt total; local 223 total = clazz->family_get_count( family, cache->manager ); 224 if ( total == 0 || gindex >= total ) 236 count = total - start;
|
/external/jetty/src/java/org/eclipse/jetty/io/ |
H A D | ByteArrayBuffer.java | 388 int len=0, total=0, available=max; 389 while (total<max) 397 total += len; 404 if (len<0 && total==0) 406 return total;
|
/external/jmonkeyengine/engine/src/core-plugins/com/jme3/asset/plugins/ |
H A D | HttpZipLocator.java | 243 int total = 0; 245 while (total < length) { 246 int read = source.read(array, total, length - total); 250 total += read;
|
/external/opencv/cvaux/src/ |
H A D | cvfacedetection.cpp | 263 cr.iContourLength = external->total; 275 cr.iContourLength = internal->total; 310 for (int i = 0; i < m_seqRects->total; i++) 325 for (int j = 0; j < m_seqRects->total; j++) 388 for (int i = 0; i < m_seqRects->total; i++)
|
/external/skia/src/core/ |
H A D | SkShader.cpp | 65 SkMatrix total; local 66 total.setConcat(*rec.fMatrix, fLocalMatrix); 68 const SkMatrix* m = &total; 70 total.setConcat(*m, *rec.fLocalMatrix); 71 m = &total;
|
/external/blktrace/ |
H A D | blkparse.c | 1771 struct io_stats total, *ios; local 1780 memset(&total, 0, sizeof(total)); 1791 total.qreads += ios->qreads; 1792 total.qwrites += ios->qwrites; 1793 total.creads += ios->creads; 1794 total.cwrites += ios->cwrites; 1795 total.mreads += ios->mreads; 1796 total.mwrites += ios->mwrites; 1797 total [all...] |
/external/opencv/cv/src/ |
H A D | cvhough.cpp | 100 int total = 0; local 150 sort_buf[total++] = base; 154 icvHoughSortDescent32s( sort_buf, total, accum ); 156 // stage 4. store the first min(total,linesMax) lines to the output buffer 157 linesMax = MIN(linesMax, total); 457 if( lines->total >= linesMax ) 552 count = seq->total; 719 if( lines->total >= linesMax ) 799 linesMax = lines->total; 831 mat->cols = lines->total; [all...] |
H A D | cvapprox.cpp | 82 buffer_size = (chain->total + 8) * sizeof( _CvPtInfo ); 95 if( chain->total == 0 ) 111 count = chain->total; 402 assert( writer.seq->total > 0 ); 434 int len = src_seq->total; 457 if( contour->total > 0 ) 527 int i = 0, j, count = src_contour->total, new_count; 536 if( src_contour->total == 0 ) 618 while( stack->total != 0 ) 685 new_count = count = (*dst_contour)->total; [all...] |
H A D | cvsubdivision2d.cpp | 574 int i, total; local 585 total = subdiv->edges->total; 590 for( i = 0; i < total; i++ ) 599 total = subdiv->total; 604 for( i = 0; i < total; i++ ) 627 int i, total, elem_size; local 640 total = subdiv->edges->total; [all...] |
/external/opencv/ |
H A D | cvjni.cpp | 408 if (rects == 0 || rects->total <= 0) {
425 jobjectArray ary = env->NewObjectArray(rects->total, jcls, 0);
431 for (int i = 0; i < rects->total; i++) {
487 if (m_facesFound == 0 || m_facesFound->total <= 0) {
490 sprintf(buffer, "FACES_DETECTED %d", m_facesFound->total);
586 if (m_facesFound == 0 || m_facesFound->total <= 0) {
630 if (faces == 0 || faces->total <= 0) {
637 for (int i = 0; i < faces->total; i++) {
653 if (m_facesFound == 0 || m_facesFound->total <= 0) {
|
/external/harfbuzz_ng/util/ |
H A D | ansi-print.cc | 236 unsigned int total = 0; 248 total += c; 265 if (total < *score) { 266 *score = total; 291 s = row_sum_i[i] + total - row_sum[i]; 323 s = col_sum_i[i] + total - col_sum[i];
|
/external/v8/src/ |
H A D | utils.cc | 260 int total = 0; local 261 while (total < size) { 262 int write = static_cast<int>(fwrite(str, 1, size - total, f)); 264 return total; 266 total += write; 269 return total;
|
/external/llvm/tools/llvm-size/ |
H A D | llvm-size.cpp | 11 // that is, it prints out the size of each section, and the total size of all 129 uint64_t total = 0; local 139 total += Seg.vmsize; 165 total += Seg.vmsize; 189 outs() << "total " << format(fmt.str().c_str(), total) << "\n"; 263 uint64_t total = total_text + total_data + total_objc + total_others; local 270 << total_others << "\t" << total << "\t" << format("%" PRIx64, total) 278 uint64_t total local [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
H A D | ant-swing.jar | ... text private javax.swing.JProgressBar pb private int total private static final int MIN private static final int MAX ... |
/external/eigen/Eigen/src/SparseCholesky/ |
H A D | SimplicialCholesky.h | 141 int total = 0; local 142 s << " L: " << ((total+=(m_matrix.cols()+1) * sizeof(int) + m_matrix.nonZeros()*(sizeof(int)+sizeof(Scalar))) >> 20) << "Mb" << "\n"; 143 s << " diag: " << ((total+=m_diag.size() * sizeof(Scalar)) >> 20) << "Mb" << "\n"; 144 s << " tree: " << ((total+=m_parent.size() * sizeof(int)) >> 20) << "Mb" << "\n"; 145 s << " nonzeros: " << ((total+=m_nonZerosPerCol.size() * sizeof(int)) >> 20) << "Mb" << "\n"; 146 s << " perm: " << ((total+=m_P.size() * sizeof(int)) >> 20) << "Mb" << "\n"; 147 s << " perm^-1: " << ((total+=m_Pinv.size() * sizeof(int)) >> 20) << "Mb" << "\n"; 148 s << " TOTAL: " << (total>> 20) << "Mb" << "\n";
|
/external/harfbuzz_ng/test/shaping/ |
H A D | hb_test_tools.py | 173 self.total = Stat () 176 self.total.add (test) 183 return float (self.passed.count) / self.total.count 186 return (float (self.passed.count) / self.total.count) * \ 187 (float (self.failed.count) / self.total.count) 217 total = passed + failed 218 print "%d out of %d tests passed. %d failed (%g%%)" % (passed, total, failed, 100. * failed / total)
|