Home
last modified time | relevance | path

Searched refs:idx2 (Results 1 - 25 of 65) sorted by relevance

123

/third_party/node/deps/brotli/c/enc/
H A Dcluster_inc.h12 /* Computes the bit cost reduction by combining out[idx1] and out[idx2] and if
13 it is below a threshold, stores the pair (idx1, idx2) in the *pairs queue. */
16 uint32_t idx2, size_t max_num_pairs, HistogramPair* pairs,
20 p.idx1 = p.idx2 = 0;
22 if (idx1 == idx2) {
25 if (idx2 < idx1) {
26 uint32_t t = idx2;
27 idx2 = idx1;
31 p.idx2 = idx2;
[all...]
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dcluster_inc.h12 /* Computes the bit cost reduction by combining out[idx1] and out[idx2] and if
13 it is below a threshold, stores the pair (idx1, idx2) in the *pairs queue. */
16 uint32_t idx2, size_t max_num_pairs, HistogramPair* pairs,
20 p.idx1 = p.idx2 = 0;
22 if (idx1 == idx2) {
25 if (idx2 < idx1) {
26 uint32_t t = idx2;
27 idx2 = idx1;
31 p.idx2 = idx2;
[all...]
/third_party/ffmpeg/libavcodec/mips/
H A Dvp9dsp_init_mips.c86 #define init_fpel(idx1, idx2, sz, type) \ in vp9dsp_mc_init_msa()
87 dsp->mc[idx1][FILTER_8TAP_SMOOTH ][idx2][0][0] = ff_##type##sz##_msa; \ in vp9dsp_mc_init_msa()
88 dsp->mc[idx1][FILTER_8TAP_REGULAR][idx2][0][0] = ff_##type##sz##_msa; \ in vp9dsp_mc_init_msa()
89 dsp->mc[idx1][FILTER_8TAP_SHARP ][idx2][0][0] = ff_##type##sz##_msa; \ in vp9dsp_mc_init_msa()
90 dsp->mc[idx1][FILTER_BILINEAR ][idx2][0][0] = ff_##type##sz##_msa in vp9dsp_mc_init_msa()
109 #define init_subpel1(idx1, idx2, idxh, idxv, sz, dir, type) \ in vp9dsp_mc_init_msa()
110 dsp->mc[idx1][FILTER_BILINEAR ][idx2][idxh][idxv] = \ in vp9dsp_mc_init_msa()
112 dsp->mc[idx1][FILTER_8TAP_SMOOTH ][idx2][idxh][idxv] = \ in vp9dsp_mc_init_msa()
114 dsp->mc[idx1][FILTER_8TAP_REGULAR][idx2][idxh][idxv] = \ in vp9dsp_mc_init_msa()
116 dsp->mc[idx1][FILTER_8TAP_SHARP ][idx2][idx in vp9dsp_mc_init_msa()
[all...]
/third_party/jerryscript/tests/jerry/es2015/
H A Dregression-test-issue-3665.js16 var idx2 = 42.7; variable
17 var obj = { [idx1] : { [idx2] : {}}};
18 ([obj[idx1][idx2]] = [5.7]);
20 assert (obj[idx1][idx2] === 5.7);
/third_party/ffmpeg/libavcodec/loongarch/
H A Dvp9dsp_init_loongarch.c27 #define init_subpel1(idx1, idx2, idxh, idxv, sz, dir, type) \
28 dsp->mc[idx1][FILTER_8TAP_SMOOTH ][idx2][idxh][idxv] = \
30 dsp->mc[idx1][FILTER_8TAP_REGULAR][idx2][idxh][idxv] = \
32 dsp->mc[idx1][FILTER_8TAP_SHARP ][idx2][idxh][idxv] = \
47 #define init_fpel(idx1, idx2, sz, type) \
48 dsp->mc[idx1][FILTER_8TAP_SMOOTH ][idx2][0][0] = ff_##type##sz##_lsx; \
49 dsp->mc[idx1][FILTER_8TAP_REGULAR][idx2][0][0] = ff_##type##sz##_lsx; \
50 dsp->mc[idx1][FILTER_8TAP_SHARP ][idx2][0][0] = ff_##type##sz##_lsx; \
51 dsp->mc[idx1][FILTER_BILINEAR ][idx2][0][0] = ff_##type##sz##_lsx;
/third_party/skia/third_party/externals/libwebp/src/enc/
H A Dhistogram_enc.c733 int idx2; member
799 // Create a pair from indices "idx1" and "idx2" provided its cost
804 int idx2, double threshold) { in HistoQueuePush()
812 if (idx1 > idx2) { in HistoQueuePush()
813 const int tmp = idx2; in HistoQueuePush()
814 idx2 = idx1; in HistoQueuePush()
818 pair.idx2 = idx2; in HistoQueuePush()
820 h2 = histograms[idx2]; in HistoQueuePush()
868 const int idx2 in HistogramCombineGreedy() local
802 HistoQueuePush(HistoQueue* const histo_queue, VP8LHistogram** const histograms, int idx1, int idx2, double threshold) HistoQueuePush() argument
904 PairComparison(const void* idx1, const void* idx2) PairComparison() argument
962 uint32_t idx2 = tmp % (*num_used - 1); HistogramCombineStochastic() local
[all...]
/third_party/ffmpeg/libavcodec/arm/
H A Dvp9dsp_init_16bpp_arm_template.c106 #define init_fpel(idx1, idx2, sz, type, suffix) \ in vp9dsp_mc_init_arm()
107 dsp->mc[idx1][FILTER_8TAP_SMOOTH ][idx2][0][0] = \ in vp9dsp_mc_init_arm()
108 dsp->mc[idx1][FILTER_8TAP_REGULAR][idx2][0][0] = \ in vp9dsp_mc_init_arm()
109 dsp->mc[idx1][FILTER_8TAP_SHARP ][idx2][0][0] = \ in vp9dsp_mc_init_arm()
110 dsp->mc[idx1][FILTER_BILINEAR ][idx2][0][0] = ff_vp9_##type##sz##suffix##_neon in vp9dsp_mc_init_arm()
116 #define init_mc_func(idx1, idx2, op, filter, fname, dir, mx, my, sz, pfx, bpp) \ in vp9dsp_mc_init_arm()
117 dsp->mc[idx1][filter][idx2][mx][my] = pfx##op##_##fname##sz##_##dir##_##bpp##_neon in vp9dsp_mc_init_arm()
215 #define init_lpf_func_8(idx1, idx2, dir, wd, bpp) \ in vp9dsp_loopfilter_init_arm()
216 dsp->loop_filter_8[idx1][idx2] = ff_vp9_loop_filter_##dir##_##wd##_8_##bpp##_neon in vp9dsp_loopfilter_init_arm()
221 #define init_lpf_func_mix2(idx1, idx2, idx in vp9dsp_loopfilter_init_arm()
[all...]
H A Dvp9dsp_init_arm.c105 #define init_fpel(idx1, idx2, sz, type) \ in vp9dsp_mc_init_arm()
106 dsp->mc[idx1][FILTER_8TAP_SMOOTH ][idx2][0][0] = \ in vp9dsp_mc_init_arm()
107 dsp->mc[idx1][FILTER_8TAP_REGULAR][idx2][0][0] = \ in vp9dsp_mc_init_arm()
108 dsp->mc[idx1][FILTER_8TAP_SHARP ][idx2][0][0] = \ in vp9dsp_mc_init_arm()
109 dsp->mc[idx1][FILTER_BILINEAR ][idx2][0][0] = ff_vp9_##type##sz##_neon in vp9dsp_mc_init_arm()
115 #define init_mc_func(idx1, idx2, op, filter, fname, dir, mx, my, sz, pfx) \ in vp9dsp_mc_init_arm()
116 dsp->mc[idx1][filter][idx2][mx][my] = pfx##op##_##fname##sz##_##dir##_neon in vp9dsp_mc_init_arm()
H A Dvp9mc_neon.S267 @ the filter coefficients in r12. idx2 is the index of the largest
269 .macro do_8tap_h type, size, idx1, idx2
270 function \type\()_8tap_\size\()h_\idx1\idx2
312 @ Accumulate, adding idx2 last with a separate
314 @ for all indices except idx2 must add up to less
328 extmulqadd q1, q2, q3, q4, d2, d6, q8, q9, q10, q11, q12, q13, \idx2, \size
494 @ (src1-src8 into dst1, src2-src9 into dst2), adding idx2 separately
498 .macro convolve dst1, dst2, src1, src2, src3, src4, src5, src6, src7, src8, src9, idx1, idx2, tmp1, tmp2
518 .if \idx2 == 3
547 @ in r12. idx2 i
[all...]
/third_party/ffmpeg/libavcodec/aarch64/
H A Dvp9dsp_init_16bpp_aarch64_template.c108 #define init_fpel(idx1, idx2, sz, type, suffix) \ in vp9dsp_mc_init_aarch64()
109 dsp->mc[idx1][FILTER_8TAP_SMOOTH ][idx2][0][0] = \ in vp9dsp_mc_init_aarch64()
110 dsp->mc[idx1][FILTER_8TAP_REGULAR][idx2][0][0] = \ in vp9dsp_mc_init_aarch64()
111 dsp->mc[idx1][FILTER_8TAP_SHARP ][idx2][0][0] = \ in vp9dsp_mc_init_aarch64()
112 dsp->mc[idx1][FILTER_BILINEAR ][idx2][0][0] = ff_vp9_##type##sz##suffix in vp9dsp_mc_init_aarch64()
131 #define init_mc_func(idx1, idx2, op, filter, fname, dir, mx, my, sz, pfx, bpp) \ in vp9dsp_mc_init_aarch64()
132 dsp->mc[idx1][filter][idx2][mx][my] = pfx##op##_##fname##sz##_##dir##_##bpp##_neon in vp9dsp_mc_init_aarch64()
231 #define init_lpf_func_8(idx1, idx2, dir, wd, bpp) \ in vp9dsp_loopfilter_init_aarch64()
232 dsp->loop_filter_8[idx1][idx2] = ff_vp9_loop_filter_##dir##_##wd##_8_##bpp##_neon in vp9dsp_loopfilter_init_aarch64()
237 #define init_lpf_func_mix2(idx1, idx2, idx in vp9dsp_loopfilter_init_aarch64()
[all...]
H A Dvp9dsp_init_aarch64.c106 #define init_fpel(idx1, idx2, sz, type, suffix) \ in vp9dsp_mc_init_aarch64()
107 dsp->mc[idx1][FILTER_8TAP_SMOOTH ][idx2][0][0] = \ in vp9dsp_mc_init_aarch64()
108 dsp->mc[idx1][FILTER_8TAP_REGULAR][idx2][0][0] = \ in vp9dsp_mc_init_aarch64()
109 dsp->mc[idx1][FILTER_8TAP_SHARP ][idx2][0][0] = \ in vp9dsp_mc_init_aarch64()
110 dsp->mc[idx1][FILTER_BILINEAR ][idx2][0][0] = ff_vp9_##type##sz##suffix in vp9dsp_mc_init_aarch64()
128 #define init_mc_func(idx1, idx2, op, filter, fname, dir, mx, my, sz, pfx) \ in vp9dsp_mc_init_aarch64()
129 dsp->mc[idx1][filter][idx2][mx][my] = pfx##op##_##fname##sz##_##dir##_neon in vp9dsp_mc_init_aarch64()
H A Dvp9mc_neon.S220 // filter coefficients in x9. idx2 is the index of the largest
222 .macro do_8tap_h type, size, idx1, idx2
223 function \type\()_8tap_\size\()h_\idx1\idx2
265 // Accumulate, adding idx2 last with a separate
267 // for all indices except idx2 must add up to less
281 extmulqadd v1, v2, v24, v25, v4, v5, v6, v16, v17, v18, \idx2, \size
429 // (src1-src8 into dst1, src2-src9 into dst2), adding idx2 separately
433 .macro convolve dst1, dst2, src1, src2, src3, src4, src5, src6, src7, src8, src9, idx1, idx2, tmp1, tmp2
453 .if \idx2 == 3
482 // in x6. idx2 i
[all...]
/third_party/ffmpeg/libavcodec/x86/
H A Dvp9dsp_init.h143 #define init_fpel_func(idx1, idx2, sz, type, bpp, opt) \
144 dsp->mc[idx1][FILTER_8TAP_SMOOTH ][idx2][0][0] = \
145 dsp->mc[idx1][FILTER_8TAP_REGULAR][idx2][0][0] = \
146 dsp->mc[idx1][FILTER_8TAP_SHARP ][idx2][0][0] = \
147 dsp->mc[idx1][FILTER_BILINEAR ][idx2][0][0] = ff_vp9_##type##sz##bpp##_##opt
149 #define init_subpel1(idx1, idx2, idxh, idxv, sz, dir, type, bpp, opt) \
150 dsp->mc[idx1][FILTER_8TAP_SMOOTH ][idx2][idxh][idxv] = \
152 dsp->mc[idx1][FILTER_8TAP_REGULAR][idx2][idxh][idxv] = \
154 dsp->mc[idx1][FILTER_8TAP_SHARP ][idx2][idxh][idxv] = \
157 #define init_subpel2(idx1, idx2, s
[all...]
/third_party/icu/icu4c/source/tools/gencnval/
H A Dgencnval.c668 uint32_t idx, idx2; in addAlias() local
713 for (idx2 = 0; idx2 < tags[standard].aliasList[idx].aliasCount; idx2++) { in addAlias()
714 uint16_t aliasNum = tags[standard].aliasList[idx].aliases[idx2]; in addAlias()
815 uint16_t idx, idx2, idx3; in resolveAliasToConverter() local
818 for (idx2 = 0; idx2 < converterCount; idx2++) { in resolveAliasToConverter()
819 for (idx3 = 0; idx3 < tags[idx].aliasList[idx2] in resolveAliasToConverter()
[all...]
/third_party/skia/third_party/externals/icu/source/tools/gencnval/
H A Dgencnval.c667 uint32_t idx, idx2; in addAlias() local
712 for (idx2 = 0; idx2 < tags[standard].aliasList[idx].aliasCount; idx2++) { in addAlias()
713 uint16_t aliasNum = tags[standard].aliasList[idx].aliases[idx2]; in addAlias()
814 uint16_t idx, idx2, idx3; in resolveAliasToConverter() local
817 for (idx2 = 0; idx2 < converterCount; idx2++) { in resolveAliasToConverter()
818 for (idx3 = 0; idx3 < tags[idx].aliasList[idx2] in resolveAliasToConverter()
[all...]
/third_party/node/deps/npm/node_modules/iconv-lite/encodings/
H A Dsbcs-codec.js62 var idx1 = 0, idx2 = 0;
64 idx1 = buf[i]*2; idx2 = i*2;
65 newBuf[idx2] = decodeBuf[idx1];
66 newBuf[idx2+1] = decodeBuf[idx1+1];
/third_party/skia/src/pathops/
H A DSkOpAngle.cpp490 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) { in distEndRatio()
491 if (idx1 == idx2) { in distEndRatio()
495 v.set(pts[idx2] - pts[idx1]); in distEndRatio()
528 for (int idx2 = 0; idx2 < i.used(); ++idx2) { in endsIntersect()
529 double testT = i[0][idx2]; in endsIntersect()
582 for (int idx2 in endsIntersect()
[all...]
/third_party/skia/tests/
H A DPathOpsAngleTest.cpp247 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) {
248 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint();
444 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST()
445 temp[idx2] = data.fPts.fPts[idx2] in DEF_TEST()
[all...]
H A DPathOpsTightBoundsTest.cpp40 for (int idx2 = 0; idx2 < 10; ++idx2) { in DEF_TEST()
115 for (int idx2 = 0; idx2 < 10; ++idx2) { in DEF_TEST()
/third_party/skia/third_party/externals/tint/fuzzers/tint_regex_fuzzer/
H A Dwgsl_mutator.h70 /// Given 4 indices, idx1, idx2, idx3 and idx4 it swaps the regions
71 /// in the interval (idx1, idx2] with the region in the interval (idx3, idx4]
75 /// @param idx2 - starting index of the second region.
80 size_t idx2,
91 /// Given 2 indices, idx1, idx2, it inserts the region of length
92 /// reg1_len starting at idx1 after idx2.
95 /// @param idx2 - the position where the region will be inserted.
99 size_t idx2,
103 /// at position idx2 with a region of length id1_len starting at
107 /// @param idx2
[all...]
H A Dwgsl_mutator.cc177 size_t idx2, in SwapIntervals()
182 std::string region_2 = wgsl_code.substr(idx2 + 1, reg2_len - 1); in SwapIntervals()
184 // The second transformation is done first as it doesn't affect idx2. in SwapIntervals()
185 wgsl_code.replace(idx2 + 1, region_2.size(), region_1); in SwapIntervals()
196 size_t idx2, in DuplicateInterval()
199 wgsl_code.insert(idx2 + 1, region); in DuplicateInterval()
204 size_t idx2, in ReplaceRegion()
208 std::string region_2 = wgsl_code.substr(idx2, id2_len); in ReplaceRegion()
209 wgsl_code.replace(idx2, region_2.size(), region_1); in ReplaceRegion()
175 SwapIntervals(size_t idx1, size_t reg1_len, size_t idx2, size_t reg2_len, std::string& wgsl_code) SwapIntervals() argument
194 DuplicateInterval(size_t idx1, size_t reg1_len, size_t idx2, std::string& wgsl_code) DuplicateInterval() argument
202 ReplaceRegion(size_t idx1, size_t id1_len, size_t idx2, size_t id2_len, std::string& wgsl_code) ReplaceRegion() argument
/third_party/protobuf/objectivec/
H A DGPBArray.h206 * @param idx2 The index of the second element to exchange.
209 withValueAtIndex:(NSUInteger)idx2;
378 * @param idx2 The index of the second element to exchange.
381 withValueAtIndex:(NSUInteger)idx2;
550 * @param idx2 The index of the second element to exchange.
553 withValueAtIndex:(NSUInteger)idx2;
722 * @param idx2 The index of the second element to exchange.
725 withValueAtIndex:(NSUInteger)idx2;
894 * @param idx2 The index of the second element to exchange.
897 withValueAtIndex:(NSUInteger)idx2;
[all...]
/third_party/mesa3d/src/gallium/drivers/r600/sfn/
H A Dsfn_ra.cpp41 void ComponentInterference::add(size_t idx1, size_t idx2) in add() argument
43 assert(idx1 > idx2); in add()
45 m_rows[idx1].push_back(idx2); in add()
46 m_rows[idx2].push_back(idx1); in add()
/third_party/mesa3d/src/amd/vulkan/radix_sort/shaders/
H A Dprefix.h253 const uint32_t idx2 = (ii * RS_WORKGROUP_SUBGROUPS) + gl_SubgroupID; in rs_prefix()
259 RS_PREFIX_SWEEP2(idx2) = subgroupBroadcast(h1_inc, RS_SUBGROUP_SIZE - 1); in rs_prefix()
329 const uint32_t idx2 = idx1 / RS_SUBGROUP_SIZE; in rs_prefix()
333 h_exc[ii] + (RS_PREFIX_SWEEP0(idx0) + RS_PREFIX_SWEEP1(idx1) + RS_PREFIX_SWEEP2(idx2)); in rs_prefix()
338 h_exc + (RS_PREFIX_SWEEP0(idx0) + RS_PREFIX_SWEEP1(idx1) + RS_PREFIX_SWEEP2(idx2)); in rs_prefix()
/third_party/node/deps/v8/src/diagnostics/
H A Dsystem-jit-metadata-win.h52 std::size_t... idx2>
54 const str_bytes<count2>& s2, std::index_sequence<idx2...>) in str_bytes()
55 : bytes{s1.bytes[idx1]..., s2.bytes[idx2]...}, size(count) {} in str_bytes()
80 auto idx2 = std::make_index_sequence<size2>(); in JoinBytes() local
81 return str_bytes<size1 + size2>{str1, idx1, str2, idx2}; in JoinBytes()

Completed in 17 milliseconds

123