Home
last modified time | relevance | path

Searched refs:idy (Results 1 – 25 of 33) sorted by relevance

12

/external/skia/tests/
DPathCoverageTest.cpp30 int idy = SkAbs32(SkScalarRoundToInt(dy)); in cheap_distance() local
31 if (idx > idy) { in cheap_distance()
32 idx += idy >> 1; in cheap_distance()
34 idx = idy + (idx >> 1); in cheap_distance()
/external/skqp/tests/
DPathCoverageTest.cpp30 int idy = SkAbs32(SkScalarRoundToInt(dy)); in cheap_distance() local
31 if (idx > idy) { in cheap_distance()
32 idx += idy >> 1; in cheap_distance()
34 idx = idy + (idx >> 1); in cheap_distance()
/external/libaom/libaom/av1/encoder/
Dtokenize.c227 for (int idy = 0; idy < mi_height; idy += mu_blocks_high) { in av1_tokenize_sb_vartx() local
229 const int unit_height = AOMMIN(mu_blocks_high + idy, mi_height); in av1_tokenize_sb_vartx()
231 for (int blk_row = idy; blk_row < unit_height; blk_row += bh) { in av1_tokenize_sb_vartx()
Dtpl_model.c455 for (int idy = 0; idy < mi_height; ++idy) { in mode_estimation() local
458 (xd->mb_to_bottom_edge >> (3 + MI_SIZE_LOG2)) + mi_height > idy) { in mode_estimation()
459 xd->mi[idx + idy * cm->mi_params.mi_stride] = xd->mi[0]; in mode_estimation()
593 for (int idy = 0; idy < mi_height; idy += step) { in tpl_model_update_b() local
596 ref_mi_row + idy, ref_mi_col + idx, ref_tpl_frame->stride, in tpl_model_update_b()
619 for (int idy = 0; idy < mi_height; idy += step) { in tpl_model_update() local
621 tpl_model_update_b(tpl_data, mi_row + idy, mi_col + idx, tpl_block_size, in tpl_model_update()
649 for (int idy = 0; idy < mi_height; idy += step) { in tpl_model_store() local
651 mi_row + idy, mi_col, stride, block_mis_log2)]; in tpl_model_store()
Dencodemb.c645 for (int idy = 0; idy < mi_height; idy += mu_blocks_high) { in av1_encode_sb() local
648 const int unit_height = AOMMIN(mu_blocks_high + idy, mi_height); in av1_encode_sb()
650 for (blk_row = idy; blk_row < unit_height; blk_row += bh) { in av1_encode_sb()
Dtx_search.c2052 int idx, idy; in update_txb_coeff_cost() local
2053 for (idy = 0; idy < txb_h; ++idy) in update_txb_coeff_cost()
2055 rd_stats->txb_coeff_cost_map[plane][blk_row + idy][blk_col + idx] = 0; in update_txb_coeff_cost()
2654 for (int idy = 0; idy < tx_size_high_unit[tx_size]; ++idy) { in select_tx_block() local
2657 av1_get_txb_size_index(plane_bsize, blk_row + idy, blk_col + idx); in select_tx_block()
3059 for (int idy = 0, block = 0; idy < mi_height; idy += bh) { in inter_block_yrd() local
3063 tx_block_yrd(cpi, x, idy, idx, block, max_tx_size, bsize, init_depth, in inter_block_yrd()
3143 for (int idy = 0; idy < max_block_high(xd, bsize, 0); idy += bh) { in select_tx_size_and_type() local
3152 select_tx_block(cpi, x, idy, idx, block, max_tx_size, init_depth, bsize, in select_tx_size_and_type()
/external/libvpx/libvpx/vp9/encoder/
Dvp9_rdopt.c207 int idx, idy; in model_rd_for_sb() local
211 for (idy = 0; idy < bh; ++idy) { in model_rd_for_sb()
213 uint8_t *src = p->src.buf + (idy * p->src.stride << lh) + (idx << lw); in model_rd_for_sb()
214 uint8_t *dst = pd->dst.buf + (idy * pd->dst.stride << lh) + (idx << lh); in model_rd_for_sb()
215 int block_idx = (idy << 1) + idx; in model_rd_for_sb()
1104 int idx, idy; in rd_pick_intra4x4block() local
1133 for (idy = 0; idy < num_4x4_blocks_high; ++idy) { in rd_pick_intra4x4block()
1135 const int block = (row + idy) * 2 + (col + idx); in rd_pick_intra4x4block()
1136 const uint8_t *const src = &src_init[idx * 4 + idy * 4 * src_stride]; in rd_pick_intra4x4block()
1137 uint8_t *const dst = &dst_init[idx * 4 + idy * 4 * dst_stride]; in rd_pick_intra4x4block()
[all …]
Dvp9_encodemv.c259 int idx, idy; in vp9_update_mv_count() local
261 for (idy = 0; idy < 2; idy += num_4x4_h) { in vp9_update_mv_count()
263 const int i = idy * 2 + idx; in vp9_update_mv_count()
Dvp9_temporal_filter.c277 int idx = 0, idy; in vp9_apply_temporal_filter_c() local
321 for (idy = -1; idy <= 1; ++idy) { in vp9_apply_temporal_filter_c()
323 const int row = (int)i + idy; in vp9_apply_temporal_filter_c()
359 for (idy = -1; idy <= 1; ++idy) { in vp9_apply_temporal_filter_c()
361 const int row = uv_r + idy; in vp9_apply_temporal_filter_c()
375 for (idy = 0; idy < 1 + ss_y; ++idy) { in vp9_apply_temporal_filter_c()
377 const int row = (uv_r << ss_y) + idy; in vp9_apply_temporal_filter_c()
Dvp9_bitstream.c281 int idx, idy; in pack_inter_mode_mvs() local
284 for (idy = 0; idy < 2; idy += num_4x4_h) { in pack_inter_mode_mvs()
286 const PREDICTION_MODE b_mode = mi->bmi[idy * 2 + idx].as_mode; in pack_inter_mode_mvs()
317 int idx, idy; in pack_inter_mode_mvs() local
318 for (idy = 0; idy < 2; idy += num_4x4_h) { in pack_inter_mode_mvs()
320 const int j = idy * 2 + idx; in pack_inter_mode_mvs()
362 int idx, idy; in write_mb_modes_kf() local
364 for (idy = 0; idy < 2; idy += num_4x4_h) { in write_mb_modes_kf()
366 const int block = idy * 2 + idx; in write_mb_modes_kf()
Dvp9_encodeframe.c2157 int idx, idy; in update_stats() local
2158 for (idy = 0; idy < 2; idy += num_4x4_h) { in update_stats()
2160 const int j = idy * 2 + idx; in update_stats()
3054 int idx, idy; in set_partition_range() local
3065 for (idy = 0; idy < mi_height; ++idy) { in set_partition_range()
3067 mi = prev_mi[idy * cm->mi_stride + idx]; in set_partition_range()
3076 for (idy = 0; idy < mi_height; ++idy) { in set_partition_range()
3077 mi = xd->mi[idy * cm->mi_stride - 1]; in set_partition_range()
6329 int idx, idy; in sum_intra_stats() local
6332 for (idy = 0; idy < 2; idy += num_4x4_h) in sum_intra_stats()
[all …]
/external/libaom/libaom/av1/decoder/
Ddecodetxb.c364 for (int idy = 0; idy < txh; idy += tx_unit) { in av1_read_coeffs_txb_facade() local
366 xd->tx_type_map[(row + idy) * stride + col + idx] = tx_type; in av1_read_coeffs_txb_facade()
/external/angle/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc493 bool GraphCycles::InsertEdge(GraphId idx, GraphId idy) { in InsertEdge() argument
496 const int32_t y = NodeIndex(idy); in InsertEdge()
498 Node* ny = FindNode(r, idy); in InsertEdge()
625 int GraphCycles::FindPath(GraphId idx, GraphId idy, int max_path_len, in FindPath() argument
628 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
630 const int32_t y = NodeIndex(idy); in FindPath()
/external/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc492 bool GraphCycles::InsertEdge(GraphId idx, GraphId idy) { in InsertEdge() argument
495 const int32_t y = NodeIndex(idy); in InsertEdge()
497 Node* ny = FindNode(r, idy); in InsertEdge()
624 int GraphCycles::FindPath(GraphId idx, GraphId idy, int max_path_len, in FindPath() argument
627 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
629 const int32_t y = NodeIndex(idy); in FindPath()
/external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc492 bool GraphCycles::InsertEdge(GraphId idx, GraphId idy) { in InsertEdge() argument
495 const int32_t y = NodeIndex(idy); in InsertEdge()
497 Node* ny = FindNode(r, idy); in InsertEdge()
624 int GraphCycles::FindPath(GraphId idx, GraphId idy, int max_path_len, in FindPath() argument
627 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
629 const int32_t y = NodeIndex(idy); in FindPath()
/external/openscreen/third_party/abseil/src/absl/synchronization/internal/
Dgraphcycles.cc493 bool GraphCycles::InsertEdge(GraphId idx, GraphId idy) { in InsertEdge() argument
496 const int32_t y = NodeIndex(idy); in InsertEdge()
498 Node* ny = FindNode(r, idy); in InsertEdge()
625 int GraphCycles::FindPath(GraphId idx, GraphId idy, int max_path_len, in FindPath() argument
628 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
630 const int32_t y = NodeIndex(idy); in FindPath()
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc492 bool GraphCycles::InsertEdge(GraphId idx, GraphId idy) { in InsertEdge() argument
495 const int32_t y = NodeIndex(idy); in InsertEdge()
497 Node* ny = FindNode(r, idy); in InsertEdge()
624 int GraphCycles::FindPath(GraphId idx, GraphId idy, int max_path_len, in FindPath() argument
627 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
629 const int32_t y = NodeIndex(idy); in FindPath()
/external/libtextclassifier/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc492 bool GraphCycles::InsertEdge(GraphId idx, GraphId idy) { in InsertEdge() argument
495 const int32_t y = NodeIndex(idy); in InsertEdge()
497 Node* ny = FindNode(r, idy); in InsertEdge()
624 int GraphCycles::FindPath(GraphId idx, GraphId idy, int max_path_len, in FindPath() argument
627 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
629 const int32_t y = NodeIndex(idy); in FindPath()
/external/llvm-project/mlir/test/Transforms/
Dmemref-bound-check.mlir25 %idy = affine.apply affine_map<(d0, d1) -> (10*d0 - d1 + 19)>(%i, %j)
26 %y = affine.load %B[%idy] : memref<111 x i32>
83 %idy = affine.apply affine_map<(d0, d1) -> (d0 floordiv 256)>(%i, %i)
84 %y = affine.load %B[%idy] : memref<1 x i32>
193 %idy = affine.apply affine_map<(d0) -> (100 * d0 floordiv 1000)> (%i0)
194 …affine.store %c9, %in[%idy] : memref<1xi32> // expected-error {{'affine.store' op memref out of up…
/external/llvm-project/mlir/test/Dialect/Affine/
Ddma-generate.mlir230 %idy = affine.apply affine_map<(d0, d1) [s0, s1] -> (d1 + s0 + s1)>(%i, %j)[%M, %N]
231 affine.load %A[%i, %idy] : memref<100 x 100 x f32>
260 %idy = affine.apply affine_map<(d1) [s0] -> (d1 + s0)>(%j)[%K]
261 affine.load %A[%i, %idy] : memref<100 x 100 x f32>
294 %idy = affine.apply affine_map<(d0) -> (d0 mod 128)>(%j)
299 %v = affine.load %arg0[%idx, %idy, %idz] : memref<1024 x 1024 x 1024 x f32>
322 %idy = affine.apply affine_map<(d0) -> (d0 + 128)>(%j)
326 %u = affine.load %A[%ishift, %idy] : memref<512 x 512 x f32>
/external/skqp/src/core/
DSkScan_Hairline.cpp224 uint32_t idy = SkScalarCeilToInt(dy); in compute_int_quad_dist() local
226 if (idx > idy) { in compute_int_quad_dist()
227 return idx + (idy >> 1); in compute_int_quad_dist()
229 return idy + (idx >> 1); in compute_int_quad_dist()
/external/skia/src/core/
DSkScan_Hairline.cpp233 uint32_t idy = SkScalarCeilToInt(dy); in compute_int_quad_dist() local
235 if (idx > idy) { in compute_int_quad_dist()
236 return idx + (idy >> 1); in compute_int_quad_dist()
238 return idy + (idx >> 1); in compute_int_quad_dist()
/external/libvpx/libvpx/vp9/decoder/
Dvp9_decodemv.c724 int idx, idy; in read_inter_block_mode_info() local
732 for (idy = 0; idy < 2; idy += num_4x4_h) { in read_inter_block_mode_info()
734 const int j = idy * 2 + idx; in read_inter_block_mode_info()
/external/libaom/libaom/av1/common/
Dblockd.h963 for (int idy = 0; idy < txh; idy += tx_unit) { in update_txk_array() local
965 xd->tx_type_map[(blk_row + idy) * stride + blk_col + idx] = tx_type; in update_txk_array()
/external/angle/src/tests/gl_tests/
DShaderStorageBufferTest.cpp1180 for (unsigned int idy = 0; idy < kComponentCount; idy++) in TEST_P() local
1182 EXPECT_EQ(kExpectedValues[idx][idy], *(ptr + idx * kComponentCount + idy)); in TEST_P()

12