Home
last modified time | relevance | path

Searched refs:it (Results 1 – 25 of 81) sorted by relevance

1234

/crypto/asn1/
A Dtasn_new.cc50 switch (it->itype) { in ASN1_item_ex_new()
61 if (it->templates) { in ASN1_item_ex_new()
117 for (i = 0, tt = it->templates; i < it->tcount; tt++, i++) { in ASN1_item_ex_new()
144 switch (it->itype) { in asn1_item_clear()
150 if (it->templates) { in asn1_item_clear()
212 if (!it) { in ASN1_primitive_new()
218 assert(it->funcs == NULL); in ASN1_primitive_new()
224 utype = it->utype; in ASN1_primitive_new()
265 assert(it == NULL || it->funcs == NULL); in asn1_primitive_clear()
266 if (!it || (it->itype == ASN1_ITYPE_MSTRING)) { in asn1_primitive_clear()
[all …]
A Dtasn_fre.cc27 ASN1_item_ex_free(&val, it); in ASN1_item_free()
38 switch (it->itype) { in ASN1_item_ex_free()
40 if (it->templates) { in ASN1_item_ex_free()
43 ASN1_primitive_free(pval, it); in ASN1_item_ex_free()
48 ASN1_primitive_free(pval, it); in ASN1_item_ex_free()
60 if ((i >= 0) && (i < it->tcount)) { in ASN1_item_ex_free()
77 ef->asn1_ex_free(pval, it); in ASN1_item_ex_free()
93 asn1_enc_free(pval, it); in ASN1_item_ex_free()
132 assert(it->funcs == NULL); in ASN1_primitive_free()
134 int utype = it->itype == ASN1_ITYPE_MSTRING ? -1 : it->utype; in ASN1_primitive_free()
[all …]
A Dtasn_enc.cc103 switch (it->itype) { in asn1_item_ex_i2d_opt()
105 if (it->templates) { in asn1_item_ex_i2d_opt()
133 if (i < 0 || i >= it->tcount) { in asn1_item_ex_i2d_opt()
183 for (i = 0, tt = it->templates; i < it->tcount; tt++, i++) { in asn1_item_ex_i2d_opt()
206 for (i = 0, tt = it->templates; i < it->tcount; tt++, i++) { in asn1_item_ex_i2d_opt()
460 int utype = it->utype; in asn1_i2d_ex_primitive()
530 assert(it->itype == ASN1_ITYPE_PRIMITIVE || it->itype == ASN1_ITYPE_MSTRING); in asn1_ex_i2c()
533 assert(it->funcs == NULL); in asn1_ex_i2c()
539 if (it->itype != ASN1_ITYPE_PRIMITIVE || it->utype != V_ASN1_BOOLEAN) { in asn1_ex_i2c()
546 if (it->itype == ASN1_ITYPE_MSTRING || it->utype == V_ASN1_ANY_AS_STRING) { in asn1_ex_i2c()
[all …]
A Dtasn_dec.cc127 ASN1_item_ex_free(&ret, it); in ASN1_item_d2i()
181 switch (it->itype) { in asn1_item_ex_d2i()
183 if (it->templates) { in asn1_item_ex_d2i()
274 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) { in asn1_item_ex_d2i()
293 if (i == it->tcount) { in asn1_item_ex_d2i()
345 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) { in asn1_item_ex_d2i()
359 for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) { in asn1_item_ex_d2i()
438 ASN1_item_ex_free(pval, it); in asn1_item_ex_d2i()
629 assert(it->itype == ASN1_ITYPE_PRIMITIVE || it->itype == ASN1_ITYPE_MSTRING); in asn1_d2i_ex_primitive()
634 utype = it->utype; in asn1_d2i_ex_primitive()
[all …]
A Dtasn_utl.cc43 const ASN1_ITEM *it) { in asn1_set_choice_selector() argument
53 if (it->itype != ASN1_ITYPE_SEQUENCE) { in asn1_get_references()
80 assert(it->itype == ASN1_ITYPE_SEQUENCE); in asn1_get_enc_ptr()
85 aux = reinterpret_cast<const ASN1_AUX *>(it->funcs); in asn1_get_enc_ptr()
92 void asn1_enc_init(ASN1_VALUE **pval, const ASN1_ITEM *it) { in asn1_enc_init() argument
93 ASN1_ENCODING *enc = asn1_get_enc_ptr(pval, it); in asn1_enc_init()
101 void asn1_enc_free(ASN1_VALUE **pval, const ASN1_ITEM *it) { in asn1_enc_free() argument
102 ASN1_ENCODING *enc = asn1_get_enc_ptr(pval, it); in asn1_enc_free()
111 enc = asn1_get_enc_ptr(pval, it); in asn1_enc_save()
146 const ASN1_ITEM *it) { in asn1_enc_restore() argument
[all …]
A Dinternal.h92 int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it);
93 void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
115 const ASN1_ITEM *it, int tag, int aclass);
117 void ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
121 int asn1_get_choice_selector(ASN1_VALUE **pval, const ASN1_ITEM *it);
137 void asn1_refcount_set_one(ASN1_VALUE **pval, const ASN1_ITEM *it);
140 void asn1_enc_init(ASN1_VALUE **pval, const ASN1_ITEM *it);
141 void asn1_enc_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
147 const ASN1_ITEM *it);
153 const ASN1_ITEM *it, CRYPTO_BUFFER *buf);
[all …]
A Dasn_pack.cc21 ASN1_STRING *ASN1_item_pack(void *obj, const ASN1_ITEM *it, ASN1_STRING **out) { in ASN1_item_pack() argument
23 int len = ASN1_item_i2d(reinterpret_cast<ASN1_VALUE *>(obj), &new_data, it); in ASN1_item_pack()
47 void *ASN1_item_unpack(const ASN1_STRING *oct, const ASN1_ITEM *it) { in ASN1_item_unpack() argument
49 void *ret = ASN1_item_d2i(NULL, &p, oct->length, it); in ASN1_item_unpack()
52 ASN1_item_free(reinterpret_cast<ASN1_VALUE *>(ret), it); in ASN1_item_unpack()
A Da_i2d_fp.cc22 int ASN1_item_i2d_fp(const ASN1_ITEM *it, FILE *out, void *x) { in ASN1_item_i2d_fp() argument
28 int ret = ASN1_item_i2d_bio(it, b, x); in ASN1_item_i2d_fp()
33 int ASN1_item_i2d_bio(const ASN1_ITEM *it, BIO *out, void *x) { in ASN1_item_i2d_bio() argument
35 int n = ASN1_item_i2d(reinterpret_cast<ASN1_VALUE *>(x), &b, it); in ASN1_item_i2d_bio()
A Da_d2i_fp.cc24 void *ASN1_item_d2i_bio(const ASN1_ITEM *it, BIO *in, void *x) { in ASN1_item_d2i_bio() argument
33 void *ret = ASN1_item_d2i(reinterpret_cast<ASN1_VALUE **>(x), &ptr, len, it); in ASN1_item_d2i_bio()
38 void *ASN1_item_d2i_fp(const ASN1_ITEM *it, FILE *in, void *x) { in ASN1_item_d2i_fp() argument
44 void *ret = ASN1_item_d2i_bio(it, b, x); in ASN1_item_d2i_fp()
A Da_dup.cc24 void *ASN1_item_dup(const ASN1_ITEM *it, void *x) { in ASN1_item_dup() argument
34 i = ASN1_item_i2d(reinterpret_cast<ASN1_VALUE *>(x), &b, it); in ASN1_item_dup()
39 ret = ASN1_item_d2i(NULL, &p, i, it); in ASN1_item_dup()
/crypto/x509/
A Dx_name.cc42 long len, const ASN1_ITEM *it, int opt,
46 const ASN1_ITEM *it);
47 static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it);
48 static void x509_name_ex_free(ASN1_VALUE **val, const ASN1_ITEM *it);
94 static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it) { in IMPLEMENT_EXTERN_ASN1()
122 static void x509_name_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) { in x509_name_ex_free() argument
147 long len, const ASN1_ITEM *it, int opt, in x509_name_ex_d2i() argument
216 const ASN1_ITEM *it) { in x509_name_ex_i2d() argument
A Da_sign.cc27 int ASN1_item_sign(const ASN1_ITEM *it, X509_ALGOR *algor1, X509_ALGOR *algor2, in ASN1_item_sign() argument
38 return ASN1_item_sign_ctx(it, algor1, algor2, signature, asn, ctx.get()); in ASN1_item_sign()
41 int ASN1_item_sign_ctx(const ASN1_ITEM *it, X509_ALGOR *algor1, in ASN1_item_sign_ctx() argument
61 int in_len = ASN1_item_i2d(reinterpret_cast<ASN1_VALUE *>(asn), &in, it); in ASN1_item_sign_ctx()
A Dv3_lib.cc39 assert(ext->it != NULL); in X509V3_EXT_add()
147 ASN1_ITEM_ptr(ext_method->it)); in X509V3_EXT_free()
187 ASN1_item_d2i(NULL, &p, ext->value->length, ASN1_ITEM_ptr(method->it)); in X509V3_EXT_d2i()
194 ASN1_ITEM_ptr(method->it)); in X509V3_EXT_d2i()
A Da_digest.cc39 int ASN1_item_digest(const ASN1_ITEM *it, const EVP_MD *type, void *asn, in ASN1_item_digest() argument
44 i = ASN1_item_i2d(reinterpret_cast<ASN1_VALUE *>(asn), &str, it); in ASN1_item_digest()
A Da_verify.cc29 int ASN1_item_verify(const ASN1_ITEM *it, const X509_ALGOR *a, in ASN1_item_verify() argument
56 inl = ASN1_item_i2d(reinterpret_cast<ASN1_VALUE *>(asn), &buf_in, it); in ASN1_item_verify()
A Dx_x509.cc243 static int x509_new_cb(ASN1_VALUE **pval, const ASN1_ITEM *it) { in x509_new_cb() argument
248 static void x509_free_cb(ASN1_VALUE **pval, const ASN1_ITEM *it) { in x509_free_cb() argument
254 const ASN1_ITEM *it, int opt, ASN1_TLC *ctx) { in x509_d2i_cb() argument
278 const ASN1_ITEM *it) { in x509_i2d_cb() argument
/crypto/obj/
A Dobjects.txt501 id-it 1 : id-it-caProtEncCert
503 id-it 3 : id-it-encKeyPairTypes
505 id-it 5 : id-it-caKeyUpdateInfo
506 id-it 6 : id-it-currentCRL
507 id-it 7 : id-it-unsupportedOIDs
512 id-it 10 : id-it-keyPairParamReq
513 id-it 11 : id-it-keyPairParamRep
514 id-it 12 : id-it-revPassphrase
515 id-it 13 : id-it-implicitConfirm
517 id-it 15 : id-it-origPKIMessage
[all …]
/crypto/fipsmodule/rand/
A Drand.cc.inc35 // system entropy source fails, it's up to |CRYPTO_sysrand| to abort the
36 // process—we don't try to handle it.)
41 // the process or moving a VM, so we can keep thread-local RNG state and use it
46 // that we can do about it.)
61 // calls is the number of generate calls made on |drbg| since it was last
78 // |rand_thread_state_clear_all| clearing it. This lock should be uncontended
124 // |state->prev| may be NULL either if it is the head of the list,
125 // or if |state| is freed before it was added to the list at all.
248 // rand_get_seed fills |seed| with entropy. In some cases, it will additionally
342 // don't reseed with it so, from the point of view of FIPS, this doesn't
[all …]
/crypto/fipsmodule/
A DFIPS.md48 On the upstream stream, `FIPS_version` will return zero to indicate that it is not the validated mo…
56 …INGSSL_FIPS_BREAK_TESTS` can be defined in `fips_break_tests.h` to disable it for the purposes of …
126 …le_start` to `module_end`. Since this does not cover the jump to `memcpy`, it's fine that the link…
136 …ause the text segment is mapped read-only. If it's in a different segment then the code cannot ref…
145 …ved to the `.text` section, inside the module, so module code may reference it without relocations.
146 1. For each BSS symbol, it generates a function named after that symbol but with `_bss_get` append…
152 … script) to the unhashed portion of the text segment. If they don't match, it calls `exit` in an i…
154 …sh.go`) calculates the correct value from the assembled object and injects it back into the object.
167 …s it into the binary or recompiles with the value of the hash passed in as a #define. BoringCrypto…
168 1. OpenSSL references read-write data directly, since it can know the offsets to it. BoringCrypto …
[all …]
/crypto/fipsmodule/rsa/
A Drsa_impl.cc.inc82 // CryptoAPI doesn't support values larger than 32 bits [3], so it is
124 // it wrong (see https://github.com/openssl/openssl/issues/5158).
162 // of |rsa->d|, but normalize it so we only leak it once, rather than per
621 // implementations do this only when the CRT is used, but we do it in all
645 // that it and serializing does not leak information about the magnitude of
690 // changing the RSAZ code and may not be worth it. Note that the RSAZ code
691 // uses a different radix, so it uses R' = 2^1044. There we'd actually want
932 // Values over the threshold are discarded, so it is safe to leak this
938 // RSA key generation's bottleneck is discarding composites. If it fails
1191 // so we run the FIPS algorithm four times, bringing it down to 2^-80. We
[all …]
/crypto/fipsmodule/bn/
A Dexponentiation.cc.inc30 // bn_mul_mont_gather5 multiples loads index |power| of |table|, multiplies it
51 // bn_power5 squares |ap| five times and multiplies it by the value stored at
161 // Allocate a montgomery context if it was not supplied by the caller.
387 // vectorization it might do.
429 // |a| is secret, but it is required to be in range, so these comparisons may
449 // Allocate a montgomery context if it was not supplied by the caller.
461 // implementation assumes it can use |top| to size R.
472 // If the size of the operands allow it, perform the optimized RSAZ
565 // give reduced output, but it will still produce "almost" reduced output.
654 // The result is now in |tmp| in Montgomery form, but it may not be fully
[all …]
A Dmontgomery_inv.cc.inc56 // In the last step, it would only make sense to ignore the lowest limb of
57 // |t3| if it were zero. The middle steps ensure that this is the case:
82 // bn_neg_inv_r_mod_n_u64 calculates the -1/n mod r; i.e. it calculates |v|
128 // The addition can overflow, so use Dietz's method for it.
193 // threshold, it turns out that no multiply/double steps will be needed at
A Dprime.cc.inc388 // prime, so it is safe to leak failed trial divisions.
433 // w - 1 is -1 mod w, so we can compute it in the Montgomery domain, -R,
469 is_possibly_prime = 0 - is_possibly_prime; // Make it all zeros or all ones.
491 z_is_w1_mont = 0 - z_is_w1_mont; // Make it all zeros or all ones.
516 // |w| is prime, that it is prime is public. Only the value is secret.) This
517 // is fine for RSA key generation, but note it is important that we use
521 // quickly. We additionally treat |w| as public when it is a small prime to
528 // learning it is composite by Miller-Rabin (see below for details on that
540 // is likely small (the distribution falls exponentially), but it is also
629 // If the latter is large enough, it will be the limiting factor with high
/crypto/evp/
A Dscrypt_tests.txt36 # NB: this test requires more than 1GB of memory to run so it is disabled by
37 # default. Uncomment it to run.
A Devp_test.cc309 auto it = key_map->find(derive_peer); in SetupContext() local
310 if (it == key_map->end()) { in SetupContext()
314 EVP_PKEY *derive_peer_key = it->second.get(); in SetupContext()
409 auto it = key_map->find(key_name); in TestEVPOperation() local
410 if (it == key_map->end()) { in TestEVPOperation()
414 EVP_PKEY *key = it->second.get(); in TestEVPOperation()

Completed in 38 milliseconds

1234