Searched defs:NN (Results 1 - 8 of 8) sorted by relevance

/external/valgrind/main/memcheck/tests/
H A Dunit_oset.c42 #define NN 1000 // Size of OSets being created macro
89 UWord* vs[NN];
91 UWord sorted_elts[NN]; // Used to test VG_(OSetGen_ResetIterAt)
102 for (i = 0; i < NN; i++) {
108 for (i = 0; i < NN; i++) {
109 UWord r1 = myrandom() % NN;
110 UWord r2 = myrandom() % NN;
117 for (i = 0; i < NN; i++) {
122 vg_assert( NN == VG_(OSetGen_Size)(oset) );
125 for (i = 0; i < NN;
[all...]
/external/opencv/cvaux/src/
H A Dcvlmeds.cpp941 int NN = N * N; local
1086 for( i = N - 1, iN = NN - N; i >= 0; i--, iN -= N )
1107 for( kN = lN; kN < NN; kN += N )
1131 for( i = N - 1, iN = NN - N; i >= 0; i--, iN -= N )
1338 for( jN = 0; jN < NN; jN += N )
1400 for( jN = 0; jN < NN; jN += N )
/external/llvm/lib/Transforms/Vectorize/
H A DBBVectorize.cpp2269 std::vector<Value *> &NN = CandidatePairs2[S->first]; local
2270 for (std::vector<Value *>::iterator N = NN.begin(), NE = NN.end();
/external/chromium_org/third_party/sqlite/src/src/
H A Dbtree.c5567 ** in a balancing operation. NN is the number of neighbors on either side
5570 ** NN neighbors on either side.
5572 ** The minimum value of NN is 1 (of course). Increasing NN above 1
5575 ** The value of NN appears to give the best results overall.
5577 #define NN 1 /* Number of neighbors on either side of pPage */ macro
5578 #define NB (NN*2+1) /* Total pages involved in the balance */
5881 ** that divide the siblings. An attempt is made to find NN siblings on
5883 ** if there are fewer than NN siblings on the other side. If pParent
/external/chromium_org/third_party/sqlite/amalgamation/
H A Dsqlite3.c52696 #define NN macro
[all...]
/external/sqlite/dist/orig/
H A Dsqlite3.c57397 #define NN macro
[all...]
/external/sqlite/dist/
H A Dsqlite3.c57417 #define NN macro
[all...]
/external/owasp/sanitizer/tools/findbugs/lib/
H A Dfindbugs.jarMETA-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd/ edu/umd/cs/ edu/ ...

Completed in 557 milliseconds