Home
last modified time | relevance | path

Searched refs:bins (Results 1 - 24 of 24) sorted by relevance

/third_party/rust/crates/which-rs/tests/
H A Dbasic.rs18 pub bins: Vec<PathBuf>,
61 let mut bins = vec![]; in new() variables
65 bins.push(mk_bin(&p, BIN_NAME, "").unwrap()); in new()
66 bins.push(mk_bin(&p, BIN_NAME, "exe").unwrap()); in new()
67 bins.push(mk_bin(&p, BIN_NAME, "cmd").unwrap()); in new()
72 bins.push(mk_bin(&p, "win-bin", "exe").unwrap()); in new()
77 bins, in new()
123 assert_eq!(_which(&f, &BIN_NAME).unwrap(), f.bins[0]) in test_which()
130 assert_eq!(_which(&f, &BIN_NAME).unwrap(), f.bins[1]) in test_which()
190 assert_eq!(_which(&f, &b).unwrap(), f.bins[ in test_which_extension()
[all...]
/third_party/skia/tests/
H A DRandomTest.cpp34 static bool chi_square_test(int bins[256], int e) { in chi_square_test() argument
42 double delta = bins[j] - e; in chi_square_test()
60 int bins[256]; in test_random_byte() local
61 memset(bins, 0, sizeof(int)*256); in test_random_byte()
65 bins[(rand.nextU() >> shift) & 0xff]++; in test_random_byte()
68 REPORTER_ASSERT(reporter, chi_square_test(bins, 10000)); in test_random_byte()
72 int bins[256]; in test_random_float() local
73 memset(bins, 0, sizeof(int)*256); in test_random_float()
79 bins[(int)(f*256.f)]++; in test_random_float()
81 REPORTER_ASSERT(reporter, chi_square_test(bins, 1000 in test_random_float()
169 int bins[256]; test_range() local
[all...]
/third_party/skia/third_party/externals/libwebp/src/utils/
H A Dfilters_utils.c32 int bins[WEBP_FILTER_LAST][SMAX]; in WebPEstimateBestFilter() local
33 memset(bins, 0, sizeof(bins)); in WebPEstimateBestFilter()
46 bins[WEBP_FILTER_NONE][diff0] = 1; in WebPEstimateBestFilter()
47 bins[WEBP_FILTER_HORIZONTAL][diff1] = 1; in WebPEstimateBestFilter()
48 bins[WEBP_FILTER_VERTICAL][diff2] = 1; in WebPEstimateBestFilter()
49 bins[WEBP_FILTER_GRADIENT][diff3] = 1; in WebPEstimateBestFilter()
60 if (bins[filter][i] > 0) { in WebPEstimateBestFilter()
/third_party/libdrm/nouveau/
H A Dbufctx.c52 struct nouveau_bufbin_priv bins[]; member
62 nouveau_bufctx_new(struct nouveau_client *client, int bins, in nouveau_bufctx_new() argument
67 priv = calloc(1, sizeof(*priv) + sizeof(priv->bins[0]) * bins); in nouveau_bufctx_new()
73 priv->nr_bins = bins; in nouveau_bufctx_new()
102 struct nouveau_bufbin_priv *pbin = &pctx->bins[bin]; in nouveau_bufctx_reset()
121 struct nouveau_bufbin_priv *pbin = &pctx->bins[bin]; in nouveau_bufctx_refn()
149 struct nouveau_bufbin_priv *pbin = &pctx->bins[bin]; in nouveau_bufctx_mthd()
H A Dnouveau.h179 int nouveau_bufctx_new(struct nouveau_client *, int bins,
/third_party/ffmpeg/libavfilter/
H A Dmedian.h44 int bins; member
47 void (*hadd)(uint16_t *dst, const uint16_t *src, int bins);
48 void (*hsub)(uint16_t *dst, const uint16_t *src, int bins);
49 void (*hmuladd)(uint16_t *dst, const uint16_t *src, int f, int bins);
H A Dvf_median.c68 static void hadd(htype *dst, const htype *src, int bins) in hadd() argument
70 for (int i = 0; i < bins; i++) in hadd()
74 static void hsub(htype *dst, const htype *src, int bins) in hsub() argument
76 for (int i = 0; i < bins; i++) in hsub()
80 static void hmuladd(htype *dst, const htype *src, int f, int bins) in hmuladd() argument
82 for (int i = 0; i < bins; i++) in hmuladd()
145 s->bins = 1 << ((s->depth + 1) / 2); in config_input()
146 s->fine_size = s->bins * s->bins * inlink->w; in config_input()
147 s->coarse_size = s->bins * inlin in config_input()
[all...]
/third_party/musl/src/malloc/oldmalloc/
H A Dmalloc.c28 struct bin bins[64]; member
53 lock(mal.bins[i].lock); in lock_bin()
54 if (!mal.bins[i].head) in lock_bin()
55 mal.bins[i].head = mal.bins[i].tail = BIN_TO_CHUNK(i); in lock_bin()
60 unlock(mal.bins[i].lock); in unlock_bin()
126 if (mal.bins[i].head != BIN_TO_CHUNK(i) && mal.bins[i].head) {
127 fprintf(stderr, "bin %d: %p\n", i, mal.bins[i].head);
282 self->prev = mal.bins[ in bin_chunk()
[all...]
H A Dmalloc_impl.h98 #define BIN_TO_CHUNK(i) (&mal.bins[i].checksum)
100 #define BIN_TO_CHUNK(i) (MEM_TO_CHUNK(&mal.bins[i].head))
/third_party/musl/porting/liteos_a/user/src/malloc/oldmalloc/
H A Dmalloc.c24 struct bin bins[64]; member
49 lock(mal.bins[i].lock); in lock_bin()
50 if (!mal.bins[i].head) in lock_bin()
51 mal.bins[i].head = mal.bins[i].tail = BIN_TO_CHUNK(i); in lock_bin()
56 unlock(mal.bins[i].lock); in unlock_bin()
122 if (mal.bins[i].head != BIN_TO_CHUNK(i) && mal.bins[i].head) {
123 fprintf(stderr, "bin %d: %p\n", i, mal.bins[i].head);
263 self->prev = mal.bins[ in bin_chunk()
[all...]
/third_party/musl/porting/liteos_a/user_debug/src/malloc/oldmalloc/
H A Dmalloc.c26 struct bin bins[64]; member
51 lock(mal.bins[i].lock); in lock_bin()
52 if (!mal.bins[i].head) in lock_bin()
53 mal.bins[i].head = mal.bins[i].tail = BIN_TO_CHUNK(i); in lock_bin()
58 unlock(mal.bins[i].lock); in unlock_bin()
124 if (mal.bins[i].head != BIN_TO_CHUNK(i) && mal.bins[i].head) {
125 fprintf(stderr, "bin %d: %p\n", i, mal.bins[i].head);
270 self->prev = mal.bins[ in bin_chunk()
[all...]
H A Dmalloc_impl.h81 #define BIN_TO_CHUNK(i) (&mal.bins[i].checksum)
/third_party/musl/src/malloc/liteos_a/user_debug/
H A Dmemory_check.c41 struct stat_bin bins[PTHREAD_NUM_MAX]; member
67 lock(mem_stat.bins[tid].lock); in lock_stat_bin()
68 if (!mem_stat.bins[tid].head.next) in lock_stat_bin()
69 mem_stat.bins[tid].head.next = mem_stat.bins[tid].head.prev = &mem_stat.bins[tid].head; in lock_stat_bin()
74 unlock(mem_stat.bins[tid].lock); in unlock_stat_bin()
94 for (list = mem_stat.bins[tid].head.next; list != &mem_stat.bins[tid].head; list = list->next) { in try_delete_node()
101 mem_stat.bins[ti in try_delete_node()
[all...]
/third_party/musl/porting/liteos_a/user_debug/src/malloc/
H A Dmemory_check.c26 struct stat_bin bins[PTHREAD_NUM_MAX]; member
52 lock(mem_stat.bins[tid].lock); in lock_stat_bin()
53 if (!mem_stat.bins[tid].head.next) in lock_stat_bin()
54 mem_stat.bins[tid].head.next = mem_stat.bins[tid].head.prev = &mem_stat.bins[tid].head; in lock_stat_bin()
59 unlock(mem_stat.bins[tid].lock); in unlock_stat_bin()
79 for (list = mem_stat.bins[tid].head.next; list != &mem_stat.bins[tid].head; list = list->next) { in try_delete_node()
86 mem_stat.bins[ti in try_delete_node()
[all...]
/third_party/backends/backend/
H A Dsnapscan-scsi.c1357 int *bins; in calibrate_epson() local
1376 /* calculate number of bins depending on mode and resolution in calibrate_epson()
1377 * colour mode requires bins for each of rgb in calibrate_epson()
1386 /* allocate memory for bins, all the red, then green, then blue */ in calibrate_epson()
1387 bins = (int *) malloc (num_bins * sizeof (int)); in calibrate_epson()
1388 if (!bins) { in calibrate_epson()
1389 DBG (DL_MAJOR_ERROR, "%s: out of memory allocating bins, %ld bytes.", me, (u_long)num_bins * sizeof (int)); in calibrate_epson()
1398 free (bins); in calibrate_epson()
1415 /* empty the bins */ in calibrate_epson()
1417 bins[ in calibrate_epson()
[all...]
/third_party/vk-gl-cts/external/amber/src/src/
H A Dbuffer_test.cc146 std::vector<uint64_t> bins = b.GetHistogramForChannel(2, 256); in TEST_F() local
148 EXPECT_EQ(1u, bins[i / 4 * 25]); in TEST_F()
167 std::vector<uint64_t> bins = b.GetHistogramForChannel(i, 256); in TEST_F() local
169 EXPECT_EQ(10u, bins[0]); in TEST_F()
190 std::vector<uint64_t> bins = b.GetHistogramForChannel(i, 256); in TEST_F() local
192 EXPECT_EQ(10u, bins[255]); in TEST_F()
H A Dbuffer.cc184 std::vector<uint64_t> bins(num_bins, 0); in GetHistogramForChannel()
198 bins[bin]++; in GetHistogramForChannel()
205 return bins; in GetHistogramForChannel()
234 // number of adjacent bins over which the earth is carried). Calculate this in CompareHistogramEMD()
235 // using the cumulative difference of the bins, which works as long as both in CompareHistogramEMD()
/third_party/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/localeconverter/
H A DXLIFF2ICUConverter.java998 ResourceBinary[] bins = new ResourceBinary[2]; in parseBinUnit()
1000 bins[0] = new ResourceBinary(); in parseBinUnit()
1001 bins[1] = new ResourceBinary(); in parseBinUnit()
1003 Resource currentSource = bins[0]; in parseBinUnit()
1004 Resource currentTarget = bins[1]; in parseBinUnit()
1019 parseResourceBinary(child, bins); in parseBinUnit()
1028 set[0] = bins[0]; in parseBinUnit()
1029 set[1] = bins[1]; in parseBinUnit()
/third_party/node/deps/npm/node_modules/@npmcli/installed-package-contents/lib/
H A Dindex.js5 // - if bins in ../node_modules/.bin, add those to result
95 // add all bins to result if they exist
107 const bins = await Promise.all(
110 bins.filter(b => b).forEach(b => result.add(b))
176 // we always recurse to get pkg bins, but if currentDepth is too high,
/third_party/node/tools/
H A Dinstall.py83 def package_files(action, name, bins):
99 for bin_name, bin_target in bins.items():
/third_party/node/deps/npm/lib/commands/
H A Dview.js336 bins: Object.keys(manifest.bin || {}),
404 if (info.bins.length) {
406 this.npm.output(`bin: ${chalk.yellow(info.bins.join(', '))}`)
/third_party/node/deps/npm/node_modules/@npmcli/package-json/lib/
H A Dnormalize.js322 const bins = await glob('**', { cwd: binsDir })
323 data.bin = bins.reduce((acc, binFile) => {
/third_party/node/deps/npm/node_modules/read-package-json/lib/
H A Dread-json.js22 bins,
347 function bins (file, data, cb) {
470 /* istanbul ignore if - impossible, bins have been normalized */
/third_party/FreeBSD/sys/dev/random/
H A Dyarrow.c110 RANDOM_CHECK_UINT(bins, RANDOM_YARROW_NPOOLS, 16);
165 "bins", CTLTYPE_UINT | CTLFLAG_RWTUN, in random_yarrow_init_alg()

Completed in 17 milliseconds