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

1 2 3 4 5 6 7 8 91011>>

  /external/strace/tests/
rt_sigaction.awk 31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
33 n1[1][3] = "SA_RESTORER\\|SA_RESTART"
35 n1[1][4] = ", sa_restorer=0x[0-9a-f]+"
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
40 n1[2][3] = "SA_RESTORER\\|SA_SIGINFO"
42 n1[2][4] = ", sa_restorer=0x[0-9a-f]+"
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]
    [all...]
  /external/strace/tests-m32/
rt_sigaction.awk 31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
33 n1[1][3] = "SA_RESTORER\\|SA_RESTART"
35 n1[1][4] = ", sa_restorer=0x[0-9a-f]+"
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
40 n1[2][3] = "SA_RESTORER\\|SA_SIGINFO"
42 n1[2][4] = ", sa_restorer=0x[0-9a-f]+"
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]
    [all...]
  /external/strace/tests-mx32/
rt_sigaction.awk 31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
33 n1[1][3] = "SA_RESTORER\\|SA_RESTART"
35 n1[1][4] = ", sa_restorer=0x[0-9a-f]+"
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
40 n1[2][3] = "SA_RESTORER\\|SA_SIGINFO"
42 n1[2][4] = ", sa_restorer=0x[0-9a-f]+"
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]
    [all...]
  /tools/tradefederation/core/tests/test-apps/NativeTestSampleApp/src/
TradeFedNativeTestSampleLib.cpp 36 unsigned long n1 = 1; local
46 unsigned long current = n1 + n2;
47 n2 = n1;
48 n1 = current;
50 return n1;
  /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/visitor/
