HomeSort by relevance Sort by last modified time
    Searched defs:nn (Results 1 - 25 of 167) sorted by null

1 2 3 4 5 6 7

  /bionic/libc/bionic/
sched_cpucount.c 32 int nn = 0; local
36 for ( ; nn < nn_max; nn++ ) {
37 count += __builtin_popcountl(set->__bits[nn]);
  /external/freetype/src/base/
ftadvanc.c 33 FT_UInt nn; local
50 for ( nn = 0; nn < count; nn++ )
51 advances[nn] = FT_MulDiv( advances[nn], scale, 64 );
120 FT_UInt num, end, nn; local
155 for ( nn = 0; nn < count; nn++
    [all...]
  /external/pdfium/third_party/freetype/src/base/
ftadvanc.c 33 FT_UInt nn; local
50 for ( nn = 0; nn < count; nn++ )
51 advances[nn] = FT_MulDiv( advances[nn], scale, 64 );
117 FT_UInt num, end, nn; local
152 for ( nn = 0; nn < count; nn++
    [all...]
  /bionic/libc/dns/net/
getservent.c 57 int nn,count; local
76 for (nn = 0; nn < count; nn++) {
107 for (nn = 0; nn < count; nn++) {
109 rs->servent.s_aliases[nn] = p2;
115 rs->servent.s_aliases[nn] = NULL;
  /external/fec/
rs-common.h 9 int nn; /* Symbols per block (= (1<<mm)-1) */ member in struct:rs
21 while (x >= rs->nn) {
22 x -= rs->nn;
23 x = (x >> rs->mm) + (x & rs->nn);
rstest.c 54 int nn,kk; local
56 nn = (1<<Tab[i].symsize) - 1;
57 kk = nn - Tab[i].nroots;
58 printf("Testing (%d,%d) code...\n",nn,kk);
68 int nn = 255; local
69 unsigned char block[nn],tblock[nn];
70 int errlocs[nn],derrlocs[nn];
83 for(errors=0;errors<=(nn-kk)/2;errors++)
140 int nn = (1<<e->symsize) - 1; local
221 int nn = (1<<e->symsize) - 1; local
    [all...]
  /external/regex-re2/util/
sparse_array_test.cc 43 int nn = 0; local
45 ASSERT_EQ(order[nn++], i->index());
48 ASSERT_EQ(nn, n);
  /external/skia/tests/
PaintBreakTextTest.cpp 20 size_t nn = 0; local
33 if (n == nn) {
36 REPORTER_ASSERT_MESSAGE(reporter, n > nn, msg);
40 nn = n;
  /external/webrtc/webrtc/common_audio/signal_processing/
complex_bit_reverse.c 82 int nn = n - 1; local
85 for (m = 1; m <= nn; ++m) {
93 } while (l > nn - mr);
  /device/linaro/bootloader/edk2/StdLib/BsdSocketLib/
getnetbynis.c 133 int nn; local
142 for (nn = 4, net2 = addr; net2; net2 >>= 8) {
143 netbr[--nn] = net2 & 0xff;
146 switch (nn) {
  /external/clang/test/CodeGenCXX/
debug-info-template.cpp 121 struct NN {
124 // CHECK: !DIGlobalVariable(name: "nn"
126 // CHECK-SAME: variable: %struct.NN* @nn
130 // CHECK: ![[NNT]] ={{.*}}!DICompositeType(tag: DW_TAG_structure_type, name: "NN<tmpl_impl, &glb, &glb>",
139 NN<tmpl_impl, glb, glb> nn; variable
  /external/freetype/src/autofit/
afglobal.c 278 FT_Long nn; local
281 for ( nn = 0; nn < globals->glyph_count; nn++ )
283 if ( ( gstyles[nn] & AF_STYLE_MASK ) == AF_STYLE_UNASSIGNED )
285 gstyles[nn] &= ~AF_STYLE_MASK;
286 gstyles[nn] |= globals->module->fallback_style;
392 FT_UInt nn; local
395 for ( nn = 0; nn < AF_STYLE_MAX; nn++
    [all...]
  /external/freetype/src/truetype/
ttpload.c 527 FT_UInt nn, num_records; local
578 for ( nn = 0; nn < num_records; nn++ )
583 face->hdmx_record_sizes[nn] = p[0];
587 face->hdmx_record_count = nn;
623 FT_UInt nn; local
629 for ( nn = 0; nn < face->hdmx_record_count; nn++
    [all...]
  /external/google-breakpad/src/client/linux/minidump_writer/
cpu_set.h 114 for (size_t nn = 0; nn < kMaskWordCount; ++nn)
115 mask_[nn] &= other.mask_[nn];
121 for (size_t nn = 0; nn < kMaskWordCount; ++nn) {
122 result += __builtin_popcount(mask_[nn]);
129 size_t nn = static_cast<size_t>(index) local
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/text/
RBNFChinesePostProcessor.java 102 int nn = buf.lastIndexOf(ling, x); local
104 if (nn > m) {
105 ns = (nn > 0 && buf.charAt(nn-1) != '*') ? 2 : 1;
117 n = nn; // remember optional ling to right
128 buf.delete(nn-1, nn+ling.length()); // delete current optional ling
142 buf.delete(nn-1, nn+ling.length()); // delete current optional ling
  /external/icu/icu4c/source/common/
util.cpp 48 int32_t nn = n; local
50 while (nn >= radix) {
51 nn /= radix;
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
RBNFChinesePostProcessor.java 101 int nn = buf.lastIndexOf(ling, x); local
103 if (nn > m) {
104 ns = (nn > 0 && buf.charAt(nn-1) != '*') ? 2 : 1;
116 n = nn; // remember optional ling to right
127 buf.delete(nn-1, nn+ling.length()); // delete current optional ling
141 buf.delete(nn-1, nn+ling.length()); // delete current optional ling
  /external/pdfium/third_party/freetype/src/truetype/
ttpload.c 497 FT_UInt version, nn, num_records; local
545 for ( nn = 0; nn < num_records; nn++ )
550 face->hdmx_record_sizes[nn] = p[0];
554 face->hdmx_record_count = nn;
590 FT_UInt nn; local
596 for ( nn = 0; nn < face->hdmx_record_count; nn++
    [all...]
  /external/pdfium/third_party/freetype/src/type1/
t1gload.c 221 FT_UInt nn; local
227 for ( nn = 0; nn < count; nn++ )
228 advances[nn] = 0;
255 for ( nn = 0; nn < count; nn++ )
257 error = T1_Parse_Glyph( &decoder, first + nn );
259 advances[nn] = FIXED_TO_INT( decoder.builder.advance.x )
    [all...]
  /external/toybox/toys/other/
stat.c 146 struct {unsigned num; char *name;} nn[] = { local
158 for (i=0; i<ARRAY_LEN(nn); i++)
159 if (nn[i].num == statfs->f_type) s = nn[i].name;
  /libcore/ojluni/src/main/java/java/io/
LineNumberReader.java 232 int nn = (int) Math.min(n, maxSkipBufferSize); local
234 if ((skipBuffer == null) || (skipBuffer.length < nn))
235 skipBuffer = new char[nn];
238 int nc = read(skipBuffer, 0, (int) Math.min(r, nn));
Reader.java 179 int nn = (int) Math.min(n, maxSkipBufferSize); local
181 if ((skipBuffer == null) || (skipBuffer.length < nn))
182 skipBuffer = new char[nn];
185 int nc = read(skipBuffer, 0, (int)Math.min(r, nn));
  /libcore/ojluni/src/main/java/sun/nio/ch/
NativeThreadSet.java 54 int nn = on * 2; local
55 long[] nelts = new long[nn];
  /art/test/451-spill-splot/src/
Main.java 46 float nn = 10; local
49 System.out.println(aa + bb + cc + dd + ee + ff + gg + hh + ii + jj + kk + ll + mm + nn);
75 nn = $noinline$computeFloat();
  /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...]

Completed in 1269 milliseconds

1 2 3 4 5 6 7