HomeSort by relevance Sort by last modified time
    Searched refs:start_depth (Results 1 - 15 of 15) sorted by null

  /external/gemmlowp/internal/
kernel_sse.h 42 const std::uint8_t* rhs_ptr, std::size_t start_depth,
175 "movl %[start_depth], %%ecx\n\t"
197 [start_depth] "g"(start_depth), [dst_col_stride] "g"(dst_col_stride),
216 const std::uint8_t* rhs_ptr, std::size_t start_depth,
469 "test %[start_depth], %[start_depth]\n\t"
504 [start_depth] "r"(start_depth),
kernel_neon.h 44 const std::uint8_t* rhs_ptr, std::size_t start_depth,
102 // Check if start_depth==0 to decide whether we will clear
104 "cmp %[start_depth], #0\n"
113 // Load accumulators (start_depth != 0)
141 // Clear accumulators (start_depth == 0)
276 [start_depth] "r"(start_depth),
306 const std::uint8_t* rhs_ptr, std::size_t start_depth,
342 "cmp %[start_depth], #0\n"
347 // If start_depth==0, we need to clear our global accumulator
    [all...]
compute.h 66 void ComputeRun(int start_row, int start_col, int start_depth,
68 packed_lhs_.seek_run(start_row, start_depth);
69 packed_rhs_.seek_run(start_col, start_depth);
74 packed_rhs_.current_data(), start_depth, depth);
78 int start_depth, int depth) {
85 ComputeRun(start_row + r, start_col + c, start_depth, depth);
pack.h 63 void seek_run(int start_width, int start_depth) const {
65 std::min<int>(params_.l1_depth, params_.l2_depth - start_depth);
66 pos_ = params_.l2_width * start_depth + start_width * kernel_run_depth;
174 SideMap block(int start_width, int start_depth, int block_width,
178 assert(start_depth >= 0);
179 assert(start_depth + block_depth <= depth_);
181 return SideMap(data(start_width, start_depth), block_width, block_depth,
335 void PackL1(int start_width, int width, int start_depth, int depth) {
338 packed_side_block_->seek_run(start_width + w, start_depth);
339 PackRun(start_width + w, ws, start_depth, depth)
    [all...]
kernel_reference.h 50 const std::uint8_t* rhs_ptr, std::size_t start_depth,
94 if (start_depth == 0) {
95 // start_depth == 0 means we haven't accumulated anything yet, so we need
kernel.h 213 const std::uint8_t* rhs_ptr, std::size_t start_depth,
  /art/runtime/openjdkjvmti/
ti_stack.h 60 jint start_depth,
ti_stack.cc 145 jint start_depth,
156 if (start_depth >= 0) {
170 if (collected_frames < static_cast<size_t>(-start_depth)) {
174 size_t count = std::min(static_cast<size_t>(-start_depth), static_cast<size_t>(max_frame_count));
176 &frames.data()[collected_frames + start_depth],
239 jint start_depth,
277 if (start_depth >= 0) {
280 static_cast<size_t>(start_depth),
284 if (closure.index < static_cast<size_t>(start_depth)) {
294 start_depth,
    [all...]
OpenjdkJvmTi.cc 262 jint start_depth,
269 start_depth,
    [all...]
  /frameworks/base/tools/aapt2/xml/
XmlPullParser.h 58 * Skips to the next direct descendant node of the given start_depth,
64 static bool NextChildNode(XmlPullParser* parser, size_t start_depth);
231 inline bool XmlPullParser::NextChildNode(XmlPullParser* parser, size_t start_depth) {
235 while (IsGoodEvent(event = parser->Next()) && parser->depth() > start_depth + 1) {
239 while ((event != Event::kEndElement || parser->depth() > start_depth) && IsGoodEvent(event)) {
  /external/gemmlowp/standalone/
neon-gemm-kernel-benchmark.cc 582 std::size_t start_depth = 123; local
755 "cmp %[start_depth], #0\n"
808 [start_depth] "r"(start_depth)
2253 std::size_t start_depth = 123; local
    [all...]
  /art/compiler/debug/
elf_debug_info_writer.h 168 int start_depth = info_.Depth(); local
261 CHECK_EQ(info_.Depth(), start_depth); // Balanced start/end.
  /art/runtime/openjdkjvmti/include/
jvmti.h     [all...]
  /prebuilts/jdk/jdk8/darwin-x86/include/
jvmti.h     [all...]
  /prebuilts/jdk/jdk8/linux-x86/include/
jvmti.h     [all...]

Completed in 394 milliseconds