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

1 2 3 4

  /external/linux-tools-perf/perf-3.12.0/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 76 int len2 = q[0]; local
77 total += 1 + len2;
78 q += 1 + len2;
107 int len2 = p[0]; local
109 memcpy( p2, p+1, len2 );
110 p2[len2] = 0;
111 p2 += len2 + 1;
112 p += len2 + 1;
  /external/chromium_org/third_party/leveldatabase/src/util/
status.cc 22 const uint32_t len2 = msg2.size(); local
23 const uint32_t size = len1 + (len2 ? (2 + len2) : 0);
28 if (len2) {
31 memcpy(result + 7 + len1, msg2.data(), len2);
  /external/chromium_org/v8/test/cctest/
test-liveedit.cc 66 len1(len1_param), len2(len2_param), next(NULL) {}
70 int len2; member in class:__anon22025::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...]
  /external/chromium_org/third_party/zlib/
adler32.c 12 local uLong adler32_combine_(uLong adler1, uLong adler2, z_off64_t len2);
131 local uLong adler32_combine_(adler1, adler2, len2)
134 z_off64_t len2;
141 rem = (unsigned)(len2 % BASE);
155 uLong ZEXPORT adler32_combine(adler1, adler2, len2)
158 z_off_t len2;
160 return adler32_combine_(adler1, adler2, len2);
163 uLong ZEXPORT adler32_combine64(adler1, adler2, len2)
166 z_off64_t len2;
168 return adler32_combine_(adler1, adler2, len2);
    [all...]
crc32.c 71 local uLong crc32_combine_(uLong crc1, uLong crc2, z_off64_t len2);
372 local uLong crc32_combine_(crc1, crc2, len2)
375 z_off64_t len2;
383 if (len2 <= 0)
400 /* apply len2 zeros to crc1 (first square will put the operator for one
403 /* apply zeros operator for this bit of len2 */
405 if (len2 & 1)
407 len2 >>= 1;
410 if (len2 == 0)
415 if (len2 & 1
    [all...]
  /external/chromium_org/third_party/opus/src/silk/
resampler_down2.c 43 opus_int32 k, len2 = silk_RSHIFT32( inLen, 1 ); local
50 for( k = 0; k < len2; k++ ) {
  /external/libopus/silk/
resampler_down2.c 43 opus_int32 k, len2 = silk_RSHIFT32( inLen, 1 ); local
50 for( k = 0; k < len2; k++ ) {
  /external/compiler-rt/lib/sanitizer_common/tests/
sanitizer_libc_test.cc 64 uptr len2 = internal_strlen(str2); local
84 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/chromium_org/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'));
  /external/chromium_org/net/base/
nss_memio.h 84 * writing the positions and lengths into |buf1|, |len1| and |buf2|, |len2|.
88 const char **buf2, unsigned int *len2);
  /external/chromium_org/net/tools/balsa/
string_piece_utils.h 32 size_t len2 = sp2.length(); local
33 bool sp1_shorter = len1 < len2;
34 size_t len = sp1_shorter ? len1 : len2;
  /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/chromium_org/third_party/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(SkScalarDiv(len2, fIntervalLength));
253 len2 -= numMidPoints * fIntervalLength;
255 if (len2 > 0)
    [all...]
  /external/chromium_org/sdch/open-vcdiff/src/zlib/
adler32.c 168 uLong ZEXPORT adler32_combine(adler1, adler2, len2)
171 z_off_t len2;
178 rem = (unsigned)(len2 % BASE);
  /external/chromium_org/third_party/ots/test/
idempotent.cc 41 const uint8_t *result2, const size_t len2);
69 const uint8_t *result2, const size_t len2) {
79 (write(fd2, result2, len2) < 0)) {
  /external/opencv/otherlibs/highgui/
grfmt_base.cpp 167 int i, len2 = GetExtensionLength( descr ); local
169 if( len2 == 0 )
172 if( len2 == len )
  /external/apache-xml/src/main/java/org/apache/xpath/objects/
XStringForFSB.java 476 int len2 = xstr.length(); local
477 int n = Math.min(len1, len2);
496 return len1 - len2;
522 int len2 = xstr.length(); local
523 int n = Math.min(len1, len2);
542 return len1 - len2;
  /dalvik/dexgen/src/com/android/dexgen/util/
TwoColumnOutput.java 63 int len2 = s2.length(); local
65 StringWriter sw = new StringWriter((len1 + len2) * 3);
  /dalvik/dx/src/com/android/dx/util/
TwoColumnOutput.java 63 int len2 = s2.length(); local
65 StringWriter sw = new StringWriter((len1 + len2) * 3);
  /external/dexmaker/src/dx/java/com/android/dx/util/
TwoColumnOutput.java 63 int len2 = s2.length(); local
65 StringWriter sw = new StringWriter((len1 + len2) * 3);
  /external/chromium_org/net/quic/crypto/
channel_id_chromium.cc 33 const size_t len2 = strlen(ChannelIDVerifier::kClientToServerStr) + 1; local
34 std::vector<uint8> data(len1 + len2 + signed_data.size());
36 memcpy(&data[len1], ChannelIDVerifier::kClientToServerStr, len2);
37 memcpy(&data[len1 + len2], signed_data.data(), signed_data.size());
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_libc.cc 195 uptr len2 = internal_strlen(needle); local
196 if (len1 < len2) return 0;
197 for (uptr pos = 0; pos <= len1 - len2; pos++) {
198 if (internal_memcmp(haystack + pos, needle, len2) == 0)
  /bionic/tests/
buffer_tests.cpp 340 for (size_t len2 = len+1; len2 < len+32; len2++) {
341 test_miscmp_func(buf1_align, buf2_align, len, len2);
342 test_miscmp_func(buf1_align, buf2_align, len2, len);

Completed in 1442 milliseconds

1 2 3 4