Searched refs:k2 (Results 51 - 75 of 104) sorted by relevance

12345

/openbsd-current/usr.sbin/unbound/services/cache/
H A Dinfra.c87 struct infra_key* k2 = (struct infra_key*)key2; local
88 int r = sockaddr_cmp(&k1->addr, k1->addrlen, &k2->addr, k2->addrlen);
91 if(k1->namelen != k2->namelen) {
92 if(k1->namelen < k2->namelen)
96 return query_dname_compare(k1->zonename, k2->zonename);
129 struct rate_key* k2 = (struct rate_key*)key2; local
130 if(k1->namelen != k2->namelen) {
131 if(k1->namelen < k2->namelen)
135 return query_dname_compare(k1->name, k2
902 struct ip_rate_key* k2 = (struct ip_rate_key*)key2; local
[all...]
/openbsd-current/sbin/unwind/libunbound/services/cache/
H A Dinfra.c87 struct infra_key* k2 = (struct infra_key*)key2; local
88 int r = sockaddr_cmp(&k1->addr, k1->addrlen, &k2->addr, k2->addrlen);
91 if(k1->namelen != k2->namelen) {
92 if(k1->namelen < k2->namelen)
96 return query_dname_compare(k1->zonename, k2->zonename);
129 struct rate_key* k2 = (struct rate_key*)key2; local
130 if(k1->namelen != k2->namelen) {
131 if(k1->namelen < k2->namelen)
135 return query_dname_compare(k1->name, k2
902 struct ip_rate_key* k2 = (struct ip_rate_key*)key2; local
[all...]
/openbsd-current/regress/lib/libc/cephes/
H A Dieetst.c70 int m, n, k2, mprec, SPREC; variable
124 k2 = -125; /* underflow beyond 2^-k2 */
138 k2 = -125;
150 k2 = -1021;
164 k2 = -16382;
363 d1 = k2;
/openbsd-current/usr.sbin/pkg_add/OpenBSD/
H A DUpdateSet.pm139 my $k2 = join('-', @rest);
140 $k //= $k2;
141 if ($k2 ne $k) {
/openbsd-current/gnu/usr.bin/gcc/gcc/f/
H A Dinfo.h136 ffeinfoKindtype k2);
/openbsd-current/games/adventure/
H A Dhdr.h69 extern int loc, newloc, oldloc, oldlc2, wzdark, gaveup, kq, k, k2;
/openbsd-current/usr.sbin/unbound/util/data/
H A Dpacked_rrset.h328 * @param k2: struct ub_packed_rrset_key*.
331 int ub_rrset_compare(void* k1, void* k2);
H A Dpacked_rrset.c95 ub_rrset_compare(void* k1, void* k2) argument
98 struct ub_packed_rrset_key* key2 = (struct ub_packed_rrset_key*)k2;
/openbsd-current/sbin/unwind/libunbound/util/data/
H A Dpacked_rrset.h328 * @param k2: struct ub_packed_rrset_key*.
331 int ub_rrset_compare(void* k1, void* k2);
H A Dpacked_rrset.c95 ub_rrset_compare(void* k1, void* k2) argument
98 struct ub_packed_rrset_key* key2 = (struct ub_packed_rrset_key*)k2;
/openbsd-current/sys/dev/pci/drm/amd/display/dc/inc/hw/
H A Ddccg.h160 enum pixel_rate_div k2);
/openbsd-current/usr.sbin/sa/
H A Dusrdb.c265 uid_compare(const DBT *k1, const DBT *k2) argument
270 memcpy(&d2, k2->data, sizeof(d2));
/openbsd-current/gnu/usr.bin/perl/cpan/ExtUtils-MakeMaker/t/
H A Dmetafile_file.t30 my @meta = ( k1 => 'some key and value', k2 => undef, k3 => 1 );
34 k2: ~ label
/openbsd-current/sbin/unwind/libunbound/validator/
H A Dval_sigcrypt.c1011 canonical_tree_compare(const void* k1, const void* k2) argument
1014 struct canon_rr* r2 = (struct canon_rr*)k2;
1186 struct ub_packed_rrset_key* k1, struct ub_packed_rrset_key* k2)
1191 struct packed_rrset_data* d2=(struct packed_rrset_data*)k2->entry.data;
1198 if(k1->rk.dname_len != k2->rk.dname_len ||
1199 k1->rk.flags != k2->rk.flags ||
1200 k1->rk.type != k2->rk.type ||
1201 k1->rk.rrset_class != k2->rk.rrset_class ||
1202 query_dname_compare(k1->rk.dname, k2->rk.dname) != 0)
1228 canonical_sort(k2, d
1185 rrset_canonical_equal(struct regional* region, struct ub_packed_rrset_key* k1, struct ub_packed_rrset_key* k2) argument
[all...]
H A Dval_kentry.c68 key_entry_compfunc(void* k1, void* k2) argument
71 struct key_entry_key* n2 = (struct key_entry_key*)k2;
/openbsd-current/usr.sbin/unbound/validator/
H A Dval_sigcrypt.c1011 canonical_tree_compare(const void* k1, const void* k2) argument
1014 struct canon_rr* r2 = (struct canon_rr*)k2;
1186 struct ub_packed_rrset_key* k1, struct ub_packed_rrset_key* k2)
1191 struct packed_rrset_data* d2=(struct packed_rrset_data*)k2->entry.data;
1198 if(k1->rk.dname_len != k2->rk.dname_len ||
1199 k1->rk.flags != k2->rk.flags ||
1200 k1->rk.type != k2->rk.type ||
1201 k1->rk.rrset_class != k2->rk.rrset_class ||
1202 query_dname_compare(k1->rk.dname, k2->rk.dname) != 0)
1228 canonical_sort(k2, d
1185 rrset_canonical_equal(struct regional* region, struct ub_packed_rrset_key* k1, struct ub_packed_rrset_key* k2) argument
[all...]
H A Dval_kentry.c68 key_entry_compfunc(void* k1, void* k2) argument
71 struct key_entry_key* n2 = (struct key_entry_key*)k2;
/openbsd-current/gnu/llvm/lldb/source/Target/
H A DTrace.cpp71 K2 k2) {
75 return Lookup(it->second, k2);
80 static V *LookupAsPtr(DenseMap<K1, DenseMap<K2, V>> &map, K1 k1, K2 k2) { argument
84 return LookupAsPtr(it->second, k2);
70 Lookup(DenseMap<K1, DenseMap<K2, V>> &map, K1 k1, K2 k2) argument
/openbsd-current/gnu/usr.bin/perl/cpan/Term-Cap/
H A Dtest.pl237 :k2=v2\\n2
/openbsd-current/gnu/usr.bin/texinfo/util/
H A Dgen-dir-node170 sort -t: -k2 -k1 | tr ' ' '_')`
/openbsd-current/gnu/usr.bin/perl/regen/
H A DHeaderParser.pm1411 my ($k1, $k2, $k3)=
1414 if (length($k1) and defined($k2) and !defined($k3)) {
1417 # two keys (defined($k2) and !defined($k3)) we need to compute
1422 if (length($k1) and !defined($k2)) {
1432 ($k1, $k2)=
1434 } while length($k1) and !defined $k2;
1452 elsif (defined($not_k1) and $not_k1 eq $k2) {
1471 $path[-1][-1]= $k2;
1472 $self->_handle_else($k2, $kid->{$k2},
[all...]
/openbsd-current/lib/libcrypto/sm4/
H A Dsm4.c204 #define SM4_ROUNDS(k0, k1, k2, k3, F) \
208 B2 ^= F(B0 ^ B1 ^ B3 ^ ks->rk[k2]); \
/openbsd-current/gnu/usr.bin/perl/lib/
H A Dutf8.t480 my $k2 = $name;
482 utf8::decode($k2);
483 my $h = { $k1 => 1, $k2 => 2 };
484 is join('', keys %$h), $k2, 'utf8::decode respects copy-on-write';
/openbsd-current/usr.sbin/unbound/dnscrypt/
H A Ddnscrypt.c1083 struct nonce_cache_key *k1 = m1, *k2 = m2; local
1087 k2->nonce,
1091 k2->magic_query,
1094 k1->client_publickey, k2->client_publickey,
/openbsd-current/gnu/usr.bin/perl/t/op/
H A Daassign.t470 my (%a, %b) = qw(k1 v1 k2 v2);
473 is(join(' ', sort keys %a), "k1 k2", "double hash A keys");
478 (%a, %b) = qw(k1 v1 k2 v2);
481 is(join(' ', sort keys %a), "k1 k2", "double hash non-empty A keys");

Completed in 386 milliseconds

12345