HomeSort by relevance Sort by last modified time
    Searched defs:NN (Results 1 - 8 of 8) sorted by null

  /external/valgrind/main/memcheck/tests/
unit_oset.c 33 #define NN 1000 // Size of OSets being created
80 Word* vs[NN];
98 for (i = 0; i < NN; i++) {
103 for (i = 0; i < NN; i++) {
104 Word r1 = myrandom() % NN;
105 Word r2 = myrandom() % NN;
112 for (i = 0; i < NN; i++) {
117 vg_assert( NN == VG_(OSetGen_Size)(oset) );
120 for (i = 0; i < NN; i++) {
128 for (i = 0; i < NN; i++)
    [all...]
  /external/skia/bench/
MathBench.cpp 228 NN = SkBENCHLOOP(1000),
257 for (int j = 0; j < NN; ++j) {
263 for (int j = 0; j < NN; ++j) {
  /external/webkit/Source/WebCore/platform/graphics/android/context/
RTree.cpp 128 // we then create a new node NN that we try to attach to N's parent.
336 Node* NN = 0;
338 NN = split();
340 adjustTree(this, NN);
459 Node* NN = Node::create(m_tree);
461 NN->simpleAdd(listB->m_children[i]);
462 NN->tighten();
464 return NN;
472 void Node::adjustTree(Node* N, Node* NN)
476 if (N->isRoot() && NN) {
    [all...]
  /ndk/sources/host-tools/nawk-20071023/
awk.h 35 #define NN(p) ((p) ? (p) : "(null)") /* guaranteed non-null for dprintf
  /external/opencv/cvaux/src/
cvlmeds.cpp 941 int NN = N * N;
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 )
    [all...]
  /frameworks/base/services/java/com/android/server/wm/
WindowManagerService.java     [all...]
  /external/sqlite/dist/orig/
sqlite3.c     [all...]
  /external/sqlite/dist/
sqlite3.c     [all...]

Completed in 1303 milliseconds