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

1 2 3 4 5 6 7 8 91011>>

  /device/google/marlin/dataservices/datatop/src/
datatop_str.h 57 int dt_read_line(char *buf1, int len1, const char *buf2, int len2, int start);
59 int dt_parse_proc_dictionary(char *line1, int len1, char *line2, int len2,
64 int dt_parse_proc_same_line_key_and_val(char *line1, int len1, int l,
67 void dt_parse_for_prefix(char *line1, int len1, struct dt_procdict *dict);
69 int dt_single_line_parse(char *line1, int len1, struct dt_procdict *dict);
datatop_str.c 48 * @param len1 Size of destination buffer.
55 int dt_read_line(char *buf1, int len1, const char *buf2, int len2, int start)
59 if (len1 < 1 || len2 < 1 || start < 0 || start > len2)
68 while ((i < (len1-1)) && (j < len2)) {
86 * @param len1 Length of line1.
92 int dt_parse_proc_dictionary(char *line1, int len1, char *line2,
97 if (len1 < 1 || len2 < 1)
104 for (i = 0; i < len1 && k < DTOP_DICT_SIZE; i++) {
137 * @param len1 Length of line1.
140 void dt_parse_for_prefix(char *line1, int len1, struct dt_procdict *dict
    [all...]
  /external/toybox/toys/example/
demo_utf8towc.c 21 int len1, len2; local
36 len1 = mbrtowc(&wc1, str, len2, &mb);
37 if (len1<0) memset(&mb, 0, sizeof(mb));
39 if (len1 != len2 || wc1 != wc2)
40 printf("%x %d %x %d %x\n", u, len1, wc1, len2, wc2);
  /external/toybox/toys/posix/
cmp.c 33 int i, len1, len2, min_len, size = sizeof(toybuf)/2; local
49 len1 = readall(TT.fd, toybuf, size);
52 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/ojluni/src/main/java/java/util/
ComparableTimSort.java 440 int len1 = runLen[i]; local
443 assert len1 > 0 && len2 > 0;
444 assert base1 + len1 == base2;
451 runLen[i] = len1 + len2;
462 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0);
465 len1 -= k;
466 if (len1 == 0)
473 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a,
479 // Merge remaining runs, using tmp array with min(len1, len2) elements
480 if (len1 <= len2
    [all...]
TimSort.java 474 int len1 = runLen[i]; local
477 assert len1 > 0 && len2 > 0;
478 assert base1 + len1 == base2;
485 runLen[i] = len1 + len2;
496 int k = gallopRight(a[base2], a, base1, len1, 0, c);
499 len1 -= k;
500 if (len1 == 0)
507 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c);
512 // Merge remaining runs, using tmp array with min(len1, len2) elements
513 if (len1 <= len2
    [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/valgrind/none/tests/s390x/
clcl.c 11 uint32_t len1; member in struct:__anon43124
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:__anon43137
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:__anon43133
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:__anon43134
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);
  /cts/suite/audio_quality/test_description/processing/
calc_delay.py 41 len1 = len(data1)
42 if len1 > len0:
45 searchLen = len0 - len1
  /external/compiler-rt/lib/sanitizer_common/tests/
sanitizer_libc_test.cc 89 uptr len1 = internal_strlen(str1); local
98 EXPECT_TRUE(WriteToFile(fd, str1, len1, &bytes_written));
99 EXPECT_EQ(len1, bytes_written);
112 EXPECT_EQ(len1 + len2, fsize);
132 EXPECT_TRUE(ReadFromFile(fd, buf, len1, &bytes_read));
133 EXPECT_EQ(len1, bytes_read);
134 EXPECT_EQ(0, internal_memcmp(buf, str1, len1));
135 EXPECT_EQ((char)0, buf[len1 + 1]);
136 internal_memset(buf, 0, len1);
  /external/dtc/tests/
dtbs_equal_unordered.c 113 int len1, len2; local
117 data1 = fdt_getprop_by_offset(fdt1, offset, &name, &len1);
120 fdt_strerror(len1));
133 verbose_printf("len1=%d data1=", len1);
134 for (i = 0; i < len1; i++)
137 for (i = 0; i < len1; i++)
141 if (len1 != len2)
143 name, len1, len2);
144 else if (memcmp(data1, data2, len1) != 0
    [all...]
dtbs_equal_ordered.c 86 int len1, len2; local
131 len1 = fdt32_to_cpu(prop1->len);
133 if (len1 != len2)
135 "at (%d, %d)", len1, len2, offset1, offset2);
137 if (memcmp(prop1->data, prop2->data, len1) != 0)
  /system/bt/stack/sdp/
sdp_utils.cc 616 bool sdpu_compare_uuid_arrays(uint8_t* p_uuid1, uint32_t len1, uint8_t* p_uuid2,
621 if (((len1 != 2) && (len1 != 4) && (len1 != 16)) ||
628 if (len1 == len2) {
629 if (len1 == 2)
631 if (len1 == 4)
635 return (memcmp(p_uuid1, p_uuid2, (size_t)len1) == 0);
636 } else if (len1 > len2) {
637 /* If the len1 was 4-byte, (so len2 is 2-byte), compare on the fly *
749 uint16_t len1; local
777 uint16_t len1 = 0; local
    [all...]
  /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/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/v8/src/wasm/
function-body-decoder-impl.h 203 unsigned len1 = 0; local
205 index = decoder->checked_read_u32v(pc, 1 + len1, &len2, "function index");
206 length = len1 + len2;
230 unsigned len1 = 0; local
231 table_count = decoder->checked_read_u32v(pc, 1, &len1, "table count");
233 len1 > UINT_MAX - (table_count + 1) * sizeof(uint32_t)) {
236 table = pc + 1 + 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/extras/simpleperf/
UnixSocket.h 73 uint32_t len1 = data_.size() - write_head; local
74 memcpy(data_.data() + write_head, &message, len1);
75 memcpy(data_.data(), reinterpret_cast<const char*>(&message) + len1,
76 message.len - 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;
  /external/webrtc/webrtc/common_audio/signal_processing/
cross_correlation_neon.c 21 size_t len1 = length >> 3; local
26 for (i = len1; i > 0; i -= 1) {
  /external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/
BT4.java 135 int len1 = 0; local
151 int len = Math.min(len0, len1);
177 len1 = len;
193 int len1 = 0; local
206 int len = Math.min(len0, len1);
226 len1 = len;

Completed in 826 milliseconds

1 2 3 4 5 6 7 8 91011>>