/freebsd-current/crypto/heimdal/lib/asn1/ |
H A D | check-der.c | 156 int i, n1, n2, n3, n4, n5, n6; local 158 n2 = 0; 161 n2 = n2 | n1; 163 n4 = ~n2; 168 test_one_int(n2);
|
H A D | check-gen.c | 337 Name n1, n2; local 364 /* n2 */ 365 n2.element = choice_Name_rdnSequence; 366 n2.u.rdnSequence.val = rdn2; 367 n2.u.rdnSequence.len = sizeof(rdn2)/sizeof(rdn2[0]); 385 tests[1].val = &n2;
|
/freebsd-current/crypto/heimdal/lib/hx509/ |
H A D | name.c | 442 _hx509_name_cmp(const Name *n1, const Name *n2, int *c) argument 447 *c = n1->u.rdnSequence.len - n2->u.rdnSequence.len; 452 *c = n1->u.rdnSequence.val[i].len - n2->u.rdnSequence.val[i].len; 463 &n2->u.rdnSequence.val[i].val[j].value, 479 * @param n2 a hx509 name object. 481 * @return 0 the objects are the same, returns > 0 is n2 is "larger" 482 * then n2, < 0 if n1 is "smaller" then n2. 488 hx509_name_cmp(hx509_name n1, hx509_name n2) argument 491 ret = _hx509_name_cmp(&n1->der_name, &n2 [all...] |
/freebsd-current/contrib/arm-optimized-routines/math/test/rtest/ |
H A D | semi.c | 273 int32 n2; local 289 test_frexp(x, y, (uint32 *)&n2); 290 ex = n + n2; 351 int32 n2; local 365 test_frexpf(x, &y, (uint32 *)&n2); 366 ex = n + n2;
|
/freebsd-current/crypto/openssl/crypto/bn/asm/ |
H A D | ia64-mont.pl | 375 n1=r24; n2=r25; n3=r26; n4=r27; n5=r28; n6=r29; n7=r30; n8=r31; 625 { .mii; (p16) getf.sig n2=nlo[2] // 23: 650 (p40) add a2=a2,n2 } // (p16) a2+=n2 651 { .mfi; (p42) add a2=a2,n2,1 659 (p40) cmp.ltu p41,p39=a2,n2 } 660 { .mfi; (p42) cmp.leu p41,p39=a2,n2 693 { .mmi; (p0) getf.sig n2=ni1 // 4: 777 (p32)sub n2=t[7],n2 [all...] |
/freebsd-current/contrib/googletest/googletest/test/ |
H A D | gtest_unittest.cc | 2221 bool SumIsEven2(int n1, int n2) { return IsEven(n1 + n2); } argument 2226 bool operator()(int n1, int n2, int n3) { return IsEven(n1 + n2 + n3); } argument 2232 const char* e4, int n1, int n2, int n3, 2234 const int sum = n1 + n2 + n3 + n4; 2241 << n2 << " + " << n3 << " + " << n4 << ") evaluates to " << sum 2250 const char* e4, const char* e5, int n1, int n2, 2252 const int sum = n1 + n2 + n3 + n4 + n5; 2259 << " (" << n1 << " + " << n2 << " 2231 AssertSumIsEven4(const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument 2249 operator ()(const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument 2328 const int n2 = 2; local 2350 const int n2 = 2; local 2371 int n2 = 0; local 2381 ASSERT_PRED_FORMAT5(AssertSumIsEven5Functor(), n1++, n2++, n3++, n4++, n5++) local [all...] |
H A D | googletest-output-test_.cc | 268 // SCOPED_TRACE("Trace A"); | waits for n2 270 // notifies n2 | 285 Notification n2; member in struct:CheckPoints 294 check_points->n2.WaitForNotification(); 315 check_points.n2.Notify();
|
/freebsd-current/crypto/openssl/crypto/bn/ |
H A D | bn_local.h | 649 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, 653 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t); 655 void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
|
/freebsd-current/usr.sbin/bluetooth/hccontrol/ |
H A D | link_control.c | 46 int n0, n1, n2, timo; local 76 if (sscanf(argv[0], "%x:%x:%x", &n2, &n1, &n0) != 3) 81 cp.lap[2] = (n2 & 0xff);
|
/freebsd-current/contrib/unbound/daemon/ |
H A D | acl_list.c | 558 struct addr_tree_node* n2 = (struct addr_tree_node*)k2; local 559 return sockaddr_cmp(&n1->addr, n1->addrlen, &n2->addr, 560 n2->addrlen);
|
/freebsd-current/contrib/tcpdump/ |
H A D | print-rx.c | 292 { 534, "list-attrib-n2" }, 756 #define FIDOUT() { uint32_t n1, n2, n3; \ 760 n2 = GET_BE_U_4(bp); \ 764 ND_PRINT(" fid %u/%u/%u", n1, n2, n3); \ 870 #define DESTSERVEROUT() { uint32_t n1, n2, n3; \ 874 n2 = GET_BE_U_4(bp); \ 878 ND_PRINT(" server %u:%u:%u", n1, n2, n3); \
|
/freebsd-current/contrib/bzip2/ |
H A D | bzlib.c | 975 Int32 n, n2, ret; local 1001 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar), 1003 if (n != n2 || ferror(bzf->handle)) 1035 Int32 n, n2, ret; local 1060 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar), 1062 if (n != n2 || ferror(bzf->handle))
|
/freebsd-current/contrib/flex/src/ |
H A D | misc.c | 564 void out_dec2 (const char *fmt, int n1, int n2) argument 566 fprintf (stdout, fmt, n1, n2);
|
/freebsd-current/sys/contrib/openzfs/tests/zfs-tests/cmd/ |
H A D | btree_test.c | 72 const int_node_t *n2 = v2; local 74 uint64_t b = n2->data;
|
/freebsd-current/contrib/llvm-project/llvm/lib/ProfileData/ |
H A D | SampleProfReader.cpp | 161 size_t n2 = Input.rfind(':'); 162 size_t n1 = Input.rfind(':', n2 - 1); 164 if (Input.substr(n1 + 1, n2 - n1 - 1).getAsInteger(10, NumSamples)) 166 if (Input.substr(n2 + 1).getAsInteger(10, NumHeadSamples)) 231 size_t n2 = Loc.find('.'); local 232 if (n2 == StringRef::npos) { 237 if (Loc.substr(0, n2).getAsInteger(10, LineOffset)) 239 if (Loc.substr(n2 + 1).getAsInteger(10, Discriminator))
|
/freebsd-current/usr.bin/sort/ |
H A D | coll.c | 863 unsigned long long n1, n2; local 893 n2 = kv2->hint->v.nh.n1; 894 if (n1 < n2) 896 else if (n1 > n2)
|
/freebsd-current/contrib/one-true-awk/ |
H A D | lib.c | 79 void makefields(int n1, int n2) /* create $n1..$n2 inclusive */ argument 84 for (i = n1; i <= n2; i++) { 521 void cleanfld(int n1, int n2) /* clean out fields n1 .. n2 inclusive */ argument 526 for (i = n1; i <= n2; i++) {
|
/freebsd-current/contrib/llvm-project/libcxx/src/include/ |
H A D | to_chars_floating_point.h | 541 const UInt n2 = n / 2; 542 const UInt mid = first + n2; 546 n = n - n2 - 1; 548 n = n2;
|
/freebsd-current/contrib/libarchive/libarchive/ |
H A D | archive_string.c | 2844 n = n2; \ 2931 int always_replace, n, n2, ret = 0, spair, ts, tm; local 3007 while ((n2 = parse(&uc2, s, len)) > 0) { 3014 if (n2 == spair || always_replace) 3020 s += n2; 3021 len -= n2; 3162 if (n2 < 0) { 3166 s += n2*-1; 3167 len -= n2*-1; 3170 } else if (n2 3238 int always_replace, n, n2, ret = 0, spair, ts, tm; local [all...] |
/freebsd-current/contrib/unbound/validator/ |
H A D | val_anchor.c | 64 struct trust_anchor* n2 = (struct trust_anchor*)k2; local 66 if(n1->dclass != n2->dclass) { 67 if(n1->dclass < n2->dclass) 71 return dname_lab_cmp(n1->name, n1->namelabs, n2->name, n2->namelabs,
|
/freebsd-current/sys/kern/ |
H A D | uipc_mbuf.c | 1682 struct mbuf *m, *n, *n2, **prev; local 1723 if ((n2 = n->m_next) != NULL && 1724 n->m_len + n2->m_len < MCLBYTES) { 1729 m_copydata(n2, 0, n2->m_len, 1731 m->m_len = n->m_len + n2->m_len; 1732 m->m_next = n2->m_next; 1736 curfrags -= frags_per_mbuf(n2); 1738 m_free(n2);
|
/freebsd-current/stand/ficl/ |
H A D | words.c | 338 ** slash-mod CORE ( n1 n2 -- n3 n4 ) 339 ** Divide n1 by n2, giving the single-cell remainder n3 and the single-cell 340 ** quotient n4. An ambiguous condition exists if n2 is zero. If n1 and n2 349 FICL_INT n2; local 355 n2 = stackPopINT(pVM->pStack); 359 qr = m64SymmetricDivI(n1, n2); 3134 ** accept CORE ( c-addr +n1 -- +n2 ) 3336 ** chars CORE ( n1 -- n2 ) 3337 ** n2 i 3853 FICL_INT n2; local 3893 FICL_INT n2; local 3908 FICL_INT n2; local [all...] |
/freebsd-current/contrib/bearssl/test/ |
H A D | test_x509.c | 267 size_t n, n2, u; local 271 n2 = n << 1; 272 new_buckets = xmalloc(n2 * sizeof *new_buckets); 273 for (u = 0; u < n2; u ++) { 285 v = (size_t)(hc & ((uint32_t)n2 - 1)); 293 ht->num_buckets = n2;
|
/freebsd-current/crypto/openssl/test/ |
H A D | ectest.c | 41 BIGNUM *n1 = NULL, *n2 = NULL, *order = NULL; local 48 || !TEST_ptr(n2 = BN_new()) 95 /* n2 = 1 + order */ 96 || !TEST_true(BN_add(n2, order, BN_value_one())) 97 || !TEST_true(EC_POINT_mul(group, Q, NULL, P, n2, ctx)) 100 /* n2 = (1 - order) * (1 + order) = 1 - order^2 */ 101 || !TEST_true(BN_mul(n2, n1, n2, ctx)) 102 || !TEST_true(EC_POINT_mul(group, Q, NULL, P, n2, ctx)) 106 /* n2 [all...] |
/freebsd-current/contrib/unbound/services/ |
H A D | localzone.c | 1112 uint8_t* n2; local 1117 n2 = nm; 1118 dname_remove_labels(&n2, &nmlen, nmlabs - match); 1119 n2 = memdup(n2, nmlen); 1121 if(!n2) { 1126 n2, 0, dclass); 1131 lz_enter_zone_dname(zones, n2, nmlen, match,
|