Home
last modified time | relevance | path

Searched refs:in_c (Results 1 – 6 of 6) sorted by relevance

/external/tensorflow/tensorflow/core/kernels/
Ddepthwise_conv_op.h222 const int64 in_c = in_c_start + f_c;
224 if (in_r >= 0 && in_r < args.in_rows && in_c >= 0 &&
225 in_c < args.in_cols) {
227 input + (in_r * args.in_cols + in_c) * args.in_depth;
276 const int64 in_c = in_c_start + f_c;
278 if (in_r >= 0 && in_r < args.in_rows && in_c >= 0 &&
279 in_c < args.in_cols) {
281 input + (in_r * args.in_cols + in_c) * args.in_depth;
309 const int64 in_c = in_c_start + f_c;
311 if (in_r >= 0 && in_r < args.in_rows && in_c >= 0 &&
[all …]
Ddepthwise_conv_grad_op.cc194 const int64 in_r, const int64 in_c, in CopyOutputBackpropRegion() argument
212 static_cast<int64>(0), (in_c - filter_cols + pad_cols + stride) / stride); in CopyOutputBackpropRegion()
213 const int64 out_c_end = std::min(out_cols - 1, (in_c + pad_cols) / stride); in CopyOutputBackpropRegion()
231 const int64 f_c = in_c + pad_cols - out_c * stride; in CopyOutputBackpropRegion()
290 const int64 in_r, const int64 in_c, in ComputeBackpropInput() argument
306 const int64 base_output_index = (in_r * args.in_cols + in_c) * in_depth; in ComputeBackpropInput()
448 for (int64 in_c = 0; in_c < args.in_cols; ++in_c) { in operator ()() local
451 args, padded_filter_inner_dim_size, in_r, in_c, in operator ()()
456 in_c, filter_data, out_bprop_buf, in operator ()()
479 for (int in_c = 0; in_c < args.in_cols; ++in_c) { in DepthwiseConvBackpropInputReference() local
[all …]
Ddeep_conv2d.cc651 const int64 in_c = in_c_start + c; in operator ()() local
652 if (in_c < 0 || in_c >= args.in_cols) continue; in operator ()()
654 auto* in = input + (in_r * args.in_cols + in_c) * args.in_depth; in operator ()()
710 const int64 in_c = in_c_start + t * tile_stride_cols; in operator ()() local
711 CopyInputTile<T>()(args, transform, num_tiles, in_r, in_c, input, in operator ()()
747 const int64 num_tiles, const int64 in_r, const int64 in_c, in operator ()()
796 const int64 out_c_start = (in_c + t * tile_stride_cols) + in operator ()()
881 const Conv2DState<T>& cs, const int64 in_r, const int64 in_c, in operator ()()
886 TransformInputTiles<T>()(args, transform, num_tiles, in_r, in_c, input, in operator ()()
913 TransformOutputTile<T>()(args, transform, num_tiles, in_r, in_c, in operator ()()
[all …]
Dfractional_avg_pool_op.cc300 for (int64 in_c = in_col_start; in_c <= in_col_end; ++in_c) { in Compute() local
301 const int64 in_index = (b * in_rows + in_r) * in_cols + in_c; in Compute()
Deigen_pooling_test.cc422 const int in_c = c + k - dc; in TEST() local
424 in_r < input_rows && in_c >= 0 && in_c < input_cols) { in TEST()
425 expected_sum += input(d, in_p, in_r, in_c, b); in TEST()
500 const int in_c = c + k - dc; in TEST() local
502 in_r < input_rows && in_c >= 0 && in_c < input_cols) { in TEST()
503 expected_sum += input(b, in_c, in_r, in_p, d); in TEST()
Deigen_spatial_convolutions_test.cc1192 const int in_c = c - dc + k * stride; in TEST() local
1193 if (in_p >= 0 && in_r >= 0 && in_c >= 0 && in_p < in_depth && in TEST()
1194 in_r < in_rows && in_c < in_cols) { in TEST()
1196 input(id, in_p, in_r, in_c) * kernel(od, id, p, r, c); in TEST()
1263 const int in_c = c - dc + k * stride; in TEST() local
1264 if (in_p >= 0 && in_r >= 0 && in_c >= 0 && in_p < in_depth && in TEST()
1265 in_r < in_rows && in_c < in_cols) { in TEST()
1267 input(in_c, in_r, in_p, id) * kernel(c, r, p, id, od); in TEST()