Searched refs:NN (Results 1 - 12 of 12) sorted by relevance
| /external/valgrind/main/memcheck/tests/ |
| H A D | unit_oset.c | 33 #define NN 1000 // Size of OSets being created macro
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;
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/android/context/ |
| H A D | RTree.cpp | 128 // we then create a new node NN that we try to attach to N's parent.
336 Node* NN = 0; local
338 NN = split();
340 adjustTree(this, NN);
459 Node* NN = Node::create(m_tree); local
461 NN->simpleAdd(listB->m_children[i]);
462 NN->tighten();
464 return NN;
472 void Node::adjustTree(Node* N, Node* NN) argument
476 if (N->isRoot() && NN) {
[all...] |
| H A D | RTree.h | 149 void adjustTree(Node* N, Node* NN);
|
| /external/srec/tools/test_swiarb/ |
| H A D | test_swiarb.c | 45 #define printf_vector(HEAD, FMT, PTR, NN) { unsigned int iI; printf(HEAD); for(iI=0;iI<(NN);iI++) printf(FMT, PTR[iI]); printf("\n"); }
|
| /external/clang/test/Sema/ |
| H A D | block-return.c | 130 int (^NN) (void) = ^{ return cint; };
|
| /external/skia/bench/ |
| H A D | MathBench.cpp | 228 NN = SkBENCHLOOP(1000), enumerator in enum:IsFiniteBench::__anon11930
257 for (int j = 0; j < NN; ++j) {
263 for (int j = 0; j < NN; ++j) {
|
| /external/elfutils/libdwfl/ |
| H A D | link_map.c | 651 #define AUXV_SCAN(NN, BL) do \
653 const Elf##NN##_auxv_t *av = auxv; \
656 Elf##NN##_Addr val = BL##NN (av[i].a_un.a_val); \
657 if (av[i].a_type == BL##NN (AT_ENTRY)) \
659 else if (av[i].a_type == BL##NN (AT_PHDR)) \
661 else if (av[i].a_type == BL##NN (AT_PHNUM)) \
663 else if (av[i].a_type == BL##NN (AT_PHENT)) \
665 else if (av[i].a_type == BL##NN (AT_PAGESZ)) \
|
| /external/opencv/cvaux/src/ |
| H A D | cvlmeds.cpp | 941 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/srec/srec/clib/ |
| H A D | swicms.c | 31 #define printf_vector(HEAD, FMT, PTR, NN) { int i; LCHAR buffer[256]; sprintf(buffer, HEAD); sprintf(buffer + LSTRLEN(buffer), " %x", (int)PTR); for (i=0; i<(NN); ++i) sprintf(buffer + LSTRLEN(buffer), FMT, PTR[i]); PLogMessage(buffer); }
|
| /external/libmtp/ |
| H A D | configure | 15802 /* le (little-endian), NN is 16 or 32 (number of bits) and a, */
|
| /external/sqlite/dist/orig/ |
| H A D | sqlite3.c | 55034 #define NN macro
[all...] |
| /external/sqlite/dist/ |
| H A D | sqlite3.c | 55047 #define NN macro
[all...] |
Completed in 991 milliseconds