| /external/chromium_org/third_party/leveldatabase/src/util/ |
| status.cc | 21 const uint32_t len1 = msg.size(); local
23 const uint32_t size = len1 + (len2 ? (2 + len2) : 0);
27 memcpy(result + 5, msg.data(), len1);
29 result[5 + len1] = ':';
30 result[6 + len1] = ' ';
31 memcpy(result + 7 + len1, msg2.data(), len2);
|
| /libcore/luni/src/main/java/java/util/ |
| ComparableTimSort.java | 406 int len1 = runLen[i]; local
409 if (DEBUG) assert len1 > 0 && len2 > 0;
410 if (DEBUG) assert base1 + len1 == base2;
417 runLen[i] = len1 + len2;
428 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0);
431 len1 -= k;
432 if (len1 == 0)
439 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a,
445 // Merge remaining runs, using tmp array with min(len1, len2) elements
446 if (len1 <= len2
[all...] |
| TimSort.java | 439 int len1 = runLen[i]; local
442 if (DEBUG) assert len1 > 0 && len2 > 0;
443 if (DEBUG) assert base1 + len1 == base2;
450 runLen[i] = len1 + len2;
461 int k = gallopRight(a[base2], a, base1, len1, 0, c);
464 len1 -= k;
465 if (len1 == 0)
472 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c);
477 // Merge remaining runs, using tmp array with min(len1, len2) elements
478 if (len1 <= len2
867 if (DEBUG) assert len1 == 0; typedefs
[all...] |
| /external/libunwind/src/ |
| os-freebsd.c | 56 size_t len, len1; local
69 len1 = len * 4 / 3;
70 buf = get_mem(len1);
73 len = len1;
76 free_mem(buf, len1);
87 free_mem(buf, len1);
96 size_t len, len1; local
120 len1 = len * 4 / 3;
121 buf = get_mem(len1);
124 len = len1;
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-liveedit.cc | 66 len1(len1_param), len2(len2_param), next(NULL) {}
69 int len1; 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);
105 int len1 = StrLength(s1); local
123 DCHECK(pos1 + j < len1);
127 diff_parameter += chunk->len1 + chunk->len2;
128 pos1 = diff_pos1 + chunk->len1;
133 int similar_part_length = len1 - pos1;
137 DCHECK(pos1 + j < len1);
[all...] |
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_libc_test.cc | 62 uptr len1 = internal_strlen(str1); local
83 EXPECT_EQ(len1, internal_write(fd, str1, len1));
91 EXPECT_EQ(len1 + len2, fsize);
111 EXPECT_EQ(len1, internal_read(fd, buf, len1));
112 EXPECT_EQ(0, internal_memcmp(buf, str1, len1));
113 EXPECT_EQ((char)0, buf[len1 + 1]);
114 internal_memset(buf, 0, len1);
|
| /external/qemu/android/utils/ |
| dll.c | 22 int len1 = strlen(str1); local
24 char* result = malloc(len1+len2+1);
27 memcpy(result, str1, len1);
28 memcpy(result + len1, str2, len2);
29 result[len1+len2] = '\0';
|
| /external/valgrind/main/none/tests/s390x/ |
| clcl.c | 11 uint32_t len1; member in struct:__anon37805
61 result.len1 = regs.r1p1 & 0xFFFFFF;
73 clcl(void *addr1, uint32_t len1,
82 assert((len1 & 0xFFFFFF) == len1);
87 r1p1 = len1;
128 if (result1.len1 != result2.len1)
129 printf("FAIL: len1 result is different\n");
141 run_test(void *addr1, uint32_t len1, void *addr2, uint32_t len2, uint32_t pad
[all...] |
| mvcl.c | 11 uint32_t len1; member in struct:__anon37818
62 result.len1 = regs.r1p1 & 0xFFFFFF;
74 mvcl(void *addr1, uint32_t len1,
83 assert((len1 & 0xFFFFFF) == len1);
87 void *copy = memcpy(malloc(len1), addr1, len1);
91 r1p1 = len1;
110 memcpy(addr1, copy, len1);
133 if (result1.len1 != result2.len1
[all...] |
| cu24.c | 15 uint64_t len1; member in struct:__anon37814
77 regs.len1 = dest_len;
95 if (dst_len - result.len1 == 0)
98 uint64_t num_bytes = dst_len - result.len1;
113 printf(" dst len: %"PRId64"\n", result.len1);
|
| cu24_1.c | 15 uint64_t len1; member in struct:__anon37815
77 regs.len1 = dest_len;
95 if (dst_len - result.len1 == 0)
98 uint64_t num_bytes = dst_len - result.len1;
113 printf(" dst len: %"PRId64"\n", result.len1);
|
| cu42.c | 12 uint64_t len1; member in struct:__anon37817
80 regs.len1 = dest_len;
98 if (dst_len - result.len1 == 0)
101 assert((dst_len - result.len1) % 2 == 0);
102 for (i = 0; i < (dst_len - result.len1) / 2; ++i) {
110 printf(" dst len: %"PRId64"\n", result.len1);
|
| /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) {
112 len11 = len1 / 2;
125 merge(new_mid, second_cut, hi, len1 - len11, len2 - len22);
|
| /cts/suite/audio_quality/test_description/processing/ |
| calc_delay.py | 41 len1 = len(data1)
42 if len1 > len0:
45 searchLen = len0 - len1
|
| /external/chromium_org/net/base/ |
| nss_memio.h | 84 * writing the positions and lengths into |buf1|, |len1| and |buf2|, |len2|.
87 const char **buf1, unsigned int *len1,
|
| /external/valgrind/main/VEX/priv/ |
| main_util.c | 337 Int fwidth, nout, len1, len2, len3; local
391 len1 = len3 = 0;
393 if (fwidth > len2) { len1 = ljustify ? 0 : fwidth-len2;
395 PAD(len1); PUTSTR(str); PAD(len3);
403 len1 = len3 = 0;
405 if (fwidth > len2) { len1 = ljustify ? 0 : fwidth-len2;
407 PAD(len1); PUTSTR(str); PAD(len3);
419 len1 = len3 = 0;
421 if (fwidth > len2) { len1 = ljustify ? 0 : fwidth-len2;
423 PAD(len1); PUTSTR(intbuf); PAD(len3)
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| levenshtein.c | 44 int len1 = strlen(string1), len2 = strlen(string2); local
52 for (i = 0; i < len1; i++) {
|
| /external/qemu/include/qemu/ |
| range.h | 54 static inline int ranges_overlap(uint64_t first1, uint64_t len1,
57 uint64_t last1 = range_get_last(first1, len1);
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-666721.js | 29 function len1(a) { return a.length; } function
38 assertEquals(0, len1(''));
39 assertEquals(1, len1({length:1}));
40 assertEquals(2, len1('12'));
41 assertEquals(3, len1([1,2,3]));
|
| /external/opencv/otherlibs/highgui/ |
| grfmt_sunras.cpp | 228 int code = 0, len = 0, len1 = 0; local
238 tsrc[len1] = (uchar)code;
240 while( ++len1 < max_count );
242 tsrc += len1;
296 int code = 0, len = 0, len1; local
311 len1 = (int)(tsrc - src);
313 if( len1 > 0 )
316 FillColorRow8( data, src, len1, m_palette );
318 FillGrayRow8( data, src, len1, gray_palette );
319 data += len1*nch
[all...] |
| /external/chromium_org/net/tools/balsa/ |
| string_piece_utils.h | 31 size_t len1 = sp1.length(); local
33 bool sp1_shorter = len1 < len2;
34 size_t len = sp1_shorter ? len1 : len2;
|
| /external/bluetooth/bluedroid/stack/sdp/ |
| sdp_utils.c | 663 BOOLEAN sdpu_compare_uuid_arrays (UINT8 *p_uuid1, UINT32 len1, UINT8 *p_uuid2, UINT16 len2)
669 if (len1 == len2)
671 if (len1 == 2)
673 if (len1 == 4)
677 return (memcmp (p_uuid1, p_uuid2, (size_t)len1) == 0);
679 else if (len1 > len2)
681 /* If the len1 was 4-byte, (so len2 is 2-byte), compare on the fly */
682 if (len1 == 4)
689 /* Normalize UUIDs to 16-byte form, then compare. Len1 must be 16 */
703 /* len2 is greater than len1 */
855 UINT16 len1; local
884 UINT16 len1 = 0; local
[all...] |
| /external/qemu/audio/ |
| fmodaudio.c | 97 unsigned int len1 = 0, len2 = 0; local
105 &len1,
114 if ((len1 & hw->info.align) || (len2 & hw->info.align)) {
116 len1, len2, hw->info.align + 1);
120 if ((len1 + len2) - (hw->samples << hw->info.shift)) {
122 len1 + len2, hw->samples << hw->info.shift);
129 status = FSOUND_Sample_Unlock (fmd->fmod_sample, p1, p2, len1, len2);
233 unsigned int len1 = 0, len2 = 0; local
279 len1 = blen1 >> hw->info.shift;
281 ldebug ("%p %p %d %d %d %d\n", p1, p2, len1, len2, blen1, blen2)
457 unsigned int len1, len2; local
[all...] |
| dsoundaudio.c | 383 DWORD blen1, blen2, len1, len2; local
398 len1 = blen1 >> hw->info.shift;
403 p1, blen1, len1,
407 if (p1 && len1) {
408 audio_pcm_info_clear_buf (&hw->info, p1, len1);
576 DWORD len1, len2; local
672 len1 = blen1 >> hwshift;
674 decr = len1 + len2;
676 if (p1 && len1) {
677 dsound_write_sample (hw, p1, len1);
764 DWORD len1, len2; local
[all...] |
| /external/lzma/Java/SevenZip/Compression/LZ/ |
| BinTree.java | 184 int len0, len1;
local
185 len0 = len1 = kNumHashDirectBytes;
215 int len = Math.min(len0, len1);
238 len1 = len;
293 int len0, len1;
local
294 len0 = len1 = kNumHashDirectBytes;
311 int len = Math.min(len0, len1);
329 len1 = len;
|
