/external/libdrm/nouveau/ |
H A D | bufctx.c | 62 struct nouveau_bufbin_priv bins[]; member in struct:nouveau_bufctx_priv 72 nouveau_bufctx_new(struct nouveau_client *client, int bins, argument 77 priv = calloc(1, sizeof(*priv) + sizeof(priv->bins[0]) * bins); 83 priv->nr_bins = bins; 112 struct nouveau_bufbin_priv *pbin = &pctx->bins[bin]; 131 struct nouveau_bufbin_priv *pbin = &pctx->bins[bin]; 159 struct nouveau_bufbin_priv *pbin = &pctx->bins[bin];
|
/external/libvorbis/vq/ |
H A D | distribution.c | 38 long bins=-1; local 45 fprintf(stderr,"Usage: distribution {data.vqd [bins]| book.vqh} \n\n"); 49 bins=atoi(argv[2])-1; 72 bins=_book_maptype1_quantvals(c); 75 bins=c->entries*c->dim; 82 for(i=0;i<bins;i++){ 96 long **sort=calloc(bins,sizeof(long *)); 98 countarray=calloc(bins,sizeof(long)); 100 for(i=0;i<bins;i++)sort[i]=c->quantlist+i; 101 qsort(sort,bins,sizeo [all...] |
H A D | latticetune.c | 139 long bins=_book_maptype1_quantvals(c); local 149 int index= (j/indexdiv)%bins; 152 indexdiv*=bins;
|
/external/skia/tests/ |
H A D | RandomTest.cpp | 34 static bool chi_square_test(int bins[256], int e) { argument 42 double delta = bins[j] - e; 60 int bins[256]; local 61 memset(bins, 0, sizeof(int)*256); 65 bins[(rand.nextU() >> shift) & 0xff]++; 68 REPORTER_ASSERT(reporter, chi_square_test(bins, 10000)); 72 int bins[256]; local 73 memset(bins, 0, sizeof(int)*256); 79 bins[(int)(f*256.f)]++; 81 REPORTER_ASSERT(reporter, chi_square_test(bins, 1000 169 int bins[256]; local [all...] |
/external/webp/src/utils/ |
H A D | filters.c | 205 int bins[WEBP_FILTER_LAST][SMAX]; local 206 memset(bins, 0, sizeof(bins)); 219 bins[WEBP_FILTER_NONE][diff0] = 1; 220 bins[WEBP_FILTER_HORIZONTAL][diff1] = 1; 221 bins[WEBP_FILTER_VERTICAL][diff2] = 1; 222 bins[WEBP_FILTER_GRADIENT][diff3] = 1; 233 if (bins[filter][i] > 0) {
|
/external/bison/lib/ |
H A D | bitset_stats.c | 108 unsigned int n_bins, unsigned int *bins) 115 total += bins[i]; 124 (i + 1) * 100.0 / n_bins, bins[i], 125 (100.0 * bins[i]) / total); 132 unsigned int n_bins, unsigned int *bins) 140 total += bins[i]; 145 /* Determine number of useful bins. */ 146 for (i = n_bins; i > 3 && ! bins[i - 1]; i--) 156 max_width, i, bins[i], 100.0 * bins[ 107 bitset_percent_histogram_print(FILE *file, const char *name, const char *msg, unsigned int n_bins, unsigned int *bins) argument 131 bitset_log_histogram_print(FILE *file, const char *name, const char *msg, unsigned int n_bins, unsigned int *bins) argument [all...] |
/external/jemalloc/include/jemalloc/internal/ |
H A D | arena.h | 181 * Read-only information associated with each element of arena_t's bins array 397 /* bins is used to store trees of free regions. */ 398 arena_bin_t bins[NBINS]; member in struct:arena_s 915 bin = &arena->bins[run_binind]; 916 actual_binind = bin - arena->bins; 933 index_t binind = bin - arena->bins;
|
/external/jemalloc/src/ |
H A D | stats.c | 45 void *cbopaque, unsigned i, bool bins, bool large, bool huge); 62 "bins: size ind allocated nmalloc" 68 "bins: size ind allocated nmalloc" 76 CTL_M2_M4_GET("stats.arenas.0.bins.0.nruns", i, j, &nruns, 97 CTL_M2_M4_GET("stats.arenas.0.bins.0.nmalloc", i, j, 99 CTL_M2_M4_GET("stats.arenas.0.bins.0.ndalloc", i, j, 101 CTL_M2_M4_GET("stats.arenas.0.bins.0.curregs", i, j, 103 CTL_M2_M4_GET("stats.arenas.0.bins.0.nrequests", i, j, 106 CTL_M2_M4_GET("stats.arenas.0.bins.0.nfills", i, 108 CTL_M2_M4_GET("stats.arenas.0.bins 255 stats_arena_print(void (*write_cb)(void *, const char *), void *cbopaque, unsigned i, bool bins, bool large, bool huge) argument 369 bool bins = true; local [all...] |
/external/webrtc/src/system_wrappers/source/spreadsortlib/ |
H A D | spreadsort.hpp | 39 //This is called for a set of bins, instead of bin-by-bin, to avoid performance overhead
91 //If we can finish in one iteration without exceeding either (2 to the MAX_SPLITS) or n bins, do so
115 //Make sure there is space for the bins
141 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count);
local 147 bins[0] = first;
149 bins[u + 1] = bins[u] + bin_sizes[u];
155 RandomAccessIter * local_bin = bins + u;
160 for(target_bin = (bins + ((*current >> log_divisor) - div_min)); target_bin != local_bin;
161 target_bin = bins 204 inner_swap_loop(RandomAccessIter * bins, const RandomAccessIter & nextbinstart, unsigned ii, right_shift &shift , const unsigned log_divisor, const div_type div_min) argument 232 swap_loop(RandomAccessIter * bins, RandomAccessIter & nextbinstart, unsigned ii, right_shift &shift , const std::vector<size_t> &bin_sizes, const unsigned log_divisor, const div_type div_min) argument 254 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 302 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 433 inner_float_swap_loop(RandomAccessIter * bins, const RandomAccessIter & nextbinstart, unsigned ii , const unsigned log_divisor, const div_type div_min) argument 459 float_swap_loop(RandomAccessIter * bins, RandomAccessIter & nextbinstart, unsigned ii , const std::vector<size_t> &bin_sizes, const unsigned log_divisor, const div_type div_min) argument 495 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 544 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 595 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 644 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 694 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 778 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 862 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, bin_count); local 1125 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, membin_count) + 1; local 1214 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, membin_count); local 1301 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, membin_count) + 1; local 1388 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, membin_count) + 1; local 1478 RandomAccessIter * bins = size_bins(bin_sizes, bin_cache, cache_offset, cache_end, membin_count); local [all...] |
/external/opencv/cv/src/ |
H A D | cvhistogram.cpp | 62 hist->bins = 0; 65 CV_CALL( hist->bins = cvInitMatNDHeader( &hist->mat, dims, sizes, 67 CV_CALL( cvCreateData( hist->bins )); 71 CV_CALL( hist->bins = cvCreateSparseMat( dims, sizes, CV_HIST_DEFAULT_TYPE )); 109 CV_CALL( hist->bins = cvInitMatNDHeader( &hist->mat, dims, sizes, 127 hist->bins = 0; 154 cvRelease( &temp->bins ); 157 cvReleaseData( temp->bins ); 158 temp->bins = 0; 180 cvZero( hist->bins ); 891 int* bins = ((CvMatND*)(hist->bins))->data.i; local 1149 int* bins = mat->data.i; local 1574 float* bins = mat->data.fl; local 1842 float* bins = mat->data.fl; local [all...] |
/external/libopus/celt/ |
H A D | celt_encoder.c | 1210 int bins; local 1211 bins = eBands[nbEBands-2]<<LM; 1212 /*floor_depth = SHR32(MULT16_16((C*bins<<BITRES),celt_log2(SHL32(MAX16(1,sample_max),13))), DB_SHIFT);*/ 1213 floor_depth = (opus_int32)SHR32(MULT16_16((C*bins<<BITRES),maxDepth), DB_SHIFT);
|
/external/opencv/cxcore/include/ |
H A D | cxtypes.h | 812 CvArr* bins; member in struct:CvHistogram 822 (hist)->bins != NULL) 828 CV_IS_SPARSE_MAT((hist)->bins)
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.pde.api.tools_1.0.202.v20100820_r361.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |