| /prebuilts/go/darwin-x86/src/cmd/compile/internal/arm64/ |
| ggen.go | 274 var n2 gc.Node
275 gc.Cgenr(nr, &n2, nil)
280 gins(optoas(gc.OMUL, t), &n2, &n1)
288 gins(optoas(gc.OMUL, t), &n2, &n1)
296 gins(arm64.ASMULH, &n2, &n1)
298 gins(arm64.AUMULH, &n2, &n1)
307 gc.Regfree(&n2)
366 var n2 gc.Node
367 gc.Regalloc(&n2, nl.Type, res)
370 gc.Cgen(nl, &n2)
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/arm64/ |
| ggen.go | 274 var n2 gc.Node
275 gc.Cgenr(nr, &n2, nil)
280 gins(optoas(gc.OMUL, t), &n2, &n1)
288 gins(optoas(gc.OMUL, t), &n2, &n1)
296 gins(arm64.ASMULH, &n2, &n1)
298 gins(arm64.AUMULH, &n2, &n1)
307 gc.Regfree(&n2)
366 var n2 gc.Node
367 gc.Regalloc(&n2, nl.Type, res)
370 gc.Cgen(nl, &n2)
[all...] |
| /external/icu/icu4c/source/test/cintltst/ |
| cnormtst.c | 1480 const UNormalizer2 *n2=unorm2_getInstance(NULL, "nfc", UNORM2_COMPOSE_CONTIGUOUS, &errorCode); local
1523 const UNormalizer2 *n2=unorm2_getNFKCInstance(&errorCode); local
1590 const UNormalizer2 *n2=unorm2_getNFCInstance(&errorCode); local
1629 const UNormalizer2 *n2=unorm2_getNFCInstance(&errorCode); local
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/modulegraph/modulegraph_tests/ |
| test_modulegraph.py | 385 n2 = modulegraph.Node("n2")
387 self.assertTrue(n1 < n2)
388 self.assertFalse(n2 < n1)
390 self.assertFalse(n1 == n2)
392 self.assertTrue(n1 != n2)
394 self.assertTrue(n2 > n1)
395 self.assertFalse(n1 > n2)
397 self.assertTrue(n2 >= n1)
402 n2 = modulegraph.Node('n2'
[all...] |
| /bionic/tests/ |
| search_test.cpp | 82 node n2("a");
87 ASSERT_EQ(nullptr, tfind(&n2, &root, node_cmp));
96 ASSERT_EQ(nullptr, tfind(&n2, &root, node_cmp));
100 ASSERT_NE(nullptr, tsearch(&n2, &root, node_cmp));
|
| /cts/apps/CameraITS/tests/scene1/ |
| test_capture_result.py | 90 def is_close_float(n1, n2):
91 return abs(n1 - n2) < 0.05
93 def is_close_rational(n1, n2):
95 its.objects.rational_to_float(n2))
|
| /external/bzip2/ |
| huffman.c | 72 Int32 nNodes, nHeap, n1, n2, i, j, k; local
102 n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
104 parent[n1] = parent[n2] = nNodes;
105 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
|
| /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
| p3-0x.cpp | 44 int n2 = f(0); member in namespace:std_example
|
| /external/clang/test/Modules/ |
| macros2.c | 78 int n2 = TOP_OTHER_REDEF2; // ok variable
|
| /external/guice/extensions/mini/test/com/google/inject/mini/ |
| MiniGuiceTest.java | 180 assertSame(m.f1, m.n2.f1);
181 assertSame(m.f1, m.n2.f2);
183 assertSame(m.f1, m.n2.fProvider.get());
188 @Inject N n2; field in class:MiniGuiceTest.M
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_one.pass.cpp | 35 for (int n2 = f; n2 < f+1; ++n2, ++i)
36 assert(*i == t2[n2]);
|
| splice_after_range.pass.cpp | 35 for (int n2 = f; n2 < l-1; ++n2, ++i)
36 assert(*i == t2[n2]);
|
| /external/ltrace/testsuite/ltrace.main/ |
| system_calls.exp | 99 set n2 [GetDefault $d2 $key 0]
100 set sum [expr $n1 - $n2]
|
| /external/v8/test/mjsunit/ |
| this-property-assignment.js | 40 var n2 = new Node();
41 assertEquals(3, n2.a);
|
| /libcore/luni/src/test/java/libcore/java/io/ |
| OldAndroidPipedStreamTest.java | 273 int n2; field in class:OldAndroidPipedStreamTest.Fibonacci
280 n2 = 0;
284 int ret = n1 + n2;
285 n2 = n1;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_one.pass.cpp | 34 for (int n2 = f; n2 < f+1; ++n2, ++i)
35 assert(*i == t2[n2]);
|
| splice_after_range.pass.cpp | 35 for (int n2 = f; n2 < l-1; ++n2, ++i)
36 assert(*i == t2[n2]);
|
| /toolchain/binutils/binutils-2.25/binutils/testsuite/binutils-all/ |
| ar.exp | 41 set n2 "abcdefghijklmnopqrstuvwxyz2"
43 set file2 tmpdir/$n2
60 remote_file host delete $n2
62 set status [catch "set f [open tmpdir/$n2 w]" errs]
64 verbose -log "open tmpdir/$n2 returned $errs"
104 remote_file build delete tmpdir/$n2
108 if ![string match "$n1*$n2" $got] {
137 remote_upload host $n2 tmpdir/$n2
139 set file2 tmpdir/$n2
[all...] |
| /external/icu/icu4c/source/common/ |
| normalizer2.cpp | 295 const Normalizer2 *n2=(const Normalizer2 *)norm2; local
296 const Normalizer2WithImpl *n2wi=dynamic_cast<const Normalizer2WithImpl *>(n2);
305 n2->normalize(srcString, destString, *pErrorCode);
332 const Normalizer2 *n2=(const Normalizer2 *)norm2; local
333 const Normalizer2WithImpl *n2wi=dynamic_cast<const Normalizer2WithImpl *>(n2);
358 n2->normalizeSecondAndAppend(firstString, secondString, *pErrorCode);
360 n2->append(firstString, secondString, *pErrorCode);
|
| /external/opencv/cvaux/src/ |
| cvhmmobs.cpp | 137 int n2 = dctSize.width, m2 = n2 / 2; local
249 if( n2 & 1 )
259 work_t t1 = buf[n2 - 1 - j];
289 if( n2 & 1 )
332 int n2 = dctSize.width, m2 = n2 / 2; local
446 if( n2 & 1 )
456 work_t t1 = buf[n2 - 1 - j];
486 if( n2 & 1
[all...] |
| /external/v8/src/compiler/ |
| ast-graph-builder.h | 179 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
180 Node* buffer[] = {n1, n2};
184 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
185 Node* buffer[] = {n1, n2, n3};
189 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
190 Node* buffer[] = {n1, n2, n3, n4};
194 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
196 Node* buffer[] = {n1, n2, n3, n4, n5};
200 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
202 Node* nodes[] = {n1, n2, n3, n4, n5, n6}
[all...] |
| /ndk/sources/cxx-stl/stlport/src/c_locale_dummy/ |
| c_locale_dummy.c | 272 const char* s1, size_t n1, const char* s2, size_t n2) {
275 while (n1 > 0 || n2 > 0) {
277 size_t bufsize2 = n2 < 63 ? n2 : 63;
284 s2 += bufsize2; n2 -= bufsize2;
292 const wchar_t* s1, size_t n1, const wchar_t* s2, size_t n2) {
295 while (n1 > 0 || n2 > 0) {
297 size_t bufsize2 = n2 < 63 ? n2 : 63;
304 s2 += bufsize2; n2 -= bufsize2
[all...] |
| /ndk/sources/cxx-stl/stlport/src/c_locale_glibc/ |
| c_locale_glibc2.c | 364 const char *s2, size_t n2) {
367 while (n1 > 0 || n2 > 0) {
369 size_t bufsize2 = n2 < 63 ? n2 : 63;
376 s2 += bufsize2; n2 -= bufsize2;
384 const wchar_t *s2, size_t n2) {
387 while (n1 > 0 || n2 > 0) {
389 size_t bufsize2 = n2 < 63 ? n2 : 63;
396 s2 += bufsize2; n2 -= bufsize2
[all...] |
| /bionic/libc/upstream-openbsd/lib/libc/stdio/ |
| vfprintf.c | 273 int n, n2; /* handy integers (short term usage) */ local
372 n2 = (ep) - (p); \
373 if (n2 > (len)) \
374 n2 = (len); \
375 if (n2 > 0) \
376 PRINT((p), n2); \
377 PAD((len) - (n2 > 0 ? n2 : 0), (with)); \
426 n2 = 0; \
429 APPEND_DIGIT(n2, *cp);
1144 int n, n2; \/* handy integer (short term usage) *\/ local
[all...] |
| vfwprintf.c | 283 int n, n2, n3; /* handy integers (short term usage) */ local
352 * PAD uses `n' and 'n3', and PRINTANDPAD uses 'n', 'n2', and 'n3'.
370 n2 = (ep) - (p); \
371 if (n2 > (len)) \
372 n2 = (len); \
373 if (n2 > 0) \
374 PRINT((p), n2); \
375 PAD((len) - (n2 > 0 ? n2 : 0), (with)); \
418 n2 = 0;
1113 int n, n2; \/* handy integer (short term usage) *\/ local
[all...] |
