grpc 1.69.0 → 1.71.0

data/third_party/boringssl-with-bazel/src/crypto/dsa/{dsa.c → dsa.cc}

@@ -1,61 +1,16 @@
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- *
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- *
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- *
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- *
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- *
- * The DSS routines are based on patches supplied by
- * Steven Schoch <schoch@sheba.arc.nasa.gov>. */
+// Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     https://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
 
 #include <openssl/dsa.h>
 
@@ -72,10 +27,10 @@
 #include <openssl/sha.h>
 #include <openssl/thread.h>
 
-#include "internal.h"
 #include "../fipsmodule/bn/internal.h"
 #include "../fipsmodule/dh/internal.h"
 #include "../internal.h"
+#include "internal.h"
 
 
 // Primality test according to FIPS PUB 186[-1], Appendix 2.1: 50 rounds of
@@ -88,7 +43,7 @@ static int dsa_sign_setup(const DSA *dsa, BN_CTX *ctx_in, BIGNUM **out_kinv,
 static CRYPTO_EX_DATA_CLASS g_ex_data_class = CRYPTO_EX_DATA_CLASS_INIT;
 
 DSA *DSA_new(void) {
-  DSA *dsa = OPENSSL_zalloc(sizeof(DSA));
+  DSA *dsa = reinterpret_cast<DSA *>(OPENSSL_zalloc(sizeof(DSA)));
   if (dsa == NULL) {
     return NULL;
   }
@@ -179,8 +134,7 @@ int DSA_set0_key(DSA *dsa, BIGNUM *pub_key, BIGNUM *priv_key) {
 }
 
 int DSA_set0_pqg(DSA *dsa, BIGNUM *p, BIGNUM *q, BIGNUM *g) {
-  if ((dsa->p == NULL && p == NULL) ||
-      (dsa->q == NULL && q == NULL) ||
+  if ((dsa->p == NULL && p == NULL) || (dsa->q == NULL && q == NULL) ||
       (dsa->g == NULL && g == NULL)) {
     return 0;
   }
@@ -312,7 +266,8 @@ int DSA_generate_parameters_ex(DSA *dsa, unsigned bits, const uint8_t *seed_in,
       }
 
       // step 4
-      r = BN_is_prime_fasttest_ex(q, DSS_prime_checks, ctx, use_random_seed, cb);
+      r = BN_is_prime_fasttest_ex(q, DSS_prime_checks, ctx, use_random_seed,
+                                  cb);
       if (r > 0) {
         break;
       }
@@ -356,25 +311,20 @@ int DSA_generate_parameters_ex(DSA *dsa, unsigned bits, const uint8_t *seed_in,
         }
 
         // step 8
-        if (!BN_bin2bn(md, qsize, r0) ||
-            !BN_lshift(r0, r0, (qsize << 3) * k) ||
+        if (!BN_bin2bn(md, qsize, r0) || !BN_lshift(r0, r0, (qsize << 3) * k) ||
             !BN_add(W, W, r0)) {
           goto err;
         }
       }
 
       // more of step 8
-      if (!BN_mask_bits(W, bits - 1) ||
-          !BN_copy(X, W) ||
-          !BN_add(X, X, test)) {
+      if (!BN_mask_bits(W, bits - 1) || !BN_copy(X, W) || !BN_add(X, X, test)) {
         goto err;
       }
 
       // step 9
-      if (!BN_lshift1(r0, q) ||
-          !BN_mod(c, X, r0, ctx) ||
-          !BN_sub(r0, c, BN_value_one()) ||
-          !BN_sub(p, X, r0)) {
+      if (!BN_lshift1(r0, q) || !BN_mod(c, X, r0, ctx) ||
+          !BN_sub(r0, c, BN_value_one()) || !BN_sub(p, X, r0)) {
         goto err;
       }
 
@@ -407,14 +357,12 @@ end:
 
   // We now need to generate g
   // Set r0=(p-1)/q
-  if (!BN_sub(test, p, BN_value_one()) ||
-      !BN_div(r0, NULL, test, q, ctx)) {
+  if (!BN_sub(test, p, BN_value_one()) || !BN_div(r0, NULL, test, q, ctx)) {
     goto err;
   }
 
   mont = BN_MONT_CTX_new_for_modulus(p, ctx);
-  if (mont == NULL ||
-      !BN_set_word(test, h)) {
+  if (mont == NULL || !BN_set_word(test, h)) {
     goto err;
   }
 
@@ -541,7 +489,9 @@ err:
   return ok;
 }
 
-DSA_SIG *DSA_SIG_new(void) { return OPENSSL_zalloc(sizeof(DSA_SIG)); }
+DSA_SIG *DSA_SIG_new(void) {
+  return reinterpret_cast<DSA_SIG *>(OPENSSL_zalloc(sizeof(DSA_SIG)));
+}
 
 void DSA_SIG_free(DSA_SIG *sig) {
   if (!sig) {
@@ -583,8 +533,7 @@ static int mod_mul_consttime(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
   BIGNUM *tmp = BN_CTX_get(ctx);
   // |BN_mod_mul_montgomery| removes a factor of R, so we cancel it with a
   // single |BN_to_montgomery| which adds one factor of R.
-  int ok = tmp != NULL &&
-           BN_to_montgomery(tmp, a, mont, ctx) &&
+  int ok = tmp != NULL && BN_to_montgomery(tmp, a, mont, ctx) &&
            BN_mod_mul_montgomery(r, tmp, b, mont, ctx);
   BN_CTX_end(ctx);
   return ok;
@@ -609,79 +558,80 @@ DSA_SIG *DSA_do_sign(const uint8_t *digest, size_t digest_len, const DSA *dsa) {
   BN_init(&m);
   BN_init(&xr);
   s = BN_new();
-  if (s == NULL) {
-    goto err;
-  }
-  ctx = BN_CTX_new();
-  if (ctx == NULL) {
-    goto err;
-  }
+  {
+    if (s == NULL) {
+      goto err;
+    }
+    ctx = BN_CTX_new();
+    if (ctx == NULL) {
+      goto err;
+    }
 
-  // Cap iterations so that invalid parameters do not infinite loop. This does
-  // not impact valid parameters because the probability of requiring even one
-  // retry is negligible, let alone 32. Unfortunately, DSA was mis-specified, so
-  // invalid parameters are reachable from most callers handling untrusted
-  // private keys. (The |dsa_check_key| call above is not sufficient. Checking
-  // whether arbitrary paremeters form a valid DSA group is expensive.)
-  static const int kMaxIterations = 32;
-  int iters = 0;
-redo:
-  if (!dsa_sign_setup(dsa, ctx, &kinv, &r)) {
-    goto err;
-  }
+    // Cap iterations so that invalid parameters do not infinite loop. This does
+    // not impact valid parameters because the probability of requiring even one
+    // retry is negligible, let alone 32. Unfortunately, DSA was mis-specified,
+    // so invalid parameters are reachable from most callers handling untrusted
+    // private keys. (The |dsa_check_key| call above is not sufficient. Checking
+    // whether arbitrary paremeters form a valid DSA group is expensive.)
+    static const int kMaxIterations = 32;
+    int iters = 0;
+  redo:
+    if (!dsa_sign_setup(dsa, ctx, &kinv, &r)) {
+      goto err;
+    }
 
-  if (digest_len > BN_num_bytes(dsa->q)) {
-    // If the digest length is greater than the size of |dsa->q| use the
-    // BN_num_bits(dsa->q) leftmost bits of the digest, see FIPS 186-3, 4.2.
-    // Note the above check that |dsa->q| is a multiple of 8 bits.
-    digest_len = BN_num_bytes(dsa->q);
-  }
+    if (digest_len > BN_num_bytes(dsa->q)) {
+      // If the digest length is greater than the size of |dsa->q| use the
+      // BN_num_bits(dsa->q) leftmost bits of the digest, see FIPS 186-3, 4.2.
+      // Note the above check that |dsa->q| is a multiple of 8 bits.
+      digest_len = BN_num_bytes(dsa->q);
+    }
 
-  if (BN_bin2bn(digest, digest_len, &m) == NULL) {
-    goto err;
-  }
+    if (BN_bin2bn(digest, digest_len, &m) == NULL) {
+      goto err;
+    }
 
-  // |m| is bounded by 2^(num_bits(q)), which is slightly looser than q. This
-  // violates |bn_mod_add_consttime| and |mod_mul_consttime|'s preconditions.
-  // (The underlying algorithms could accept looser bounds, but we reduce for
-  // simplicity.)
-  size_t q_width = bn_minimal_width(dsa->q);
-  if (!bn_resize_words(&m, q_width) ||
-      !bn_resize_words(&xr, q_width)) {
-    goto err;
-  }
-  bn_reduce_once_in_place(m.d, 0 /* no carry word */, dsa->q->d,
-                          xr.d /* scratch space */, q_width);
+    // |m| is bounded by 2^(num_bits(q)), which is slightly looser than q. This
+    // violates |bn_mod_add_consttime| and |mod_mul_consttime|'s preconditions.
+    // (The underlying algorithms could accept looser bounds, but we reduce for
+    // simplicity.)
+    size_t q_width = bn_minimal_width(dsa->q);
+    if (!bn_resize_words(&m, q_width) || !bn_resize_words(&xr, q_width)) {
+      goto err;
+    }
+    bn_reduce_once_in_place(m.d, 0 /* no carry word */, dsa->q->d,
+                            xr.d /* scratch space */, q_width);
+
+    // Compute s = inv(k) (m + xr) mod q. Note |dsa->method_mont_q| is
+    // initialized by |dsa_sign_setup|.
+    if (!mod_mul_consttime(&xr, dsa->priv_key, r, dsa->method_mont_q, ctx) ||
+        !bn_mod_add_consttime(s, &xr, &m, dsa->q, ctx) ||
+        !mod_mul_consttime(s, s, kinv, dsa->method_mont_q, ctx)) {
+      goto err;
+    }
 
-  // Compute s = inv(k) (m + xr) mod q. Note |dsa->method_mont_q| is
-  // initialized by |dsa_sign_setup|.
-  if (!mod_mul_consttime(&xr, dsa->priv_key, r, dsa->method_mont_q, ctx) ||
-      !bn_mod_add_consttime(s, &xr, &m, dsa->q, ctx) ||
-      !mod_mul_consttime(s, s, kinv, dsa->method_mont_q, ctx)) {
-    goto err;
-  }
+    // The signature is computed from the private key, but is public.
+    bn_declassify(r);
+    bn_declassify(s);
 
-  // The signature is computed from the private key, but is public.
-  bn_declassify(r);
-  bn_declassify(s);
-
-  // Redo if r or s is zero as required by FIPS 186-3: this is
-  // very unlikely.
-  if (BN_is_zero(r) || BN_is_zero(s)) {
-    iters++;
-    if (iters > kMaxIterations) {
-      OPENSSL_PUT_ERROR(DSA, DSA_R_TOO_MANY_ITERATIONS);
-      goto err;
+    // Redo if r or s is zero as required by FIPS 186-3: this is
+    // very unlikely.
+    if (BN_is_zero(r) || BN_is_zero(s)) {
+      iters++;
+      if (iters > kMaxIterations) {
+        OPENSSL_PUT_ERROR(DSA, DSA_R_TOO_MANY_ITERATIONS);
+        goto err;
+      }
+      goto redo;
     }
-    goto redo;
-  }
 
-  ret = DSA_SIG_new();
-  if (ret == NULL) {
-    goto err;
+    ret = DSA_SIG_new();
+    if (ret == NULL) {
+      goto err;
+    }
+    ret->r = r;
+    ret->s = s;
   }
-  ret->r = r;
-  ret->s = s;
 
 err:
   if (ret == NULL) {
@@ -725,71 +675,73 @@ int DSA_do_check_signature(int *out_valid, const uint8_t *digest,
   BN_init(&u2);
   BN_init(&t1);
   BN_CTX *ctx = BN_CTX_new();
-  if (ctx == NULL) {
-    goto err;
-  }
+  {
+    if (ctx == NULL) {
+      goto err;
+    }
 
-  if (BN_is_zero(sig->r) || BN_is_negative(sig->r) ||
-      BN_ucmp(sig->r, dsa->q) >= 0) {
-    ret = 1;
-    goto err;
-  }
-  if (BN_is_zero(sig->s) || BN_is_negative(sig->s) ||
-      BN_ucmp(sig->s, dsa->q) >= 0) {
-    ret = 1;
-    goto err;
-  }
+    if (BN_is_zero(sig->r) || BN_is_negative(sig->r) ||
+        BN_ucmp(sig->r, dsa->q) >= 0) {
+      ret = 1;
+      goto err;
+    }
+    if (BN_is_zero(sig->s) || BN_is_negative(sig->s) ||
+        BN_ucmp(sig->s, dsa->q) >= 0) {
+      ret = 1;
+      goto err;
+    }
 
-  // Calculate W = inv(S) mod Q
-  // save W in u2
-  if (BN_mod_inverse(&u2, sig->s, dsa->q, ctx) == NULL) {
-    goto err;
-  }
+    // Calculate W = inv(S) mod Q
+    // save W in u2
+    if (BN_mod_inverse(&u2, sig->s, dsa->q, ctx) == NULL) {
+      goto err;
+    }
 
-  // save M in u1
-  unsigned q_bits = BN_num_bits(dsa->q);
-  if (digest_len > (q_bits >> 3)) {
-    // if the digest length is greater than the size of q use the
-    // BN_num_bits(dsa->q) leftmost bits of the digest, see
-    // fips 186-3, 4.2
-    digest_len = (q_bits >> 3);
-  }
+    // save M in u1
+    unsigned q_bits = BN_num_bits(dsa->q);
+    if (digest_len > (q_bits >> 3)) {
+      // if the digest length is greater than the size of q use the
+      // BN_num_bits(dsa->q) leftmost bits of the digest, see
+      // fips 186-3, 4.2
+      digest_len = (q_bits >> 3);
+    }
 
-  if (BN_bin2bn(digest, digest_len, &u1) == NULL) {
-    goto err;
-  }
+    if (BN_bin2bn(digest, digest_len, &u1) == NULL) {
+      goto err;
+    }
 
-  // u1 = M * w mod q
-  if (!BN_mod_mul(&u1, &u1, &u2, dsa->q, ctx)) {
-    goto err;
-  }
+    // u1 = M * w mod q
+    if (!BN_mod_mul(&u1, &u1, &u2, dsa->q, ctx)) {
+      goto err;
+    }
 
-  // u2 = r * w mod q
-  if (!BN_mod_mul(&u2, sig->r, &u2, dsa->q, ctx)) {
-    goto err;
-  }
+    // u2 = r * w mod q
+    if (!BN_mod_mul(&u2, sig->r, &u2, dsa->q, ctx)) {
+      goto err;
+    }
 
-  if (!BN_MONT_CTX_set_locked((BN_MONT_CTX **)&dsa->method_mont_p,
-                              (CRYPTO_MUTEX *)&dsa->method_mont_lock, dsa->p,
-                              ctx)) {
-    goto err;
-  }
+    if (!BN_MONT_CTX_set_locked((BN_MONT_CTX **)&dsa->method_mont_p,
+                                (CRYPTO_MUTEX *)&dsa->method_mont_lock, dsa->p,
+                                ctx)) {
+      goto err;
+    }
 
-  if (!BN_mod_exp2_mont(&t1, dsa->g, &u1, dsa->pub_key, &u2, dsa->p, ctx,
-                        dsa->method_mont_p)) {
-    goto err;
-  }
+    if (!BN_mod_exp2_mont(&t1, dsa->g, &u1, dsa->pub_key, &u2, dsa->p, ctx,
+                          dsa->method_mont_p)) {
+      goto err;
+    }
 
-  // BN_copy(&u1,&t1);
-  // let u1 = u1 mod q
-  if (!BN_mod(&u1, &t1, dsa->q, ctx)) {
-    goto err;
-  }
+    // BN_copy(&u1,&t1);
+    // let u1 = u1 mod q
+    if (!BN_mod(&u1, &t1, dsa->q, ctx)) {
+      goto err;
+    }
 
-  // V is now in u1.  If the signature is correct, it will be
-  // equal to R.
-  *out_valid = BN_ucmp(&u1, sig->r) == 0;
-  ret = 1;
+    // V is now in u1.  If the signature is correct, it will be
+    // equal to R.
+    *out_valid = BN_ucmp(&u1, sig->r) == 0;
+    ret = 1;
+  }
 
 err:
   if (ret != 1) {
@@ -835,23 +787,25 @@ int DSA_check_signature(int *out_valid, const uint8_t *digest,
   uint8_t *der = NULL;
 
   s = DSA_SIG_new();
-  if (s == NULL) {
-    goto err;
-  }
+  {
+    if (s == NULL) {
+      goto err;
+    }
 
-  const uint8_t *sigp = sig;
-  if (d2i_DSA_SIG(&s, &sigp, sig_len) == NULL || sigp != sig + sig_len) {
-    goto err;
-  }
+    const uint8_t *sigp = sig;
+    if (d2i_DSA_SIG(&s, &sigp, sig_len) == NULL || sigp != sig + sig_len) {
+      goto err;
+    }
 
-  // Ensure that the signature uses DER and doesn't have trailing garbage.
-  int der_len = i2d_DSA_SIG(s, &der);
-  if (der_len < 0 || (size_t)der_len != sig_len ||
-      OPENSSL_memcmp(sig, der, sig_len)) {
-    goto err;
-  }
+    // Ensure that the signature uses DER and doesn't have trailing garbage.
+    int der_len = i2d_DSA_SIG(s, &der);
+    if (der_len < 0 || (size_t)der_len != sig_len ||
+        OPENSSL_memcmp(sig, der, sig_len)) {
+      goto err;
+    }
 
-  ret = DSA_do_check_signature(out_valid, digest, digest_len, s, dsa);
+    ret = DSA_do_check_signature(out_valid, digest, digest_len, s, dsa);
+  }
 
 err:
   OPENSSL_free(der);

data/third_party/boringssl-with-bazel/src/crypto/dsa/{dsa_asn1.c → dsa_asn1.cc}

@@ -1,56 +1,16 @@
-/* Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL
- * project 2000. */
-/* ====================================================================
- * Copyright (c) 2000-2005 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    licensing@OpenSSL.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com). */
+// Copyright 1999-2016 The OpenSSL Project Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     https://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
 
 #include <openssl/dsa.h>
 

data/third_party/boringssl-with-bazel/src/crypto/dsa/internal.h

@@ -1,16 +1,16 @@
-/* Copyright (c) 2020, Google Inc.
- *
- * Permission to use, copy, modify, and/or distribute this software for any
- * purpose with or without fee is hereby granted, provided that the above
- * copyright notice and this permission notice appear in all copies.
- *
- * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
- * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
- * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
- * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
- * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
- * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
- * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */
+// Copyright 2020 The BoringSSL Authors
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     https://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
 
 #ifndef OPENSSL_HEADER_DSA_INTERNAL_H
 #define OPENSSL_HEADER_DSA_INTERNAL_H
@@ -42,8 +42,6 @@ struct dsa_st {
   CRYPTO_EX_DATA ex_data;
 };
 
-#define OPENSSL_DSA_MAX_MODULUS_BITS 10000
-
 // dsa_check_key performs cheap self-checks on |dsa|, and ensures it is within
 // DoS bounds. It returns one on success and zero on error.
 int dsa_check_key(const DSA *dsa);