/system/extras/tests/bionic/libc/common/ |
test_cpu_set.c | 70 int nn, nnMax = CPU_SETSIZE; local 81 for (nn = 0; nn < nnMax; nn++) 82 F(CPU_ISSET(nn, set)); 85 for (nn = 0; nn < nnMax; nn++) { 87 CPU_SET(nn, set); 90 T(CPU_ISSET(mm, set) == (mm == nn)); 100 TEST_INT_EQ(CPU_COUNT(set), nn+1); local 121 TEST_INT_EQ(CPU_COUNT(set), nn); local 132 int nn, nnMax; local 162 TEST_INT_EQ(CPU_COUNT_S(setsize, set), nn+1); local 183 TEST_INT_EQ(CPU_COUNT_S(setsize, set), nn); local [all...] |
bench_pthread.c | 117 int nn; local 119 for (nn = min_index; nn <= max_index; nn++) { 120 total += stats[nn]; 129 for (nn = min_index; nn <= max_index; nn++) { 130 printf(" %lld", (long long)stats[nn]);
|
/external/freetype/src/autofit/ |
afglobal.c | 161 FT_Long nn; local 164 for ( nn = 0; nn < globals->glyph_count; nn++ ) 166 if ( ( gscripts[nn] & ~AF_DIGIT ) == AF_SCRIPT_LIST_NONE ) 168 gscripts[nn] &= ~AF_SCRIPT_LIST_NONE; 169 gscripts[nn] |= AF_SCRIPT_LIST_DEFAULT; 216 FT_UInt nn; local 219 for ( nn = 0; nn < AF_SCRIPT_MAX; nn++ [all...] |
afwarp.c | 82 FT_UInt nn; local 86 for ( nn = 0; nn < 65; nn++ ) 87 scores[nn] = 0; 120 for ( nn = 0; nn < num_segments; nn++ ) 122 FT_Pos len = segments[nn].max_coord - segments[nn].min_coord 174 FT_UInt nn, num_points, num_segments; local [all...] |
/external/freetype/src/truetype/ |
ttpload.c | 489 FT_UInt version, nn, num_records; local 535 for ( nn = 0; nn < num_records; nn++ ) 540 face->hdmx_record_sizes[nn] = p[0]; 544 face->hdmx_record_count = nn; 580 FT_UInt nn; local 586 for ( nn = 0; nn < face->hdmx_record_count; nn++ [all...] |
ttdriver.c | 135 FT_UInt nn; local 143 for ( nn = 0; nn < count; nn++ ) 149 TT_Get_VMetrics( face, start + nn, &tsb, &ah ); 150 advances[nn] = ah; 155 for ( nn = 0; nn < count; nn++ ) 161 TT_Get_HMetrics( face, start + nn, &lsb, &aw ) [all...] |
/external/icu4c/common/ |
util.cpp | 46 int32_t nn = n; local 48 while (nn >= radix) { 49 nn /= radix;
|
/external/openssl/crypto/txt_db/ |
txt_db.c | 257 long i,j,n,nn,l,tot=0; local 265 nn=db->num_fields; 271 for (j=0; j<nn; j++) 276 if (!BUF_MEM_grow_clean(buf,(int)(l*2+nn))) goto err; 279 for (j=0; j<nn; j++)
|
/external/qemu/telephony/ |
modem_driver.c | 64 int nn; local 67 for (nn = 0; nn < len; nn++) { 68 int c = src[nn];
|
test2.c | 73 int nn, mm = 0; local 75 for (nn = 0; cmd[nn] != 0; nn++) { 76 int c = cmd[nn];
|
/sdk/emulator/opengl/tests/emulator_test_renderer/ |
main.cpp | 216 int nn; local 217 for (nn = 0; keymap[nn] >= 0; nn += 2) { 218 if (keymap[nn] == sym) 219 return keymap[nn+1];
|
/development/ndk/samples/hello-neon/jni/ |
helloneon.c | 48 int nn; local 49 for (nn = 0; nn < width; nn++) { 53 sum += kernel[mm]*input[nn+offset+mm]; 55 output[nn] = (short)((sum + 0x8000) >> 16); 91 int nn; local 92 for (nn = 0; nn < FIR_INPUT_SIZE; nn++) 149 int nn, fails = 0; local [all...] |
/device/generic/goldfish/libqemu/ |
test_guest_2.c | 60 int nn, count; local 155 for (nn = 0; nn < bufferSize; nn++) { 156 buffer[nn] = (uint8_t)nn; 194 for (nn = 0; nn < bufferSize; ) { 195 int avail = bufferSize - nn; 200 if (memcmp(buffer+nn, buffer2+nn, avail) != 0) [all...] |
/external/freetype/src/cff/ |
cffdrivr.c | 197 FT_UInt nn; local 204 for ( nn = 0; nn < count; nn++ ) 206 error = cff_glyph_load( slot, face->size, start + nn, flags ); 210 advances[nn] = ( flags & FT_LOAD_VERTICAL_LAYOUT )
|
/external/freetype/src/sfnt/ |
ttkern.c | 51 FT_UInt nn, num_tables; local 86 for ( nn = 0; nn < num_tables; nn++ ) 90 FT_UInt32 mask = (FT_UInt32)1UL << nn; 157 face->num_kern_tables = nn;
|
/external/opencv/cv/src/ |
cvkdtree.cpp | 88 typename __treetype::bbf_nn_pqueue nn; local 101 tr->find_nn_bbf(dj, k, emax, nn); 103 assert((int)nn.size() <= k); 104 for (unsigned int j = 0; j < nn.size(); ++j) { 105 *resultsj++ = *nn[j].p; 106 *distj++ = nn[j].dist; 108 std::fill(resultsj, resultsj + k - nn.size(), -1); 109 std::fill(distj, distj + k - nn.size(), 0);
|
/external/openssl/crypto/lhash/ |
lhash.c | 160 LHASH_NODE *n,*nn; local 170 nn=n->next; 172 n=nn; 182 LHASH_NODE *nn,**rn; local 193 if ((nn=(LHASH_NODE *)OPENSSL_malloc(sizeof(LHASH_NODE))) == NULL) 198 nn->data=data; 199 nn->next=NULL; 201 nn->hash=hash; 203 *rn=nn; 220 LHASH_NODE *nn,**rn local 408 unsigned long hash,nn; local [all...] |
/external/qemu/android/ |
framebuffer.c | 273 int nn; local 274 for (nn = 0; nn < framebuffer_fifo_count; nn++) { 275 QFrameBuffer* q = framebuffer_fifo[nn]; 286 int nn; local 287 for (nn = 0; nn < framebuffer_fifo_count; nn++) { 288 qframebuffer_poll(framebuffer_fifo[nn]); 295 int nn; local [all...] |
hw-events.c | 78 int nn; local 80 for (nn = 0; _codes[nn].type >= 0; nn++) { 81 if (_codes[nn].type == type) 82 return _codes[nn].table; 90 int nn; local 95 for (nn = 0; list[nn].name != NULL; nn++) [all...] |
main-emulator.c | 107 int nn; local 108 for (nn = 1; nn < argc; nn++) { 109 const char* opt = argv[nn]; 120 if (!strcmp(opt,"-avd") && nn+1 < argc) { 121 avdName = argv[nn+1];
|
/external/qemu/android/utils/ |
reflist.c | 127 int nn; local 132 for (nn = l->size; nn > 0; nn--) { 133 item = items[nn-1]; 142 items[nn-1] = NULL; 145 l->size = nn;
|
tempfile.c | 155 int nn; local 156 for (nn = 0; nn < t->count; nn++) 157 if (t->fds[nn] == fd) { 160 t->fds[nn] = t->fds[t->count]; 168 int nn; local 169 for (nn = 0; nn < t->count; nn++ [all...] |
/external/qemu/slirp/ |
socket.c | 157 int n, nn; local 171 nn = readv(so->s, (struct iovec *)iov, n); 172 DEBUG_MISC((dfd, " ... read nn = %d bytes\n", nn)); 174 nn = recv(so->s, iov[0].iov_base, iov[0].iov_len,0); 176 if (nn <= 0) { 177 if (nn < 0 && (errno == EINTR || errno == EAGAIN)) 180 DEBUG_MISC((dfd, " --- soread() disconnected, nn = %d, errno = %d-%s\n", nn, errno,strerror(errno))); 197 if (n == 2 && nn == iov[0].iov_len) 217 int n, nn, copy = size; local 352 int n,nn; local [all...] |
/system/core/run-as/ |
package.c | 210 int nn; local 222 for (nn = 1; dataPath[nn] != '\0'; nn++) 227 if (dataPath[nn] != '/') 231 if (dataPath[nn+1] == '\0') { 236 if (nn >= (int)(sizeof subpath)) { 242 if (nn >= 3 && 243 dataPath[nn-3] == '/' && 244 dataPath[nn-2] == '.' & [all...] |
/bionic/libc/bionic/ |
pthread-timers.c | 129 int nn; local 134 for (nn = 0; nn < MAX_THREAD_TIMERS; nn++) 135 t->timers[nn].id = TIMER_ID_NONE; 138 for (nn = 1; nn < MAX_THREAD_TIMERS; nn++) 139 t->timers[nn-1].next = &t->timers[nn]; [all...] |