| /external/tensorflow/tensorflow/cc/framework/ |
| D | gradient_checker.cc | 161 for (int x_idx = 0; x_idx < x_num; x_idx++) { in ComputeTheoreticalJacobianTranspose() local
162 if (x_shapes[x_idx] != dxout[x_idx].shape()) { in ComputeTheoreticalJacobianTranspose()
163 return errors::Internal("Gradient for input ", x_idx, in ComputeTheoreticalJacobianTranspose()
165 x_shapes[x_idx].DebugString(), " but was ", in ComputeTheoreticalJacobianTranspose()
166 dxout[x_idx].shape().DebugString()); in ComputeTheoreticalJacobianTranspose()
168 const int64_t x_size = x_shapes[x_idx].num_elements(); in ComputeTheoreticalJacobianTranspose()
169 auto jacobian = (*jacobian_ts)[x_idx * y_num + y_idx].matrix<JAC_T>(); in ComputeTheoreticalJacobianTranspose()
170 auto dx_flat = dxout[x_idx].flat<X_T>(); in ComputeTheoreticalJacobianTranspose()
197 for (int x_idx = 0; x_idx < x_datas->size(); x_idx++) { in EvaluateGraph() local
199 if (y_data.SharesBufferWith((*x_datas)[x_idx])) { in EvaluateGraph()
[all …]
|
| /external/ComputeLibrary/src/core/CL/cl_kernels/common/ |
| D | arg_min_max.cl | 63 …ev_out(__global const DATA_TYPE *input, __global const DATA_TYPE_OUTPUT *prev_res, const int x_idx)
65 int end_elem = (x_idx + 1) * 16;
68 end_elem = WIDTH - x_idx * 16;
84 inline DATA_TYPE_OUTPUT arg_idx_min(__global const DATA_TYPE *input, const int x_idx)
94 int x_elem = x_idx * 16;
132 …ev_out(__global const DATA_TYPE *input, __global const DATA_TYPE_OUTPUT *prev_res, const int x_idx)
134 int end_elem = (x_idx + 1) * 16;
137 end_elem = WIDTH - x_idx * 16;
153 inline DATA_TYPE_OUTPUT arg_idx_max(__global const DATA_TYPE *input, const int x_idx)
163 int x_elem = x_idx * 16;
[all …]
|
| /external/libaom/av1/encoder/ |
| D | partition_search.c | 1912 int x_idx = (i & 1) * hbs; in av1_rd_use_partition() local
1917 (mi_col + x_idx >= mi_params->mi_cols)) in av1_rd_use_partition()
1924 mi_row + y_idx, mi_col + x_idx, subsize, &tmp_rdc.rate, in av1_rd_use_partition()
1966 int x_idx = (i & 1) * hbs; in av1_rd_use_partition() local
1971 (mi_col + x_idx >= mi_params->mi_cols)) in av1_rd_use_partition()
1979 pick_sb_modes(cpi, tile_data, x, mi_row + y_idx, mi_col + x_idx, &tmp_rdc, in av1_rd_use_partition()
1993 encode_sb(cpi, td, tile_data, tp, mi_row + y_idx, mi_col + x_idx, in av1_rd_use_partition()
2413 int x_idx = (i & 1) * hbs; in try_split_partition() local
2416 (mi_col + x_idx >= mi_params->mi_cols)) in try_split_partition()
2419 cm->above_contexts.txfm[tile_info->tile_row] + mi_col + x_idx; in try_split_partition()
[all …]
|
| D | encodeframe_utils.c | 218 int i, x_idx, y; in av1_update_state() local
336 for (x_idx = 0; x_idx < cols; x_idx++) xd->mi[x_idx + y * mis] = mi_addr; in av1_update_state()
705 int x_idx = (i & 1) * hbs; in av1_is_leaf_split_partition() local
708 (mi_col + x_idx >= cm->mi_params.mi_cols)) in av1_is_leaf_split_partition()
710 if (get_partition(cm, mi_row + y_idx, mi_col + x_idx, subsize) != in av1_is_leaf_split_partition()
|
| D | partition_strategy.c | 1174 const int x_idx = (i & 1) * bw / 2; in av1_ml_prune_rect_partition() local
1176 buf.buf = x->plane[0].src.buf + x_idx + y_idx * buf.stride; in av1_ml_prune_rect_partition()
|
| /external/ComputeLibrary/cl_kernels/common/ |
| D | arg_min_max.clembed | 1279 …ev_out(__global const DATA_TYPE *input, __global const DATA_TYPE_OUTPUT *prev_res, const int x_idx)
1281 int end_elem = (x_idx + 1) * 16;
1284 end_elem = WIDTH - x_idx * 16;
1295 inline DATA_TYPE_OUTPUT arg_idx_min(__global const DATA_TYPE *input, const int x_idx)
1305 int x_elem = x_idx * 16;
1338 …ev_out(__global const DATA_TYPE *input, __global const DATA_TYPE_OUTPUT *prev_res, const int x_idx)
1340 int end_elem = (x_idx + 1) * 16;
1343 end_elem = WIDTH - x_idx * 16;
1354 inline DATA_TYPE_OUTPUT arg_idx_max(__global const DATA_TYPE *input, const int x_idx)
1364 int x_elem = x_idx * 16;
[all …]
|
| /external/libvpx/vp9/encoder/ |
| D | vp9_encodeframe.c | 1764 int i, x_idx, y; in update_state() local
1827 for (x_idx = 0; x_idx < mi_width; x_idx++) in update_state()
1828 if ((xd->mb_to_right_edge >> (3 + MI_SIZE_LOG2)) + mi_width > x_idx && in update_state()
1830 xd->mi[x_idx + y * mis] = mi_addr; in update_state()
2785 int x_idx = (i & 1) * (mi_step >> 1); in rd_use_partition() local
2789 if ((mi_row + y_idx >= cm->mi_rows) || (mi_col + x_idx >= cm->mi_cols)) in rd_use_partition()
2794 tp, mi_row + y_idx, mi_col + x_idx, subsize, in rd_use_partition()
2829 int x_idx = (i & 1) * (mi_step >> 1); in rd_use_partition() local
2835 if ((mi_row + y_idx >= cm->mi_rows) || (mi_col + x_idx >= cm->mi_cols)) in rd_use_partition()
2840 rd_pick_sb_modes(cpi, tile_data, x, mi_row + y_idx, mi_col + x_idx, in rd_use_partition()
[all …]
|
| /external/libaom/test/ |
| D | avg_test.cc | 218 typedef void (*AverageFunction_8x8_quad)(const uint8_t *s, int pitch, int x_idx,
|
| /external/tensorflow/tensorflow/compiler/mlir/tensorflow/ir/ |
| D | tf_ops_n_z.cc | 2630 const int64_t x_idx = e.value().getSExtValue(); in verify() local
2631 const int64_t x_dim = x_type.getDimSize(x_idx); in verify()
2636 << "to be equal to x.shape[perm[" << x_idx << "]] " in verify()
|