HomeSort by relevance Sort by last modified time
    Searched refs:len2 (Results 1 - 25 of 289) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/linux-tools-perf/src/tools/perf/util/
levenshtein.c 44 int len1 = strlen(string1), len2 = strlen(string2); local
45 int *row0 = malloc(sizeof(int) * (len2 + 1));
46 int *row1 = malloc(sizeof(int) * (len2 + 1));
47 int *row2 = malloc(sizeof(int) * (len2 + 1));
50 for (j = 0; j <= len2; j++)
56 for (j = 0; j < len2; j++) {
78 i = row1[len2];
  /bionic/libc/dns/net/
getservent.c 77 int len2 = q[0]; local
78 total += 1 + len2;
79 q += 1 + len2;
108 int len2 = p[0]; local
110 memcpy( p2, p+1, len2 );
111 p2[len2] = 0;
112 p2 += len2 + 1;
113 p += len2 + 1;
  /hardware/libhardware/include/hardware/
qemud.h 46 int len2; local
48 len2 = write(fd, buff, len);
49 } while (len2 < 0 && errno == EINTR);
50 return len2;
56 int len2; local
58 len2 = read(fd, buff, len);
59 } while (len2 < 0 && errno == EINTR);
60 return len2;
  /external/toybox/toys/posix/
cmp.c 33 int i, len1, len2, min_len, size = sizeof(toybuf)/2; local
48 len2 = readall(fd, buf2, size);
50 min_len = len1 < len2 ? len1 : len2;
68 if (len1 != len2) {
70 fprintf(stderr, "cmp: EOF on %s\n", len1 < len2 ? TT.name : name);
  /libcore/luni/src/main/java/java/util/
ComparableTimSort.java 425 int len2 = runLen[i + 1]; local
426 if (DEBUG) assert len1 > 0 && len2 > 0; local
434 runLen[i] = len1 + len2;
456 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a,
457 base2, len2, len2 - 1);
458 if (DEBUG) assert len2 >= 0; local
459 if (len2 == 0)
462 // Merge remaining runs, using tmp array with min(len1, len2) elements
463 if (len1 <= len2)
    [all...]
TimSort.java 459 int len2 = runLen[i + 1]; local
460 if (DEBUG) assert len1 > 0 && len2 > 0; local
468 runLen[i] = len1 + len2;
490 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c);
491 if (DEBUG) assert len2 >= 0; local
492 if (len2 == 0)
495 // Merge remaining runs, using tmp array with min(len1, len2) elements
496 if (len1 <= len2)
819 if (DEBUG) assert len1 > 0 && len2 > 1; local
841 if (DEBUG) assert len1 > 0 && len2 > 1; local
886 if (DEBUG) assert len2 > 0; typedefs
    [all...]
  /external/zlib/src/
adler32.c 12 local uLong adler32_combine_ OF((uLong adler1, uLong adler2, z_off64_t len2));
136 local uLong adler32_combine_(adler1, adler2, len2)
139 z_off64_t len2;
146 if (len2 < 0)
150 MOD63(len2); /* assumes len2 >= 0 */
151 rem = (unsigned)len2;
165 uLong ZEXPORT adler32_combine(adler1, adler2, len2)
168 z_off_t len2;
170 return adler32_combine_(adler1, adler2, len2);
    [all...]
crc32.c 53 local uLong crc32_combine_ OF((uLong crc1, uLong crc2, z_off64_t len2));
355 local uLong crc32_combine_(crc1, crc2, len2)
358 z_off64_t len2;
366 if (len2 <= 0)
383 /* apply len2 zeros to crc1 (first square will put the operator for one
386 /* apply zeros operator for this bit of len2 */
388 if (len2 & 1)
390 len2 >>= 1;
393 if (len2 == 0)
398 if (len2 & 1
    [all...]
  /external/v8/test/cctest/
test-liveedit.cc 66 len1(len1_param), len2(len2_param), next(NULL) {}
70 int len2; member in class:__anon19258::DiffChunkStruct
82 void AddChunk(int pos1, int pos2, int len1, int len2) {
83 current_chunk_ = new(zone_) DiffChunkStruct(pos1, pos2, len1, len2);
106 int len2 = StrLength(s2); local
124 DCHECK(pos2 + j < len2);
127 diff_parameter += chunk->len1 + chunk->len2;
129 pos2 = diff_pos2 + chunk->len2;
134 DCHECK_EQ(similar_part_length, len2 - pos2);
135 USE(len2);
    [all...]
  /frameworks/base/keystore/java/android/security/keystore/
ArrayUtils.java 45 int len2) {
47 return subarray(arr2, offset2, len2);
48 } else if (len2 == 0) {
51 byte[] result = new byte[len1 + len2];
53 System.arraycopy(arr2, offset2, result, len1, len2);
  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
fx_zlib_adler32.c 12 local uLong adler32_combine_ OF((uLong adler1, uLong adler2, z_off64_t len2));
139 z_off64_t len2)
146 if (len2 < 0)
150 MOD63(len2); /* assumes len2 >= 0 */
151 rem = (unsigned)len2;
168 z_off_t len2)
170 return adler32_combine_(adler1, adler2, len2);
176 z_off64_t len2)
178 return adler32_combine_(adler1, adler2, len2);
    [all...]
fx_zlib_crc32.c 53 local uLong crc32_combine_ OF((uLong crc1, uLong crc2, z_off64_t len2));
358 z_off64_t len2)
366 if (len2 <= 0)
383 /* apply len2 zeros to crc1 (first square will put the operator for one
386 /* apply zeros operator for this bit of len2 */
388 if (len2 & 1)
390 len2 >>= 1;
393 if (len2 == 0)
398 if (len2 & 1)
400 len2 >>= 1
    [all...]
  /external/libopus/silk/
