Home
last modified time | relevance | path

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

/external/libaom/libaom/av1/encoder/
Dpartition_model_weights.h1987 #define NUM_NODES 32 // Hidden layer size macro
1991 NUM_NODES] = {
2036 static const float av1_rect_partition_nn_bias_8_layer0[NUM_NODES] = {
2044 static const float av1_rect_partition_nn_weights_8_layer1[NUM_NODES *
2073 NUM_NODES,
2081 NUM_NODES] = {
2126 static const float av1_rect_partition_nn_bias_16_layer0[NUM_NODES] = {
2134 static const float av1_rect_partition_nn_weights_16_layer1[NUM_NODES *
2163 NUM_NODES,
2171 NUM_NODES] = {
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/
DSCCIteratorTest.cpp23 #define NUM_NODES 4 in TEST() macro
24 #define NUM_GRAPHS (NUM_NODES * (NUM_NODES - 1)) in TEST()
25 typedef Graph<NUM_NODES> GT; in TEST()
35 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
36 for (unsigned j = 0; j != NUM_NODES; ++j) { in TEST()
65 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
75 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
81 for (unsigned j = 0; j != NUM_NODES; ++j) in TEST()
105 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
/external/curl/tests/unit/
Dunit1309.c72 #define NUM_NODES 50 macro
75 struct Curl_tree nodes[NUM_NODES*3];
76 size_t storage[NUM_NODES*3];
83 for(i = 0; i < NUM_NODES; i++) {
96 for(i = 0; i < NUM_NODES; i++) {
97 int rem = (i + 7)%NUM_NODES;
113 for(i = 0; i < NUM_NODES; i++) {
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp248 #define NUM_NODES 4 in TEST() macro
249 #define NUM_GRAPHS (NUM_NODES * (NUM_NODES - 1)) in TEST()
250 typedef Graph<NUM_NODES> GT; in TEST()
260 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
261 for (unsigned j = 0; j != NUM_NODES; ++j) { in TEST()
290 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
299 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
305 for (unsigned j = 0; j != NUM_NODES; ++j) in TEST()
328 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
/external/swiftshader/third_party/LLVM/unittests/ADT/
DSCCIteratorTest.cpp250 #define NUM_NODES 4 in TEST() macro
251 #define NUM_GRAPHS (NUM_NODES * (NUM_NODES - 1)) in TEST()
252 typedef Graph<NUM_NODES> GT; in TEST()
262 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
263 for (unsigned j = 0; j != NUM_NODES; ++j) { in TEST()
292 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
301 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
307 for (unsigned j = 0; j != NUM_NODES; ++j) in TEST()
330 for (unsigned i = 0; i != NUM_NODES; ++i) in TEST()
/external/webp/src/enc/
Dquant_enc.c575 #define NUM_NODES (MIN_DELTA + 1 + MAX_DELTA) macro
597 Node nodes[16][NUM_NODES]; in TrellisQuantizeBlock()
598 ScoreState score_states[2][NUM_NODES]; in TrellisQuantizeBlock()