| /external/toybox/toys/posix/ |
| cmp.c | 33 int i, len1, len2, min_len, size = sizeof(toybuf)/2; local
47 len1 = readall(TT.fd, toybuf, 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);
74 if (len1 < 1) break;
|
| /libcore/luni/src/main/java/java/util/ |
| ComparableTimSort.java | 423 int len1 = runLen[i]; local
426 if (DEBUG) assert len1 > 0 && len2 > 0;
427 if (DEBUG) assert base1 + len1 == base2;
434 runLen[i] = len1 + len2;
445 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0);
448 len1 -= k;
449 if (len1 == 0)
456 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a,
462 // Merge remaining runs, using tmp array with min(len1, len2) elements
463 if (len1 <= len2
[all...] |
| TimSort.java | 457 int len1 = runLen[i]; local
460 if (DEBUG) assert len1 > 0 && len2 > 0;
461 if (DEBUG) assert base1 + len1 == base2;
468 runLen[i] = len1 + len2;
479 int k = gallopRight(a[base2], a, base1, len1, 0, c);
482 len1 -= k;
483 if (len1 == 0)
490 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c);
495 // Merge remaining runs, using tmp array with min(len1, len2) elements
496 if (len1 <= len2
885 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...] |
| /frameworks/base/keystore/java/android/security/keystore/ |
| ArrayUtils.java | 44 public static byte[] concat(byte[] arr1, int offset1, int len1, byte[] arr2, int offset2,
46 if (len1 == 0) {
49 return subarray(arr1, offset1, len1);
51 byte[] result = new byte[len1 + len2];
52 System.arraycopy(arr1, offset1, result, 0, len1);
53 System.arraycopy(arr2, offset2, result, len1, len2);
|
| /external/v8/test/cctest/ |
| test-liveedit.cc | 66 len1(len1_param), len2(len2_param), next(NULL) {}
69 int len1; 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);
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 | 76 uptr len1 = internal_strlen(str1); local
84 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/valgrind/none/tests/s390x/ |
| clcl.c | 11 uint32_t len1; member in struct:__anon21023
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:__anon21036
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:__anon21032
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:__anon21033
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:__anon21035
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);
|
| cu21.c | 15 uint64_t len1; member in struct:__anon21030
90 regs.len1 = dest_len;
108 if (dst_len - result.len1 == 0)
111 for (i = 0; i < dst_len - result.len1; i++) {
119 printf(" dst len: %"PRId64"\n", result.len1);
|
| cu21_1.c | 15 uint64_t len1; member in struct:__anon21031
90 regs.len1 = dest_len;
108 if (dst_len - result.len1 == 0)
111 for (i = 0; i < dst_len - result.len1; i++) {
119 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/valgrind/VEX/priv/ |
| main_util.c | 342 Int fwidth, nout, len1, len3; local
401 len1 = len3 = 0;
403 if (fwidth > len2) { len1 = ljustify ? 0 : fwidth-len2;
405 PAD(len1); PUTSTR(str); PAD(len3);
413 len1 = len3 = 0;
415 if (fwidth > len2) { len1 = ljustify ? 0 : fwidth-len2;
417 PAD(len1); PUTSTR(str); PAD(len3);
430 len1 = len3 = 0;
432 if (fwidth > len2) { len1 = ljustify ? 0 : fwidth-len2;
434 PAD(len1); PUTSTR(intbuf); PAD(len3)
[all...] |
| /system/bt/stack/sdp/ |
| sdp_utils.c | 667 BOOLEAN sdpu_compare_uuid_arrays (UINT8 *p_uuid1, UINT32 len1, UINT8 *p_uuid2, UINT16 len2)
672 if( ((len1 != 2) && (len1 != 4) && (len1 != 16)) ||
680 if (len1 == len2)
682 if (len1 == 2)
684 if (len1 == 4)
688 return (memcmp (p_uuid1, p_uuid2, (size_t)len1) == 0);
690 else if (len1 > len2)
692 /* If the len1 was 4-byte, (so len2 is 2-byte), compare on the fly *
866 UINT16 len1; local
895 UINT16 len1 = 0; local
[all...] |
| /external/linux-tools-perf/src/tools/perf/util/ |
| levenshtein.c | 44 int len1 = strlen(string1), len2 = strlen(string2); local
52 for (i = 0; i < len1; i++) {
|
| /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/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/toybox/toys/pending/ |
| tr.c | 27 int len1, len2;
38 int i = TT.len1, k = 0;
44 for (i = TT.len1, k = 0; i; i--, k++)
50 while (!(toys.optflags & FLAG_d) && set2 && TT.len1--) { //ignore set2 if -d present
242 if (memchr(*set, i, TT.len1)) continue;
246 TT.len1 = j;
257 set1 = expand_set(toys.optargs[0], &TT.len1);
|
| /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;
|
| /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) ) | \
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) ) | \
54 #define PERF_LOGCOMBINE3(flag, field1, len1, field2, len2, field3, len3) \
56 PERF_COMBINE3(field1, len1, field2, len2, field3, len3), \
57 (len1) + (len2) + (len3)
[all...] |
| /external/dnsmasq/src/ |
| netlink.c | 190 unsigned int len1 = h->nlmsg_len - NLMSG_LENGTH(sizeof(*ifa)); local
200 while (RTA_OK(rta, len1))
207 rta = RTA_NEXT(rta, len1);
218 while (RTA_OK(rta, len1))
223 rta = RTA_NEXT(rta, len1);
|