resampler_down2.c 43 opus_int32 k, len2 = silk_RSHIFT32( inLen, 1 ); local
50 for( k = 0; k < len2; k++ ) {
  /hardware/libhardware_legacy/qemu/
qemu.c 57 int len2; local
59 len2 = write(fd, cmd, len);
60 } while (len2 < 0 && errno == EINTR);
61 return len2;
67 int len2; local
69 len2 = read(fd, buff, len);
70 } while (len2 < 0 && errno == EINTR);
71 return len2;
304 int fd, len2; local
315 len2 = qemu_fd_write(fd, cmd, len)
    [all...]
  /external/valgrind/VEX/priv/
main_util.c 343 SizeT len2; local
402 len2 = vex_strlen(str);
403 if (fwidth > len2) { len1 = ljustify ? 0 : fwidth-len2;
404 len3 = ljustify ? fwidth-len2 : 0; }
414 len2 = vex_strlen(str);
415 if (fwidth > len2) { len1 = ljustify ? 0 : fwidth-len2;
416 len3 = ljustify ? fwidth-len2 : 0; }
431 len2 = vex_strlen(intbuf)
    [all...]
  /external/valgrind/none/tests/s390x/
clcl.c 13 uint32_t len2; member in struct:__anon21023
63 result.len2 = regs.r2p1 & 0xFFFFFF;
74 void *addr2, uint32_t len2, uint32_t pad)
83 assert((len2 & 0xFFFFFF) == len2);
89 r2p1 = len2 | (pad << 24);
130 if (result1.len2 != result2.len2)
131 printf("FAIL: len2 result is different\n");
141 run_test(void *addr1, uint32_t len1, void *addr2, uint32_t len2, uint32_t pad
    [all...]
mvcl.c 13 uint32_t len2; member in struct:__anon21036
64 result.len2 = regs.r2p1 & 0xFFFFFF;
75 void *addr2, uint32_t len2, uint32_t pad)
84 assert((len2 & 0xFFFFFF) == len2);
93 r2p1 = len2 | (pad << 24);
135 if (result1.len2 != result2.len2)
136 printf("FAIL: len2 result is different\n");
165 printf("cc: %"PRIu32", len1: %"PRIu32", len2: %"PRIu3
    [all...]
cu24.c 17 uint64_t len2; member in struct:__anon21032
79 regs.len2 = source_len;
117 printf(" src len: %"PRId64"\n", result.len2);
  /external/compiler-rt/lib/sanitizer_common/tests/
sanitizer_libc_test.cc 78 uptr len2 = internal_strlen(str2); local
85 EXPECT_EQ(len2, internal_write(fd, str2, len2));
91 EXPECT_EQ(len1 + len2, fsize);
115 EXPECT_EQ(len2, internal_read(fd, buf, len2));
116 EXPECT_EQ(0, internal_memcmp(buf, str2, len2));
  /external/mockito/cglib-and-asm/src/org/mockito/cglib/util/
SorterTemplate.java 99 private void merge(int lo, int pivot, int hi, int len1, int len2) {
100 if (len1 == 0 || len2 == 0) {
103 if (len1 + len2 == 2) {
111 if (len1 > len2) {
117 len22 = len2 / 2;
125 merge(new_mid, second_cut, hi, len1 - len11, len2 - len22);
  /external/v8/test/mjsunit/regress/
regress-666721.js 30 function len2(a) { return a.length; } function
43 assertEquals(0, len2({length:0}));
44 assertEquals(1, len2([1]));
45 assertEquals(2, len2({length:2}));
46 assertEquals(3, len2([1,2,3]));
47 assertEquals(4, len2('1234'));
  /hardware/ti/omap3/omx/system/src/openmax_il/perf/inc/
perf_log.h 41 #define PERF_COMBINE2(field1, len1, field2, len2) \
42 ( ( PERF_mask(field1, len1) << (len2) ) | \
43 PERF_mask(field2, len2) )
45 #define PERF_LOGCOMBINE2(flag, field1, len1, field2, len2) \
46 PERF_log_combine(flag, PERF_COMBINE2(field1, len1, field2, len2), \
47 (len1) + (len2))
49 #define PERF_COMBINE3(field1, len1, field2, len2, field3, len3) \
50 ((( ( PERF_mask(field1, len1) << (len2) ) | \
51 PERF_mask(field2, len2) ) << (len3) ) | \
54 #define PERF_LOGCOMBINE3(flag, field1, len1, field2, len2, field3, len3)
    [all...]
  /dalvik/dx/src/com/android/dx/command/dump/
BaseDumper.java 279 int len2 = s2.length(); local
280 StringWriter sw = new StringWriter(len2 * 2);
284 if ((len2 == 0) || (s2.charAt(len2 - 1) != '\n')) {
  /external/skia/src/effects/
SkDashPathEffect.cpp 233 SkScalar len2 = length; local
235 SkASSERT(len2 >= clampedInitialDashLength);
241 len2 -= clampedInitialDashLength;
243 len2 -= fIntervals[1]; // also skip first space
244 if (len2 < 0) {
245 len2 = 0;
248 len2 -= clampedInitialDashLength; // skip initial partial empty
251 int numMidPoints = SkScalarFloorToInt(len2 / fIntervalLength);
253 len2 -= numMidPoints * fIntervalLength;
255 if (len2 > 0)
    [all...]
  /external/opencv/otherlibs/highgui/
grfmt_base.cpp 167 int i, len2 = GetExtensionLength( descr ); local
169 if( len2 == 0 )
172 if( len2 == len )

Completed in 1021 milliseconds

1 2 3 4 5 6 7 8 91011>>