Home
last modified time | relevance | path

Searched refs:start_depth (Results 1 – 15 of 15) sorted by relevance

/external/gemmlowp/internal/
Dkernel_neon.h44 const std::uint8_t* rhs_ptr, std::size_t start_depth, in Run()
276 [start_depth] "r"(start_depth), in Run()
306 const std::uint8_t* rhs_ptr, std::size_t start_depth, in Run()
647 [start_depth] "r"(start_depth), [dst_col_stride] "r"(dst_col_stride), in Run()
679 const std::uint8_t* rhs_ptr, std::size_t start_depth, in Run()
910 [start_depth] "r"(start_depth), in Run()
941 const std::uint8_t* rhs_ptr, std::size_t start_depth, in Run()
1251 [start_depth] "r"(start_depth) in Run()
1275 const std::uint8_t* rhs_ptr, std::size_t start_depth, in Run()
1604 [start_depth] "r"(start_depth), in Run()
Dpack.h63 void seek_run(int start_width, int start_depth) const { in seek_run() argument
65 std::min<int>(params_.l1_depth, params_.l2_depth - start_depth); in seek_run()
66 pos_ = params_.l2_width * start_depth + start_width * kernel_run_depth; in seek_run()
174 SideMap block(int start_width, int start_depth, int block_width, in block() argument
178 assert(start_depth >= 0); in block()
179 assert(start_depth + block_depth <= depth_); in block()
181 return SideMap(data(start_width, start_depth), block_width, block_depth, in block()
335 void PackL1(int start_width, int width, int start_depth, int depth) { in PackL1() argument
338 packed_side_block_->seek_run(start_width + w, start_depth); in PackL1()
339 PackRun(start_width + w, ws, start_depth, depth); in PackL1()
[all …]
Dkernel_sse.h42 const std::uint8_t* rhs_ptr, std::size_t start_depth, in Run()
197 [start_depth] "g"(start_depth), [dst_col_stride] "g"(dst_col_stride), in Run()
216 const std::uint8_t* rhs_ptr, std::size_t start_depth, in Run()
504 [start_depth] "r"(start_depth), in Run()
Dcompute.h79 void ComputeRun(int start_row, int start_col, int start_depth, in ComputeRun() argument
81 packed_lhs_.seek_run(start_row, start_depth); in ComputeRun()
82 packed_rhs_.seek_run(start_col, start_depth); in ComputeRun()
87 packed_rhs_.current_data(), start_depth, depth); in ComputeRun()
92 int start_depth, int depth) { in ComputeL1() argument
99 ComputeRun(start_row + r, start_col + c, start_depth, depth); in ComputeL1()
Dkernel_msa.h54 const std::uint8_t* rhs_ptr, std::size_t start_depth, in Run()
316 [start_depth] "r"(start_depth) in Run()
Dkernel_reference.h50 const std::uint8_t* rhs_ptr, std::size_t start_depth, in Run()
94 if (start_depth == 0) { in Run()
Dkernel.h213 const std::uint8_t* rhs_ptr, std::size_t start_depth,
/external/tensorflow/tensorflow/core/kernels/
Deigen_spatial_convolutions.h120 const StorageIndex start_depth =
124 std::min<StorageIndex>(start_depth + (peeled_k - k),
132 eigen_assert((max_depth - start_depth) % packet_size == 0);
133 StorageIndex d = start_depth;
143 StorageIndex d = start_depth;
169 const StorageIndex start_depth =
172 rhs.maxDepth(peeled_k - k, start_depth);
180 eigen_assert((max_depth - start_depth) % packet_size == 0);
181 StorageIndex d = start_depth;
194 StorageIndex d = start_depth;
Deigen_spatial_convolutions-inl.h640 const Index start_depth) const { in maxDepth() argument
641 return std::min<Index>(start_depth + num_elements, patchDepth()); in maxDepth()
877 const Index start_depth =
883 (max_row - start_row) * rhs.patchDepth() - start_depth;
887 start_depth + std::min<Index>(peeled_k - k, squeeze_length);
888 eigen_assert((max_depth - start_depth) % packet_size == 0);
895 for (Index d = start_depth; d < max_depth; d += packet_size) {
929 const Index start_depth = ((c == start_col) && (r == start_row))
932 const Index max_depth = rhs.maxDepth(peeled_k - k, start_depth);
933 eigen_assert((max_depth - start_depth) % packet_size == 0);
[all …]
Deigen_cuboid_convolution.h807 const Index start_depth) const { in maxDepth() argument
808 return std::min<Index>(start_depth + num_elements, patchDepth()); in maxDepth()
1094 const Index start_depth =
1098 const Index max_depth = rhs.maxDepth(peeled_k - k, start_depth);
1099 eigen_assert((max_depth - start_depth) % packet_size == 0);
1101 for (Index d = start_depth; d < max_depth; d += packet_size) {
1276 const Index start_depth =
1280 const Index max_depth = rhs.maxDepth(peeled_k - k, start_depth);
1281 eigen_assert((max_depth - start_depth) % packet_size == 0);
1283 for (Index d = start_depth; d < max_depth; d += packet_size) {
[all …]
/external/gemmlowp/standalone/
Dneon-gemm-kernel-benchmark.cc597 std::size_t start_depth = 123; in Run() local
823 [start_depth] "r"(start_depth) in Run()
2268 std::size_t start_depth = 123; in Run() local
2510 [start_depth] "r"(start_depth) in Run()
/external/gemmlowp/doc/
Dpacking.md114 void seek_run(int start_width, int start_depth) const {
116 std::min<int>(params_.l1_depth, params_.l2_depth - start_depth);
117 pos_ = params_.l2_width * start_depth + start_width * kernel_run_depth;
/external/oj-libjdwp/src/share/javavm/export/
Djvmti.h1539 jint start_depth,
1901 jint start_depth, in GetStackTrace()
1905 …return functions->GetStackTrace(this, thread, start_depth, max_frame_count, frame_buffer, count_pt… in GetStackTrace()
/external/tensorflow/tensorflow/lite/kernels/internal/optimized/
Ddepthwiseconv_uint8_3x3_filter.h3261 uint8* output_ptr, int64_t start_depth, int64_t end_depth,
3264 for (; start_depth <= end_depth - 8; start_depth += 8) {
Doptimized_ops.h1761 int start_depth, int end_depth) { in MeanImpl() argument
1801 int out_d = start_depth; in MeanImpl()