HomeSort by relevance Sort by last modified time
    Searched defs:nn (Results 1 - 25 of 238) sorted by null

1 2 3 4 5 6 7 8 910

  /frameworks/ml/nn/common/include/
HalInterfaces.h 56 namespace nn { namespace in namespace:android
58 } // namespace nn
Operations.h 33 namespace nn { namespace in namespace:android
195 } // namespace nn
  /frameworks/ml/nn/common/operations/internal/
tensor_utils.h 23 namespace nn { namespace in namespace:android
119 } // namespace nn
common.h 31 namespace nn { namespace in namespace:android
76 } // namespace nn
  /bionic/libc/bionic/
sched_cpucount.c 32 int nn = 0; local
36 for ( ; nn < nn_max; nn++ ) {
37 count += __builtin_popcountl(set->__bits[nn]);
  /frameworks/ml/nn/common/operations/
Normalization.cpp 23 namespace nn { namespace in namespace:android
54 } // namespace nn
Concatenation.cpp 23 namespace nn { namespace in namespace:android
62 } // namespace nn
EmbeddingLookup.cpp 24 namespace nn { namespace in namespace:android
53 } // namespace nn
HashtableLookup.cpp 24 namespace nn { namespace in namespace:android
71 } // namespace nn
DepthwiseConv2D.cpp 24 namespace nn { namespace in namespace:android
113 } // namespace nn
EmbeddingLookup.h 33 namespace nn { namespace in namespace:android
57 } // namespace nn
FullyConnected.cpp 23 namespace nn { namespace in namespace:android
85 } // namespace nn
Pooling.cpp 23 namespace nn { namespace in namespace:android
161 } // namespace nn
Reshape.cpp 27 namespace nn { namespace in namespace:android
101 } // namespace nn
  /frameworks/ml/nn/common/operations/internal/optimized/
tensor_utils_impl.h 29 namespace nn { namespace in namespace:android
129 } // namespace nn
  /external/freetype/src/base/
ftadvanc.c 33 FT_UInt nn; local
50 for ( nn = 0; nn < count; nn++ )
51 advances[nn] = FT_MulDiv( advances[nn], scale, 64 );
120 FT_UInt num, end, nn; local
155 for ( nn = 0; nn < count; nn++
    [all...]
  /external/pdfium/third_party/freetype/src/base/
ftadvanc.c 33 FT_UInt nn; local
50 for ( nn = 0; nn < count; nn++ )
51 advances[nn] = FT_MulDiv( advances[nn], scale, 64 );
117 FT_UInt num, end, nn; local
152 for ( nn = 0; nn < count; nn++
    [all...]
  /frameworks/ml/nn/driver/sample/
SampleDriver.h 27 namespace nn { namespace in namespace:android
30 // Base class used to create sample drivers for the NN HAL. This class
68 } // namespace nn
  /frameworks/ml/nn/runtime/
CompilationBuilder.cpp 28 namespace nn { namespace in namespace:android
83 } // namespace nn
CompilationBuilder.h 24 namespace nn { namespace in namespace:android
54 } // namespace nn
  /bionic/libc/dns/net/
getservent.c 57 int nn,count; local
76 for (nn = 0; nn < count; nn++) {
107 for (nn = 0; nn < count; nn++) {
109 rs->servent.s_aliases[nn] = p2;
115 rs->servent.s_aliases[nn] = NULL;
  /external/fec/
rs-common.h 9 int nn; /* Symbols per block (= (1<<mm)-1) */ member in struct:rs
21 while (x >= rs->nn) {
22 x -= rs->nn;
23 x = (x >> rs->mm) + (x & rs->nn);
  /external/regex-re2/util/
sparse_array_test.cc 43 int nn = 0; local
45 ASSERT_EQ(order[nn++], i->index());
48 ASSERT_EQ(nn, n);
  /external/skia/tests/
PaintBreakTextTest.cpp 20 size_t nn = 0; local
33 if (n == nn) {
36 REPORTER_ASSERT_MESSAGE(reporter, n > nn, msg);
40 nn = n;
  /external/webrtc/webrtc/common_audio/signal_processing/
complex_bit_reverse.c 82 int nn = n - 1; local
85 for (m = 1; m <= nn; ++m) {
93 } while (l > nn - mr);

Completed in 4001 milliseconds

1 2 3 4 5 6 7 8 910