| /external/valgrind/none/tests/s390x/ |
| clcl.stdout.exp | 2 cc: 0, len1: 0, len2: 0, addr1 diff: 0, addr2 diff: 0
3 cc: 0, len1: 0, len2: 0, addr1 diff: 0, addr2 diff: 0
5 cc: 1, len1: 1, len2: 1, addr1 diff: 0, addr2 diff: 0
6 cc: 0, len1: 0, len2: 0, addr1 diff: 1, addr2 diff: 1
7 cc: 2, len1: 1, len2: 1, addr1 diff: 0, addr2 diff: 0
8 cc: 1, len1: 1, len2: 1, addr1 diff: 0, addr2 diff: 0
9 cc: 0, len1: 0, len2: 0, addr1 diff: 1, addr2 diff: 1
10 cc: 2, len1: 1, len2: 1, addr1 diff: 0, addr2 diff: 0
12 cc: 0, len1: 0, len2: 0, addr1 diff: 0, addr2 diff: 1
13 cc: 1, len1: 0, len2: 1, addr1 diff: 0, addr2 diff:
[all...] |
| mvcl.stdout.exp | 2 cc: 0, len1: 0, len2: 0, addr1 diff: 0, addr2 diff: 0
3 cc: 0, len1: 0, len2: 0, addr1 diff: 0, addr2 diff: 0
4 cc: 1, len1: 0, len2: 5, addr1 diff: 0, addr2 diff: 0
5 cc: 1, len1: 0, len2: 5, addr1 diff: 0, addr2 diff: 0
6 cc: 1, len1: 0, len2: 10, addr1 diff: 0, addr2 diff: 0
7 cc: 1, len1: 0, len2: 10, addr1 diff: 0, addr2 diff: 0
9 cc: 2, len1: 0, len2: 0, addr1 diff: 1, addr2 diff: 0
11 cc: 2, len1: 0, len2: 0, addr1 diff: 10, addr2 diff: 0
14 cc: 0, len1: 0, len2: 0, addr1 diff: 1, addr2 diff: 1
16 cc: 1, len1: 0, len2: 10, addr1 diff: 0, addr2 diff:
[all...] |
| mvcl.c | 13 uint32_t len2; member in struct:__anon25861
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...] |
| clcl.c | 13 uint32_t len2; member in struct:__anon25848
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...] |
| /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);
|
| /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'));
|
| /external/v8/src/wasm/ |
| ast-decoder.h | 100 unsigned len2 = 0; local
102 depth = decoder->checked_read_u32v(pc, 1 + len1, &len2, "break depth");
103 length = len1 + len2;
115 unsigned len2 = 0; local
117 index = decoder->checked_read_u32v(pc, 1 + len1, &len2, "signature index");
118 length = len1 + len2;
130 unsigned len2 = 0; local
132 index = decoder->checked_read_u32v(pc, 1 + len1, &len2, "function index");
133 length = len1 + len2;
145 unsigned len2 = 0 local
160 unsigned len2 = 0; local
[all...] |
| /external/opencv3/3rdparty/zlib/ |
| 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...] |
| /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...] |
| /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;
|
| /libcore/ojluni/src/main/java/java/util/ |
| ComparableTimSort.java | 438 int len2 = runLen[i + 1]; local
439 assert len1 > 0 && len2 > 0; local
447 runLen[i] = len1 + len2;
469 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a,
470 base2, len2, len2 - 1);
471 assert len2 >= 0; local
472 if (len2 == 0)
475 // Merge remaining runs, using tmp array with min(len1, len2) elements
476 if (len1 <= len2)
[all...] |
| TimSort.java | 472 int len2 = runLen[i + 1]; local
473 assert len1 > 0 && len2 > 0; local
481 runLen[i] = len1 + len2;
503 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c);
504 assert len2 >= 0; local
505 if (len2 == 0)
508 // Merge remaining runs, using tmp array with min(len1, len2) elements
509 if (len1 <= 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/v8/test/cctest/ |
| test-liveedit.cc | 66 len1(len1_param), len2(len2_param), next(NULL) {}
70 int len2; member in class:__anon23946::DiffChunkStruct
82 void AddChunk(int pos1, int pos2, int len1, int len2) {
83 current_chunk_ = new(zone_) DiffChunkStruct(pos1, pos2, len1, len2);
107 int len2 = StrLength(s2); local
125 CHECK(pos2 + j < len2);
128 diff_parameter += chunk->len1 + chunk->len2;
130 pos2 = diff_pos2 + chunk->len2;
135 CHECK_EQ(similar_part_length, len2 - pos2);
136 USE(len2);
[all...] |
| /external/pdfium/third_party/zlib_v128/ |
| 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...] |
| /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);
|
| /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/libgdx/gdx/src/com/badlogic/gdx/utils/ |
| ComparableTimSort.java | 380 int len2 = runLen[i + 1];
local
381 if (DEBUG) assert len1 > 0 && len2 > 0;
local
388 runLen[i] = len1 + len2;
409 len2 = gallopLeft((Comparable<Object>)a[base1 + len1 - 1], a, base2, len2, len2 - 1);
410 if (DEBUG) assert len2 >= 0;
local
411 if (len2 == 0) return;
413 // Merge remaining runs, using tmp array with min(len1, len2) elements
414 if (len1 <= len2)
[all...] |
| TimSort.java | 412 int len2 = runLen[i + 1];
local
413 if (DEBUG) assert len1 > 0 && len2 > 0;
local
420 runLen[i] = len1 + len2;
441 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c);
442 if (DEBUG) assert len2 >= 0;
local
443 if (len2 == 0) return;
445 // Merge remaining runs, using tmp array with min(len1, len2) elements
446 if (len1 <= len2)
[all...] |
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/ |
| Optimum.java | 64 void set3(int newPrice, int optCur, int back2, int len2, int back) {
66 optPrev = optCur + len2 + 1;
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| Vector2.java | 70 public static float len2 (float x, float y) {
method in class:Vector2
75 public float len2 () {
method in class:Vector2
240 float len2 = len2();
local
241 if (len2 > limit2) {
242 return scl((float)Math.sqrt(limit2 / len2));
249 final float len2 = len2();
local
250 if (len2 == 0f) return this;
252 if (len2 > max2) return scl((float)Math.sqrt(max2 / len2));
[all...] |
| /device/google/marlin/dataservices/datatop/src/ |
| datatop_str.c | 51 * @param len2 Size of the source 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)) {
88 * @param len2 Length of line2.
93 int len2, struct dt_procdict *dict)
97 if (len1 < 1 || len2 < 1)
114 for (i = 0; i < len2 && k < DTOP_DICT_SIZE; i++) {
|
| /external/skia/src/effects/ |
| SkDashPathEffect.cpp | 234 SkScalar len2 = length; local
236 SkASSERT(len2 >= clampedInitialDashLength);
242 len2 -= clampedInitialDashLength;
244 len2 -= fIntervals[1]; // also skip first space
245 if (len2 < 0) {
246 len2 = 0;
249 len2 -= clampedInitialDashLength; // skip initial partial empty
252 int numMidPoints = SkScalarFloorToInt(len2 / fIntervalLength);
254 len2 -= numMidPoints * fIntervalLength;
256 if (len2 > 0)
[all...] |
| /frameworks/rs/java/tests/Balls/src/com/example/android/rs/balls/ |
| ball_physics.rs | 61 float len2 = vec2.x + vec2.y;
63 if ((len2 < 10000.f) && (len2 > 0.001f)) {
64 float len = rsqrt(len2 + 4.f);
80 float len2 = max(2.f, vec2.x + vec2.y);
81 float2 pfv = (vec / len2) * touchPressure[i] * 500.f * gScale;
|
