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

  /external/ltp/tools/pounder21/test_scripts/
ramsnake 39 NUM_NODES=$(( (MEM_AVAIL * 1024 / (2 * NR_CPUS)) / $((`getconf LONG_BIT` / 8)) ))
44 "$POUNDER_HOME/timed_loop" 300 "$PROGRAM" -p $NR_CPUS -n $NUM_NODES &
  /external/curl/tests/unit/
unit1309.c 71 #define NUM_NODES 50
74 struct Curl_tree nodes[NUM_NODES*3];
81 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/
SCCIteratorTest.cpp 245 // Test SCC computation against every graph with NUM_NODES nodes or less.
248 #define NUM_NODES 4
249 #define NUM_GRAPHS (NUM_NODES * (NUM_NODES - 1))
250 typedef Graph<NUM_NODES> GT;
260 for (unsigned i = 0; i != NUM_NODES; ++i)
261 for (unsigned j = 0; j != NUM_NODES; ++j) {
290 for (unsigned i = 0; i != NUM_NODES; ++i)
299 for (unsigned i = 0; i != NUM_NODES; ++i)
305 for (unsigned j = 0; j != NUM_NODES; ++j
    [all...]
  /external/swiftshader/third_party/LLVM/unittests/ADT/
SCCIteratorTest.cpp 247 // Test SCC computation against every graph with NUM_NODES nodes or less.
250 #define NUM_NODES 4
251 #define NUM_GRAPHS (NUM_NODES * (NUM_NODES - 1))
252 typedef Graph<NUM_NODES> GT;
262 for (unsigned i = 0; i != NUM_NODES; ++i)
263 for (unsigned j = 0; j != NUM_NODES; ++j) {
292 for (unsigned i = 0; i != NUM_NODES; ++i)
301 for (unsigned i = 0; i != NUM_NODES; ++i)
307 for (unsigned j = 0; j != NUM_NODES; ++j
    [all...]
  /external/webp/src/enc/
quant_enc.c 574 #define NUM_NODES (MIN_DELTA + 1 + MAX_DELTA)
596 Node nodes[16][NUM_NODES];
597 ScoreState score_states[2][NUM_NODES];
    [all...]

Completed in 109 milliseconds