EqualsVisitor.java 110 public static boolean equals(final Node n1, final Node n2) {
111 return SINGLETON.nodeEquals(n1, n2);
122 private boolean commonNodeEquality(Node n1, Node n2) {
123 if (!nodeEquals(n1.getComment(), n2.getComment())) {
126 return nodesEquals(n1.getOrphanComments(), n2.getOrphanComments());
146 private <T extends Node> boolean nodeEquals(final T n1, final T n2) {
147 if (n1 == n2) {
150 if (n1 == null || n2 == null) {
153 if (n1.getClass() != n2.getClass()) {
156 if (!commonNodeEquality(n1, n2))
    [all...]
  /external/honggfuzz/examples/badcode/
run-honggfuzz-on-badcode1.sh 2 ../../honggfuzz -n1 -u -f inputfiles -- targets/badcode1 ___FILE___
run-honggfuzz-on-badcode1-with-externalfuzzer.sh 2 ../../honggfuzz -n1 -u -f inputfiles -c ../externalfuzzers/lowBytesIncrease.py -- targets/badcode1 ___FILE___
  /frameworks/ml/nn/runtime/test/
TestMain.cpp 35 int n1 = RUN_ALL_TESTS(); local
39 return n1;
44 return n1 | n2;
  /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ast/visitor/
EqualsVisitor.java 82 public static boolean equals(final Node n1, final Node n2) {
83 return SINGLETON.nodeEquals(n1, n2);
94 private boolean commonNodeEquality(Node n1, Node n2) {
95 if (!nodeEquals(n1.getComment(), n2.getComment())) {
98 if (!nodesEquals(n1.getOrphanComments(), n2.getOrphanComments())){
124 private <T extends Node> boolean nodeEquals(final T n1, final T n2) {
125 if (n1 == n2) {
128 if (n1 == null) {
136 if (n1.getClass() != n2.getClass()) {
139 if (!commonNodeEquality(n1, n2))
    [all...]
  /external/libcxx/test/std/localization/locales/locale/locale.operators/
eq.pass.cpp 25 std::locale n1(LOCALE_en_US_UTF_8);
27 std::locale noname1 = n1.combine<std::ctype<char> >(cloc);
29 std::locale noname2 = n1.combine<std::ctype<char> >(cloc);
33 assert(cloc != n1);
41 assert(copy != n1);
47 assert(n1 != cloc);
48 assert(n1 != copy);
49 assert(n1 == n1);
50 assert(n1 == n2)
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/localization/locales/locale/locale.operators/
eq.pass.cpp 25 std::locale n1(LOCALE_en_US_UTF_8);
27 std::locale noname1 = n1.combine<std::ctype<char> >(cloc);
29 std::locale noname2 = n1.combine<std::ctype<char> >(cloc);
33 assert(cloc != n1);
41 assert(copy != n1);
47 assert(n1 != cloc);
48 assert(n1 != copy);
49 assert(n1 == n1);
50 assert(n1 == n2)
    [all...]
  /cts/apps/CtsVerifier/src/com/android/cts/verifier/audio/wavelib/
DspFftServer.java 53 int ii, jj, kk, n1, n2, aa; local
60 n1 = n2;
61 while (jj >= n1) {
62 jj = jj - n1;
63 n1 = n1 / 2;
65 jj = jj + n1;
78 n1 = 0;
81 n1 = n2;
85 for (jj = 0; jj < n1; jj++)
    [all...]
  /external/drrickorang/LoopbackApp/app/src/main/java/org/drrickorang/loopback/
FFT.java 63 int i, j, k, n1, n2, a; local
70 n1 = n2;
71 while (j >= n1) {
72 j = j - n1;
73 n1 = n1 / 2;
75 j = j + n1;
88 n1 = 0;
92 n1 = n2;
96 for (j = 0; j < n1; j++)
    [all...]
  /external/tensorflow/tensorflow/compiler/xla/
array2d.cc 22 int64 n1, int64 n2) {
23 auto array = MakeUnique<Array2D<float>>(n1, n2);
24 int64 count = n1 * n2;
26 auto set = [&array, n1, n2](int64 index, float value) {
array3d_test.cc 28 EXPECT_EQ(uninit.n1(), 2);
37 EXPECT_EQ(fullof7.n1(), 2);
41 for (int64 n1 = 0; n1 < fullof7.n1(); ++n1) {
44 EXPECT_EQ(fullof7(n1, n2, n3), 7);
55 EXPECT_EQ(arr.n1(), 3);
78 EXPECT_EQ(arr.n1(), 3);
97 for (int64 n1 = 0; n1 < fullof7.n1(); ++n1)
    [all...]
  /external/clang/test/CodeGen/
2002-09-18-UnionProblem.c 13 short __udivmodhi4 (char n1, char bm) {
18 rr.s.high = n1;
  /external/testng/src/test/java/test/tmp/
Test_TestListenerAppender.java 15 public void verifyData1(String n1, Integer n2) {
16 System.out.println(n1 + " " + n2);
  /external/tensorflow/tensorflow/core/profiler/internal/
tfprof_show_multi.h 84 [&opts](const T* n1, const T* n2) {
85 if (n1->name() == kTFProfRoot) return true;
87 bool name_cmp = n1->name() < n2->name();
91 return n1->proto().total_requested_bytes() >
94 return n1->proto().total_peak_bytes() >
97 return n1->proto().total_residual_bytes() >
100 return n1->proto().total_output_bytes() >
103 return n1->proto().total_exec_micros() >
106 return n1->proto().total_accelerator_exec_micros() >
109 return n1->proto().total_cpu_exec_micros()
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/tests/
test_pytree.py 98 n1 = pytree.Node(1000, [l1, l2])
99 self.assertEqual(n1.type, 1000)
100 self.assertEqual(n1.children, [l1, l2])
105 n1 = pytree.Node(1000, [l1, l2])
106 self.assertEqual(repr(n1),
112 n1 = pytree.Node(1000, [l1, l2])
113 self.assertEqual(str(n1), "foo bar")
118 n1 = pytree.Node(1000, [l1])
119 self.assertEqual(n1.prefix, "")
120 n1.prefix = " "
    [all...]
  /external/python/cpython2/Lib/lib2to3/tests/
test_pytree.py 98 n1 = pytree.Node(1000, [l1, l2])
99 self.assertEqual(n1.type, 1000)
100 self.assertEqual(n1.children, [l1, l2])
105 n1 = pytree.Node(1000, [l1, l2])
106 self.assertEqual(repr(n1),
112 n1 = pytree.Node(1000, [l1, l2])
113 self.assertEqual(str(n1), "foo bar")
118 n1 = pytree.Node(1000, [l1])
119 self.assertEqual(n1.prefix, "")
120 n1.prefix = "
    [all...]
  /external/python/cpython3/Lib/lib2to3/tests/
test_pytree.py 76 n1 = pytree.Node(1000, [l1, l2])
77 self.assertEqual(n1.type, 1000)
78 self.assertEqual(n1.children, [l1, l2])
83 n1 = pytree.Node(1000, [l1, l2])
84 self.assertEqual(repr(n1),
90 n1 = pytree.Node(1000, [l1, l2])
91 self.assertEqual(str(n1), "foo bar")
96 n1 = pytree.Node(1000, [l1])
97 self.assertEqual(n1.prefix, "")
98 n1.prefix = "
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/
test_pytree.py 98 n1 = pytree.Node(1000, [l1, l2])
99 self.assertEqual(n1.type, 1000)
100 self.assertEqual(n1.children, [l1, l2])
105 n1 = pytree.Node(1000, [l1, l2])
106 self.assertEqual(repr(n1),
112 n1 = pytree.Node(1000, [l1, l2])
113 self.assertEqual(str(n1), "foo bar")
118 n1 = pytree.Node(1000, [l1])
119 self.assertEqual(n1.prefix, "")
120 n1.prefix = "
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/
test_pytree.py 98 n1 = pytree.Node(1000, [l1, l2])
99 self.assertEqual(n1.type, 1000)
100 self.assertEqual(n1.children, [l1, l2])
105 n1 = pytree.Node(1000, [l1, l2])
106 self.assertEqual(repr(n1),
112 n1 = pytree.Node(1000, [l1, l2])
113 self.assertEqual(str(n1), "foo bar")
118 n1 = pytree.Node(1000, [l1])
119 self.assertEqual(n1.prefix, "")
120 n1.prefix = "
    [all...]
  /external/clang/test/SemaCXX/
pr18284-crash-on-invalid.cpp 4 namespace n1 { namespace
13 } // namespace n1
  /libcore/jsr166-tests/src/test/java/jsr166/
SystemTest.java 40 long n1 = System.nanoTime(); local
46 long nanos = n2 - n1;
58 long n1 = System.nanoTime(); local
66 long nanos = n2 - n1;

Completed in 922 milliseconds

1 2 3 4 5 6 7 8 91011>>