Searched refs:n2 (Results 1 - 25 of 267) sorted by relevance

1234567891011

/external/strace/tests/
H A Dsigaction.awk30 n1[1][1] = n2[1][1] = "SIG_IGN"
31 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
33 n2[1][3] = "SA_RESTART"
35 n2[1][4] = ""
37 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
38 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
40 n2[2][3] = "SA_SIGINFO"
42 n2[2][4] = ""
44 n1[3][1] = n2[3][1] = "SIG_DFL"
45 n1[3][2] = n2[
[all...]
/external/strace/tests-m32/
H A Dsigaction.awk30 n1[1][1] = n2[1][1] = "SIG_IGN"
31 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
33 n2[1][3] = "SA_RESTART"
35 n2[1][4] = ""
37 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
38 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
40 n2[2][3] = "SA_SIGINFO"
42 n2[2][4] = ""
44 n1[3][1] = n2[3][1] = "SIG_DFL"
45 n1[3][2] = n2[
[all...]
/external/strace/tests-mx32/
H A Dsigaction.awk30 n1[1][1] = n2[1][1] = "SIG_IGN"
31 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
33 n2[1][3] = "SA_RESTART"
35 n2[1][4] = ""
37 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
38 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
40 n2[2][3] = "SA_SIGINFO"
42 n2[2][4] = ""
44 n1[3][1] = n2[3][1] = "SIG_DFL"
45 n1[3][2] = n2[
[all...]
/external/libutf/
H A Dutfutf.c29 long f, n1, n2; local
37 n2 = strlen(s2);
39 if(strncmp(p, s2, n2) == 0)
/external/libcxx/test/std/localization/locales/locale/locale.operators/
H A Deq.pass.cpp26 std::locale n2(LOCALE_en_US_UTF_8);
34 assert(cloc != n2);
42 assert(copy != n2);
50 assert(n1 == n2);
55 assert(n2 != cloc);
56 assert(n2 != copy);
57 assert(n2 == n1);
58 assert(n2 == n2);
59 assert(n2 !
[all...]
/external/testng/src/test/java/test/tmp/
H A DTest_TestListenerAppender.java15 public void verifyData1(String n1, Integer n2) { argument
16 System.out.println(n1 + " " + n2);
/external/chromium-trace/catapult/telemetry/telemetry/util/
H A Dcolor_histogram.py28 n2 = sum_func(hist2)
29 if (n1 == 0 or n2 == 0) and default_color is None:
34 if n2 == 0:
36 n2 = 1
39 remainder = np.multiply(hist1, n2) - np.multiply(hist2, n1)
46 remainder += value1 * n2 - value2 * n1
51 return abs(float(total) / n1 / n2)
/external/clang/test/SemaCXX/
H A Dpr18284-crash-on-invalid.cpp15 namespace n2 { namespace
24 } // namespace n2
/external/selinux/libsepol/src/
H A Debitmap.c20 ebitmap_node_t *n1, *n2, *new, *prev; local
25 n2 = e2->node;
27 while (n1 || n2) {
34 if (n1 && n2 && n1->startbit == n2->startbit) {
36 new->map = n1->map | n2->map;
38 n2 = n2->next;
39 } else if (!n2 || (n1 && n1->startbit < n2
152 ebitmap_node_t *n1, *n2; local
202 ebitmap_node_t *n1, *n2; local
230 ebitmap_node_t *n2 = e2->node; local
[all...]
/external/syslinux/gpxe/src/drivers/net/
H A Dwlan_compat.h271 #define WLAN_LOG_ERROR2(x,n1,n2) printk(KERN_ERR "%s: " x , __FUNCTION__ , (n1), (n2));
272 #define WLAN_LOG_ERROR3(x,n1,n2,n3) printk(KERN_ERR "%s: " x , __FUNCTION__, (n1), (n2), (n3));
273 #define WLAN_LOG_ERROR4(x,n1,n2,n3,n4) printk(KERN_ERR "%s: " x , __FUNCTION__, (n1), (n2), (n3), (n4));
277 #define WLAN_LOG_WARNING2(x,n1,n2) printk(KERN_WARNING "%s: " x , __FUNCTION__, (n1), (n2));
278 #define WLAN_LOG_WARNING3(x,n1,n2,n3) printk(KERN_WARNING "%s: " x , __FUNCTION__, (n1), (n2), (n
[all...]
/external/dtc/tests/
H A Dpath-references.c69 int n1, n2; local
77 n2 = fdt_path_offset(fdt, "/node2");
78 if (n2 < 0)
79 FAIL("fdt_path_offset(/node2): %s", fdt_strerror(n2));
82 check_ref(fdt, n2, "/node1");
/external/webrtc/webrtc/system_wrappers/include/
H A Dntp_time.h55 inline bool operator==(const NtpTime& n1, const NtpTime& n2) { argument
56 return n1.seconds() == n2.seconds() && n1.fractions() == n2.fractions();
58 inline bool operator!=(const NtpTime& n1, const NtpTime& n2) { argument
59 return !(n1 == n2);
/external/boringssl/src/crypto/bn/
H A Dmul.c285 /* r is 2*n2 words in size,
286 * a and b are both n2 words in size.
287 * n2 must be a power of 2.
289 * t must be 2*n2 words in size
295 /* dnX may not be positive, but n2/2+dnX has to be */
296 static void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
298 int n = n2 / 2, c1, c2;
303 /* Only call bn_mul_comba 8 if n2 == 8 and the
306 if (n2 == 8 && dna == 0 && dnb == 0) {
312 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMA
431 int i, j, n2 = n * 2; local
707 bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument
[all...]
/external/icu/icu4c/source/common/
H A Dunorm.cpp51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
89 return unorm2_isNormalized((const UNormalizer2 *)n2, sr
101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
117 _iterate(UCharIterator *src, UBool forward, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UBool doNormalize, UBool *pNeededToNormalize, UErrorCode *pErrorCode) argument
182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
225 _concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UErrorCode *pErrorCode) argument
266 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
[all...]
/external/bzip2/
H A Dbzmore16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
/external/elfutils/libelf/
H A Delf32_fsize.c67 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
/external/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.guard/
H A Dvariadic_mutex.fail.cpp30 M n0, n1, n2; local
46 test_conversion<LG>({n0, n1, n2}); // expected-error{{no matching function for call}}
/external/clang/test/Sema/
H A Dattr-section.c14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
/external/google-breakpad/src/testing/gtest/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
/external/googletest/googletest/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
/external/protobuf/gtest/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
/external/v8/src/compiler/
H A Dgraph.h70 Node* NewNode(const Operator* op, Node* n1, Node* n2) { argument
71 Node* nodes[] = {n1, n2};
74 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument
75 Node* nodes[] = {n1, n2, n3};
78 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument
79 Node* nodes[] = {n1, n2, n3, n4};
82 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
84 Node* nodes[] = {n1, n2, n3, n4, n5};
87 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
89 Node* nodes[] = {n1, n2, n
92 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7) argument
97 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8) argument
102 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) argument
[all...]
/external/v8/testing/gtest/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
/external/vulkan-validation-layers/tests/gtest-1.7.0/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
/external/guava/guava-tests/benchmark/com/google/common/math/
H A DBigIntegerMathBenchmark.java68 * Returns the product of {@code n1} exclusive through {@code n2} inclusive.
70 private static BigInteger oldSlowFactorial(int n1, int n2) { argument
71 assert n1 <= n2;
72 if (IntMath.log2(n2, CEILING) * (n2 - n1) < Long.SIZE - 1) {
75 for (int i = n1 + 1; i <= n2; i++) {
85 int mid = (n1 + n2) >>> 1;
86 return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));

Completed in 2932 milliseconds

1234567891011