/external/clang/test/CodeGen/ |
2002-07-30-VarArgsCallFailure.c | 3 int tcount; variable 7 test(Buf, "n%%%d", tcount++);
|
/external/harfbuzz_ng/src/hb-ucdn/ |
ucdn.c | 50 #define TCOUNT 28 51 #define NCOUNT (VCOUNT * TCOUNT) 118 if (si % TCOUNT) { 120 *a = SBASE + (si / TCOUNT) * TCOUNT; 121 *b = TBASE + (si % TCOUNT); 126 *b = VBASE + (si % NCOUNT) / TCOUNT; 133 if (b < VBASE || b >= (TBASE + TCOUNT)) 148 *code = SBASE + li * NCOUNT + vi * TCOUNT;
|
/external/libexif/libexif/canon/ |
exif-mnote-data-canon.c | 204 size_t i, tcount, o, datao; local 233 tcount = 0; 242 n->entries[tcount].tag = exif_get_short (buf + o, n->order); 243 n->entries[tcount].format = exif_get_short (buf + o + 2, n->order); 244 n->entries[tcount].components = exif_get_long (buf + o + 4, n->order); 245 n->entries[tcount].order = n->order; 248 "Loading entry 0x%x ('%s')...", n->entries[tcount].tag, 249 mnote_canon_tag_get_name (n->entries[tcount].tag)); 255 s = exif_format_get_size (n->entries[tcount].format) * 256 n->entries[tcount].components [all...] |
/external/libexif/libexif/fuji/ |
exif-mnote-data-fuji.c | 157 size_t i, tcount, o, datao; local 195 tcount = 0; 204 n->entries[tcount].tag = exif_get_short (buf + o, n->order); 205 n->entries[tcount].format = exif_get_short (buf + o + 2, n->order); 206 n->entries[tcount].components = exif_get_long (buf + o + 4, n->order); 207 n->entries[tcount].order = n->order; 210 "Loading entry 0x%x ('%s')...", n->entries[tcount].tag, 211 mnote_fuji_tag_get_name (n->entries[tcount].tag)); 217 s = exif_format_get_size (n->entries[tcount].format) * n->entries[tcount].components [all...] |
/external/libexif/libexif/pentax/ |
exif-mnote-data-pentax.c | 218 size_t i, tcount, o, datao, base = 0; local 277 tcount = 0; 286 n->entries[tcount].tag = exif_get_short (buf + o + 0, n->order) + base; 287 n->entries[tcount].format = exif_get_short (buf + o + 2, n->order); 288 n->entries[tcount].components = exif_get_long (buf + o + 4, n->order); 289 n->entries[tcount].order = n->order; 292 "Loading entry 0x%x ('%s')...", n->entries[tcount].tag, 293 mnote_pentax_tag_get_name (n->entries[tcount].tag)); 299 s = exif_format_get_size (n->entries[tcount].format) * 300 n->entries[tcount].components [all...] |
/external/valgrind/main/none/tests/ |
pth_cvsimple.c | 20 #define TCOUNT 10 33 for (i=0; i<TCOUNT; i++) {
|
/external/libexif/libexif/olympus/ |
exif-mnote-data-olympus.c | 242 size_t i, tcount, o, o2, datao = 6, base = 0; local 430 tcount = 0; 439 n->entries[tcount].tag = exif_get_short (buf + o, n->order) + base; 440 n->entries[tcount].format = exif_get_short (buf + o + 2, n->order); 441 n->entries[tcount].components = exif_get_long (buf + o + 4, n->order); 442 n->entries[tcount].order = n->order; 445 "Loading entry 0x%x ('%s')...", n->entries[tcount].tag, 446 mnote_olympus_tag_get_name (n->entries[tcount].tag)); 449 n->entries[tcount].tag, 450 n->entries[tcount].format [all...] |
/external/lldb/tools/lldb-perf/lib/ |
Xcode.cpp | 79 auto tCount = thread.GetNumFrames (); 81 printf("%s %d %d {%d}\n",thread.GetQueueName(),tCount,thread.GetStopReason(),eStopReasonBreakpoint); 82 for (int t = 0; t < tCount; t++)
|
/external/chromium_org/third_party/harfbuzz-ng/src/ |
hb-ot-shape-complex-hangul.cc | 103 #define TCount 28u 105 #define NCount (VCount * TCount) 110 #define isCombiningT(u) (hb_in_range ((u), TBase+1, TBase+TCount-1)) 271 hb_codepoint_t s = SBase + (l - LBase) * NCount + (v - VBase) * TCount + tindex; 311 unsigned int vindex = nindex / TCount; 312 unsigned int tindex = nindex % TCount;
|
/external/harfbuzz_ng/src/ |
hb-ot-shape-complex-hangul.cc | 94 #define TCount 28u 96 #define NCount (VCount * TCount) 101 #define isCombiningT(u) (hb_in_range ((u), TBase+1, TBase+TCount-1)) 262 hb_codepoint_t s = SBase + (l - LBase) * NCount + (v - VBase) * TCount + tindex; 302 unsigned int vindex = nindex / TCount; 303 unsigned int tindex = nindex % TCount;
|
/external/chromium_org/third_party/boringssl/src/crypto/asn1/ |
tasn_fre.c | 116 if ((i >= 0) && (i < it->tcount)) 160 tt = it->templates + it->tcount - 1; 161 for (i = 0; i < it->tcount; tt--, i++)
|
/external/openssl/crypto/asn1/ |
tasn_fre.c | 118 if ((i >= 0) && (i < it->tcount)) 162 tt = it->templates + it->tcount - 1; 163 for (i = 0; i < it->tcount; tt--, i++)
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
CubicIntersection.cpp | 126 int tCount = locals.used(); 127 for (int tIdx = 0; tIdx < tCount; ++tIdx) { 158 double c1Top = tIdx == tCount - 1 ? 1 : 185 if (tCount > 1) { 190 double c2Top = tIdx == tCount - 1 ? to2 : 254 double c1Top = tIdx == tCount - 1 ? 1 : 259 double c2Top = tIdx == tCount - 1 ? to2 :
|
QuadraticImplicit.cpp | 181 int tCount = tsFound.count(); 182 if (!tCount) { 186 if (tCount == 1) { 188 } else if (tCount > 1) { 206 if (tMin != tMax || tCount > 2) { 208 for (int index = 1; index < tCount; ++index) {
|
LineQuadraticIntersection.cpp | 337 int tCount = 0; 344 tRange[tCount++] = rootVals[index]; 346 return tCount;
|
LineCubicIntersection.cpp | 264 int tCount = 0; 271 tRange[tCount++] = rootVals[index];
|
/external/skia/experimental/Intersection/ |
CubicIntersection.cpp | 126 int tCount = locals.used(); 127 for (int tIdx = 0; tIdx < tCount; ++tIdx) { 158 double c1Top = tIdx == tCount - 1 ? 1 : 185 if (tCount > 1) { 190 double c2Top = tIdx == tCount - 1 ? to2 : 254 double c1Top = tIdx == tCount - 1 ? 1 : 259 double c2Top = tIdx == tCount - 1 ? to2 :
|
QuadraticImplicit.cpp | 181 int tCount = tsFound.count(); 182 if (!tCount) { 186 if (tCount == 1) { 188 } else if (tCount > 1) { 206 if (tMin != tMax || tCount > 2) { 208 for (int index = 1; index < tCount; ++index) {
|
LineQuadraticIntersection.cpp | 337 int tCount = 0; 344 tRange[tCount++] = rootVals[index]; 346 return tCount;
|
LineCubicIntersection.cpp | 264 int tCount = 0; 271 tRange[tCount++] = rootVals[index];
|
/external/chromium_org/third_party/skia/src/pathops/ |
SkDQuadIntersection.cpp | 175 int tCount = tsFound.count(); 176 if (tCount <= 0) { 180 if (tCount == 1) { 183 SkASSERT(tCount > 1); 200 if (tMin != tMax || tCount > 2) { 202 for (int index = 1; index < tCount; ++index) {
|
/external/skia/src/pathops/ |
SkDQuadIntersection.cpp | 175 int tCount = tsFound.count(); 176 if (tCount <= 0) { 180 if (tCount == 1) { 183 SkASSERT(tCount > 1); 200 if (tMin != tMax || tCount > 2) { 202 for (int index = 1; index < tCount; ++index) {
|
/external/chromium_org/third_party/opus/src/celt/ |
bands.c | 465 int tcount[3] = {0,0,0}; local 477 tcount[0]++; 479 tcount[1]++; 481 tcount[2]++; 486 hf_sum += 32*(tcount[1]+tcount[0])/N; 487 tmp = (2*tcount[2] >= N) + (2*tcount[1] >= N) + (2*tcount[0] >= N); [all...] |
/external/libopus/celt/ |
bands.c | 465 int tcount[3] = {0,0,0}; local 477 tcount[0]++; 479 tcount[1]++; 481 tcount[2]++; 486 hf_sum += 32*(tcount[1]+tcount[0])/N; 487 tmp = (2*tcount[2] >= N) + (2*tcount[1] >= N) + (2*tcount[0] >= N); [all...] |
/external/lldb/tools/debugserver/source/MacOSX/ |
MachThread.cpp | 218 mach_msg_type_number_t ncount, tcount; local 223 kern_return_t kret = ::mach_port_names (task, &names, &ncount, &types, &tcount); 245 ::vm_deallocate (my_task, (vm_address_t) types, tcount * sizeof (mach_port_type_t));
|