Home
last modified time | relevance | path

Searched +full:exact +full:- +full:len (Results 1 – 25 of 399) sorted by relevance

12345678910>>...16

/freebsd/contrib/bearssl/inc/
H A Dbearssl_aead.h51 * - A symmetric key. Exact size depends on the AEAD algorithm.
53 * - A nonce (IV). Size depends on the AEAD algorithm; for most
58 * - Data to encrypt and protect.
60 * - Additional authenticated data, which is covered by the MAC but
77 * - `br_xxx_init()`
80 * Exact parameters depend on the algorithm, and may include
85 * - `br_xxx_reset()`
90 * - `br_xxx_aad_inject()`
95 * - `br_xxx_flip()`
101 * - `br_xxx_run()`
[all …]
/freebsd/contrib/unbound/services/
H A Dlocalzone.h2 * services/localzone.h - local zones authority service.
63 * local-data directly.
104 /** answer not from the view, but global or no-answer */
184 * If this list is NULL, the node is an empty non-terminal. */
234 * @return: -1, 0, +1 comparison value.
242 * @return: -1, 0, +1 comparison value.
257 * @param len: length of name.
264 * local-zone's tags.
268 uint8_t* name, size_t len, int labs, uint16_t dclass, uint16_t dtype,
276 * @param len
[all...]
H A Dlocalzone.c2 * services/localzone.c - local zones authority service.
65 RBTREE_FOR(d, struct local_data*, &z->data) { in local_zone_out()
66 for(p = d->rrsets; p; p = p->next) { in local_zone_out()
67 log_nametypeclass(NO_VERBOSE, "rrset", d->name, in local_zone_out()
68 ntohs(p->rrset->rk.type), in local_zone_out()
69 ntohs(p->rrset->rk.rrset_class)); in local_zone_out()
78 lock_rw_rdlock(&z->loc in local_zone_print()
170 parse_dname(const char * str,uint8_t ** res,size_t * len,int * labs) parse_dname() argument
184 local_zone_create(uint8_t * nm,size_t len,int labs,enum localzone_type t,uint16_t dclass) local_zone_create() argument
211 lz_enter_zone_dname(struct local_zones * zones,uint8_t * nm,size_t len,int labs,enum localzone_type t,uint16_t c) lz_enter_zone_dname() argument
252 size_t len; lz_enter_zone() local
272 rrstr_get_rr_content(const char * str,uint8_t ** nm,uint16_t * type,uint16_t * dclass,time_t * ttl,uint8_t * rr,size_t len,uint8_t ** rdata,size_t * rdata_len) rrstr_get_rr_content() argument
303 size_t len = sizeof(rr), dname_len = 0; get_rr_nameclass() local
643 size_t len; lz_enter_rr_str() local
669 lz_enter_zone_tag(struct local_zones * zones,char * zname,uint8_t * list,size_t len,uint16_t rr_class) lz_enter_zone_tag() argument
831 size_t len = strlen(name); lz_nodefault() local
1046 size_t len; lz_setup_implicit() local
1224 local_zones_lookup(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,uint16_t dtype) local_zones_lookup() argument
1232 local_zones_tags_lookup(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,uint16_t dtype,uint8_t * taglist,size_t taglen,int ignoretags) local_zones_tags_lookup() argument
1270 local_zones_find(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass) local_zones_find() argument
1284 local_zones_find_le(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,int * exact) local_zones_find_le() argument
1285 local_zones_find_le(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,int * exact) local_zones_find_le() argument
1367 size_t len; local_data_find_tag_datas() local
2031 local_zones_add_zone(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass,enum localzone_type tp) local_zones_add_zone() argument
2034 int exact; local_zones_add_zone() local
2084 size_t len; local_zones_add_RR() local
2131 del_empty_term(struct local_zone * z,struct local_data * d,uint8_t * name,size_t len,int labs) del_empty_term() argument
2165 local_zones_del_data(struct local_zones * zones,uint8_t * name,size_t len,int labs,uint16_t dclass) local_zones_del_data() argument
[all...]
/freebsd/contrib/arm-optimized-routines/string/aarch64/
H A Dstrlen.S2 * strlen - calculate the length of a string.
4 * Copyright (c) 2020-2022, Arm Limited.
5 * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception
10 * ARMv8-a, AArch64, Advanced SIMD, unaligned accesses.
17 #define len x0 macro
43 (X - 1) & (~X) & 0x80 (=> (X - 1) & ~(X | 0x7f)) is non-zero if a
50 -DTEST_PAGE_CROSS - this will force all calls through the slower
65 If there is a NUL byte we calculate the length from the 2 8-byte words
78 and tmp1, srcin, MIN_PAGE_SIZE - 1
79 cmp tmp1, MIN_PAGE_SIZE - 32
[all …]
/freebsd/contrib/unbound/util/storage/
H A Ddnstree.c2 * util/storage/dnstree.c - support for rbtree types suitable for DNS code.
52 if(x->dclass != y->dclass) { in name_tree_compare()
53 if(x->dclass < y->dclass) in name_tree_compare()
54 return -1; in name_tree_compare()
57 return dname_lab_cmp(x->name, x->labs, y->name, y->lab in name_tree_compare()
98 name_tree_insert(rbtree_type * tree,struct name_tree_node * node,uint8_t * name,size_t len,int labs,uint16_t dclass) name_tree_insert() argument
180 name_tree_find(rbtree_type * tree,uint8_t * name,size_t len,int labs,uint16_t dclass) name_tree_find() argument
192 name_tree_lookup(rbtree_type * tree,uint8_t * name,size_t len,int labs,uint16_t dclass) name_tree_lookup() argument
[all...]
/freebsd/contrib/ldns/
H A Dradix.c2 * radix.c -- generic radix tree
51 radix_strlen_t len);
53 radix_strlen_t len, ldns_radix_node_t** result, radix_strlen_t* pos);
57 radix_strlen_t pos, radix_strlen_t len);
62 radix_strlen_t pos, radix_strlen_t len, ldns_radix_node_t* add);
90 ldns_radix_new_node(void* data, uint8_t* key, radix_strlen_t len) in ldns_radix_new_node() argument
96 node->data = data; in ldns_radix_new_node()
97 node->key = key; in ldns_radix_new_node()
98 node->klen = len; in ldns_radix_new_node()
99 node->parent = NULL; in ldns_radix_new_node()
[all …]
/freebsd/contrib/ldns/ldns/
H A Dradix.h2 * radix.h -- generic radix tree
62 radix_strlen_t len; member
80 uint16_t len; member
122 * @param len: length of key.
128 radix_strlen_t len, void* data);
134 * @param len: length of key.
138 void* ldns_radix_delete(ldns_radix_t* tree, const uint8_t* key, radix_strlen_t len);
144 * @param len: length of key.
149 radix_strlen_t len);
156 * @param len: length of key.
[all …]
/freebsd/contrib/unbound/validator/
H A Dval_neg.c2 * validator/val_neg.c - validator aggressive negative caching functions.
70 return dname_canon_lab_cmp(x->name, x->labs, y->name, y->labs, &m); in val_neg_data_compare()
78 if(x->dclass != y->dclass) { in val_neg_zone_compare()
79 if(x->dclass < y->dclass) in val_neg_zone_compare()
80 return - in val_neg_zone_compare()
281 neg_find_zone(struct val_neg_cache * neg,uint8_t * nm,size_t len,uint16_t dclass) neg_find_zone() argument
305 neg_find_data(struct val_neg_zone * zone,uint8_t * nm,size_t len,int labs) neg_find_data() argument
327 size_t i, len, res = 0; calc_data_need() local
350 calc_zone_need(uint8_t * d,size_t len) calc_zone_need() argument
950 neg_closest_data(struct val_neg_zone * zone,uint8_t * qname,size_t len,int labs,struct val_neg_data ** data) neg_closest_data() argument
[all...]
/freebsd/contrib/wpa/src/eap_common/
H A Deap_common.c3 * Copyright (c) 2004-2014, Jouni Malinen <j@w1.fi>
16 * eap_hdr_len_valid - Validate EAP header length field
28 size_t len; in eap_hdr_len_valid() local
40 len = be_to_host16(hdr->length); in eap_hdr_len_valid()
41 if (len < sizeof(*hdr) + min_payload || len > wpabuf_len(msg)) { in eap_hdr_len_valid()
51 * eap_hdr_validate - Validate EAP header
52 * @vendor: Expected EAP Vendor-Id (0 = IETF)
71 size_t len; in eap_hdr_validate() local
77 len = be_to_host16(hdr->length); in eap_hdr_validate()
83 if (len < sizeof(*hdr) + 8) { in eap_hdr_validate()
[all …]
/freebsd/crypto/libecc/src/curves/
H A Dcurves.c2 * Copyright (C) 2017 - This file is part of libecc project
7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
19 * From a null-terminated string 'ec_name' of exact length 'ec_name_len'
22 * -1 on error or if the search was unsuccessful. It returns 0 on success.
30 u32 len; in ec_get_curve_params_by_name() local
44 ret = local_strnlen((const char *)ec_name, ec_name_len, &len); EG(ret, err); in ec_get_curve_params_by_name()
45 comp_len = (u8)len; in ec_get_curve_params_by_name()
49 ret = -1; in ec_get_curve_params_by_name()
52 params = map->params; in ec_get_curve_params_by_name()
55 MUST_HAVE((params->name != NULL), ret, err); in ec_get_curve_params_by_name()
[all …]
/freebsd/sys/dev/cxgbe/
H A Dt4_ioctl.h1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
80 uint32_t len; /* bytes */
85 uint32_t len;
92 uint32_t len;
100 uint8_t len;
151 UCAST_EXACT = 0, /* exact unicas
79 uint32_t len; /* bytes */ global() member
84 uint32_t len; global() member
91 uint32_t len; global() member
99 uint8_t len; global() member
340 uint32_t len; global() member
366 uint32_t len; global() member
[all...]
/freebsd/contrib/flex/src/
H A Dscanopt.c1 /* flex - tool to generate fast lexical analyzers */
10 /* to contract no. DE-AC03-76SF00098 between the United States */
47 int namelen; /* Length of the actual option word, e.g., "--file[=foo]" is 4 */
48 int printlen; /* Length of entire string, e.g., "--file[=foo]" is 12 */
65 /* Accessor functions. These WOULD be one-liners, but portability calls. */
77 return s->options[i].opt_fmt + in NAME()
78 ((s->aux[i].flags & IS_LONG) ? 2 : 1); in NAME()
83 return s->aux[i].printlen; in PRINTLEN()
88 return s->options[i].r_val; in RVAL()
93 return s->aux[i].flags; in FLAGS()
[all …]
/freebsd/crypto/openssl/doc/man3/
H A DOSSL_STORE_SEARCH.pod17 - Type and functions to create OSSL_STORE search criteria
31 *bytes, int len);
100 This criterion supports a search by exact match of subject name.
107 This criterion supports a search by exact match of both issuer name and serial
117 This criterion supports a search by exact match of key fingerprint.
187 Copyright 2018-2024 The OpenSSL Project Authors. All Rights Reserved.
/freebsd/secure/lib/libcrypto/man/man3/
H A DOSSL_STORE_SEARCH.31 .\" -*- mode: troff; coding: utf-8 -*-
58 .TH OSSL_STORE_SEARCH 3ossl 2025-09-30 3.5.4 OpenSSL
76 \&\- Type and functions to create OSSL_STORE search criteria
90 \& *bytes, int len);
152 This criterion supports a search by exact match of subject name.
158 This criterion supports a search by exact match of both issuer name and serial
167 This criterion supports a search by exact match of key fingerprint.
230 Copyright 2018\-2024 The OpenSSL Project Authors. All Rights Reserved.
/freebsd/contrib/libarchive/libarchive/test/
H A Dtest_write_format_zip_windows_path.c1 /*-
69 * making it difficult to get the exact path written in the archive. in test_with_hdrcharset()
80 size_t len = strlen(raw_path); in test_with_hdrcharset() local
81 for (char *ptr = buff; ptr < (buff + used - len); ptr++) { in test_with_hdrcharset()
82 if (memcmp(ptr, expected, len) == 0) in test_with_hdrcharset()
84 if (memcmp(ptr, unexpected, len) == 0) in test_with_hdrcharset()
97 test_with_hdrcharset("ISO-8859-1"); in DEFINE_TEST()
98 test_with_hdrcharset("UTF-8"); in DEFINE_TEST()
/freebsd/sys/kern/
H A Dsubr_hints.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
70 eqidx = eq - cp; in static_hints_to_env()
286 *ret_namelen = s - *ret_name - 1; /* device length */ in res_find()
294 *ret_resnamelen = s - *ret_resname - 1; /* value len */ in res_find()
319 /* Search for exact unit matches first */ in resource_find()
328 un = -1; in resource_find()
405 resource_string_copy(const char *s, int len) in resource_string_copy() argument
411 if (len == 0) in resource_string_copy()
412 len = strlen(s); in resource_string_copy()
[all …]
/freebsd/crypto/heimdal/lib/roken/
H A Dparse_time.343 The roken library (libroken, -lroken)
51 .Fn unparse_time "int seconds" "char *buf" "size_t len"
53 .Fn unparse_time_approx "int seconds" "char *buf" "size_t len"
76 produces an exact time, while
85 .Bl -tag -width "month" -compact -offset indent
104 or -1 on error.
111 .Fa len
115 .Bd -literal
128 if(result == -1) {
132 printf("--\\n");
[all …]
/freebsd/share/doc/papers/newvm/
H A Da.t31 Appendix A \- Virtual Memory Interface
42 /* protections are chosen from these bits, or-ed together */
68 The cpu-dependent size of a page is returned by the
77 maddr = mmap(addr, len, prot, flags, fd, pos);
78 result caddr_t maddr; caddr_t addr; int *len, prot, flags, fd; off_t pos;
81 for at most \fIlen\fP bytes to be mapped from the object represented by
87 in which case the exact address will be used or the call will fail.
88 The actual amount mapped is returned in \fIlen\fP.
89 The \fIaddr\fP, \fIlen\fP, and \fIpos\fP parameters
103 mapping a regular file or character-special device memory,
[all …]
/freebsd/bin/pax/
H A Dpat_rep.c1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
49 * copy (-rw). Both file name and link names are adjusted as required in these
68 * parses the -s replacement string; compiles the regular expression
79 * the list of replacement patterns; -1 otherwise.
96 return(-1); in rep_add()
105 return(-1); in rep_add()
114 return(-1); in rep_add()
118 if ((res = regcomp(&(rep->rcmp), str+1, 0)) != 0) { in rep_add()
119 regerror(res, &(rep->rcmp), rebuf, sizeof(rebuf)); in rep_add()
[all …]
/freebsd/contrib/bearssl/src/int/
H A Di15_moddiv.c29 * without the usual one-word header. Value is split into 15-bit words,
30 * each stored in a 16-bit slot (top bit is zero) in little-endian
37 * Negate big integer conditionally. The value consists of 'len' words,
43 cond_negate(uint16_t *a, size_t len, uint32_t ctl) in cond_negate() argument
49 xm = 0x7FFF & -ctl; in cond_negate()
50 for (k = 0; k < len; k ++) { in cond_negate()
63 * if neg = 1, then -m <= a < 0
71 finish_mod(uint16_t *a, size_t len, const uint16_t *m, uint32_t neg) in finish_mod() argument
80 for (k = 0; k < len; k ++) { in finish_mod()
85 cc = (aw - mw - cc) >> 31; in finish_mod()
[all …]
H A Di31_moddiv.c29 * without the usual one-word header. Value is split into 31-bit words,
30 * each stored in a 32-bit slot (top bit is zero) in little-endian
37 * Negate big integer conditionally. The value consists of 'len' words,
43 cond_negate(uint32_t *a, size_t len, uint32_t ctl) in cond_negate() argument
49 xm = -ctl >> 1; in cond_negate()
50 for (k = 0; k < len; k ++) { in cond_negate()
63 * if neg = 1, then -m <= a < 0
71 finish_mod(uint32_t *a, size_t len, const uint32_t *m, uint32_t neg) in finish_mod() argument
83 for (k = 0; k < len; k ++) { in finish_mod()
88 cc = (aw - mw - cc) >> 31; in finish_mod()
[all …]
/freebsd/crypto/openssl/crypto/modes/
H A Dctr128.c2 * Copyright 2008-2021 The OpenSSL Project Authors. All Rights Reserved.
22 * NOTE: the IV/counter CTR mode is big-endian. The code itself is
23 * endian-neutral.
26 /* increment counter (128-bit int) by 1 */
32 --n; in ctr128_inc()
54 --n; in ctr128_inc_aligned()
57 c = ((d - c) & ~d) >> (sizeof(size_t) * 8 - 1); in ctr128_inc_aligned()
74 size_t len, const void *key, in CRYPTO_ctr128_encrypt() argument
87 while (n && len) { in CRYPTO_ctr128_encrypt()
89 --len; in CRYPTO_ctr128_encrypt()
[all …]
/freebsd/contrib/ntp/sntp/libopts/
H A Dsave-flags.c1 /* -*- buffer-read-only: t -*- vi: set ro:
3 * DO NOT EDIT THIS FILE (save-flags.c)
5 * It has been AutoGen-ed
6 * From the definitions /tmp/.ag-ufBbQe/save-flags.def
33 #include "save-flags.h"
47 find_save_flags_bnm(char const * str, size_t len);
56 /* ANSI-C code produced by gperf version 3.1 */
57 /* Command-line: gperf save-flags.gp */
58 /* Computed positions: -k'' */
62 // %struct-type
[all …]
/freebsd/share/doc/psd/05.sysman/
H A D1.2.t39 The text area is read-only and shared, while the data and stack
66 /* protections are chosen from these bits, or-ed together */
93 The cpu-dependent size of a page is returned by the
102 maddr = mmap(addr, len, prot, flags, fd, pos);
103 result caddr_t maddr; caddr_t addr; int *len, prot, flags, fd; off_t pos;
106 for at most \fIlen\fP bytes to be mapped from the object represented by
112 in which case the exact address will be used or the call will fail.
113 The actual amount mapped is returned in \fIlen\fP.
114 The \fIaddr\fP, \fIlen\fP, and \fIpos\fP parameters
128 mapping a regular file or character-special device memory,
[all …]
/freebsd/contrib/bearssl/src/rsa/
H A Drsa_i15_privexp.c33 * We want to invert e modulo phi = (p-1)(q-1). This first in br_rsa_i15_compute_privexp()
39 * modulo phi, but this would involve assembling three modulus-wide in br_rsa_i15_compute_privexp()
42 * slightly more than 3 kB of stack space for RSA-4096. This in br_rsa_i15_compute_privexp()
47 * - We compute phi = k*e + r (Euclidean division of phi by e). in br_rsa_i15_compute_privexp()
50 * enforce non-ridiculously-small factors. in br_rsa_i15_compute_privexp()
52 * - We find small u, v such that u*e - v*r = 1 (using a in br_rsa_i15_compute_privexp()
56 * - Solution is: d = u + v*k in br_rsa_i15_compute_privexp()
57 * This last computation is exact: since u < r and v < e, in br_rsa_i15_compute_privexp()
58 * the above implies d < r + e*((phi-r)/e) = phi in br_rsa_i15_compute_privexp()
64 size_t plen, qlen, u, len, dlen; in br_rsa_i15_compute_privexp() local
[all …]

12345678910>>...16