| /external/valgrind/auxprogs/ |
| valgrind-di-server.c | 475 static Frame* mk_Frame_le64_le64 ( const HChar* tag, ULong n1, ULong n2 )
483 write_ULong_le(&f->data[4 + 1*8], n2);
488 /*OUT*/ULong* n1, /*OUT*/ULong* n2,
497 *n2 = read_ULong_le(&fr->data[4 + 1*8]);
504 ULong n1, ULong n2, ULong n3, ULong n_data,
513 write_ULong_le(&f->data[4 + 1*8], n2);
[all...] |
| /prebuilts/go/darwin-x86/src/math/big/ |
| nat.go | 303 n2 := n >> 1 // n2 >= 1
304 x1, x0 := x[n2:], x[0:n2] // x = x1*b + y0
305 y1, y0 := y[n2:], y[0:n2] // y = y1*b + y0
322 xd := z[2*n : 2*n+n2]
329 yd := z[2*n+n2 : 3*n]
353 karatsubaAdd(z[n2:], r, n)
354 karatsubaAdd(z[n2:], r[n:], n
[all...] |
| /prebuilts/go/darwin-x86/src/runtime/ |
| runtime_test.go | 323 n2, ok := GoroutineProfile(make([]StackRecord, n1))
324 if n2 == n1 && ok {
327 t.Logf("GoroutineProfile(%d) = %d, %v, want %d, true", n1, n2, ok, n1)
|
| /prebuilts/go/darwin-x86/test/ |
| divmod.go | 49 // and y has at most n2 bits set in the low w2 and call f(x, y) for each.
50 func gen2(n1, w1, n2, w2 int, f func(uint64, uint64)) {
52 gen1(n2, w2, func(y uint64) {
|
| /prebuilts/go/linux-x86/src/math/big/ |
| nat.go | 303 n2 := n >> 1 // n2 >= 1
304 x1, x0 := x[n2:], x[0:n2] // x = x1*b + y0
305 y1, y0 := y[n2:], y[0:n2] // y = y1*b + y0
322 xd := z[2*n : 2*n+n2]
329 yd := z[2*n+n2 : 3*n]
353 karatsubaAdd(z[n2:], r, n)
354 karatsubaAdd(z[n2:], r[n:], n
[all...] |
| /prebuilts/go/linux-x86/src/runtime/ |
| runtime_test.go | 323 n2, ok := GoroutineProfile(make([]StackRecord, n1))
324 if n2 == n1 && ok {
327 t.Logf("GoroutineProfile(%d) = %d, %v, want %d, true", n1, n2, ok, n1)
|
| /prebuilts/go/linux-x86/test/ |
| divmod.go | 49 // and y has at most n2 bits set in the low w2 and call f(x, y) for each.
50 func gen2(n1, w1, n2, w2 int, f func(uint64, uint64)) {
52 gen1(n2, w2, func(y uint64) {
|
| /system/bt/stack/smp/ |
| smp_keys.cc | [all...] |
| aes.cc | 259 uint_8t p1 = x, p2 = BPOLY, n1 = hibit(x), n2 = 0x80, v1 = 1, v2 = 0; local
265 while (n2 >= n1) /* divide polynomial p2 by p1 */
267 n2 /= n1; /* shift smaller polynomial left */
268 p2 ^= (p1 * n2) & 0xff; /* and remove from larger one */
269 v2 ^= (v1 * n2); /* shift accumulated value and */
270 n2 = hibit(p2); /* add into result */
275 if (n2) /* repeat with values swapped */
276 while (n1 >= n2) {
277 n1 /= n2;
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_minidom.py | [all...] |
| /external/python/cpython2/Lib/test/ |
| test_minidom.py | [all...] |
| test_weakset.py | 422 n2 = len(s)
425 self.assertEqual(n2, 0)
445 n2 = len(s)
448 self.assertGreaterEqual(n2, 0)
449 self.assertLessEqual(n2, n1)
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_minidom.py | [all...] |
| test_weakset.py | 416 n2 = len(s)
419 self.assertEqual(n2, 0)
439 n2 = len(s)
442 self.assertGreaterEqual(n2, 0)
443 self.assertLessEqual(n2, n1)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_minidom.py | [all...] |
| test_weakset.py | 416 n2 = len(s)
419 self.assertEqual(n2, 0)
439 n2 = len(s)
442 self.assertGreaterEqual(n2, 0)
443 self.assertLessEqual(n2, n1)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_minidom.py | [all...] |
| test_weakset.py | 416 n2 = len(s)
419 self.assertEqual(n2, 0)
439 n2 = len(s)
442 self.assertGreaterEqual(n2, 0)
443 self.assertLessEqual(n2, n1)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_minidom.py | [all...] |
| test_weakset.py | 416 n2 = len(s)
419 self.assertEqual(n2, 0)
439 n2 = len(s)
442 self.assertGreaterEqual(n2, 0)
443 self.assertLessEqual(n2, n1)
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/ |
| datetimemodule.c | 3344 naivety n1, n2; local
4126 naivety n1, n2; local
4273 naivety n1, n2; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
| datetimemodule.c | 3344 naivety n1, n2; local
4126 naivety n1, n2; local
4273 naivety n1, n2; local
[all...] |
| /external/libcxx/test/std/experimental/string.view/string.view.ops/ |
| compare.size_size_sv_pointer_size.pass.cpp | 13 // const charT* s, size_type n2) const;
25 const CharT *s2, size_t n2,
30 sv1.compare(pos1, n1, s2, n2);
39 assert(sign(sv1.compare(pos1, n1, s2, n2)) == sign(expected));
47 const CharT *s2, size_t n2,
51 test1 (sv1, pos1, n1, s2, n2, expected);
[all...] |
| /external/libcxx/test/std/strings/string.view/string.view.ops/ |
| compare.size_size_sv_pointer_size.pass.cpp | 13 // const charT* s, size_type n2) const;
25 const CharT *s2, size_t n2, int expected ) {
28 assert(sign(sv1.compare(pos1, n1, s2, n2)) == sign(expected));
31 assert(sign(sv1.compare(pos1, n1, s2, n2)) == sign(expected));
43 const CharT *s2, size_t n2,
47 test1 (sv1, pos1, n1, s2, n2, expected);
[all...] |
| /external/python/cpython2/Modules/ |
| datetimemodule.c | 3344 naivety n1, n2; local
4126 naivety n1, n2; local
4273 naivety n1, n2; local
[all...] |
