riscv-gnu-toolchain/gcc.git - Unnamed repository; edit this file 'description' to name the repository.

diff options

author	Andi Kleen <ak@linux.intel.com>	2011-09-29 13:15:13 +0000
committer	Andi Kleen <ak@gcc.gnu.org>	2011-09-29 13:15:13 +0000
commit	35f2a89d8ec65fe11c37f1c681f465229bc852e3 (patch)
tree	036cb4380d2a3505ae1768b759e006e030596b0d /libjava/classpath/java/net/InetSocketAddress.java
parent	dde8b3609b40a5e9073a7638d492b8c29af2e24c (diff)
download	gcc-35f2a89d8ec65fe11c37f1c681f465229bc852e3.zip gcc-35f2a89d8ec65fe11c37f1c681f465229bc852e3.tar.gz gcc-35f2a89d8ec65fe11c37f1c681f465229bc852e3.tar.bz2

Use urandom to get random seed

When available use /dev/urandom to get the random seem. This will lower the probability of collisions. On other systems it will fallback to the old methods. Passes bootstrap + testsuite on x86_64. Ok? gcc/: 2011-09-26 Andi Kleen <ak@linux.intel.com> * toplev.c (init_local_tick): Try reading random seed from /dev/urandom From-SVN: r179348

Diffstat (limited to 'libjava/classpath/java/net/InetSocketAddress.java')

0 files changed, 0 insertions, 0 deletions

/* * Copyright 2001-2021 The OpenSSL Project Authors. All Rights Reserved. * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved * * Licensed under the Apache License 2.0 (the "License"). You may not use * this file except in compliance with the License. You can obtain a copy * in the file LICENSE in the source distribution or at * https://www.openssl.org/source/license.html */ #include <stdlib.h> #include <openssl/obj_mac.h> #include <openssl/ec.h> #include <openssl/bn.h> #include "internal/refcount.h" #include "crypto/ec.h" #if defined(__SUNPRO_C) # if __SUNPRO_C >= 0x520 # pragma error_messages (off,E_ARRAY_OF_INCOMPLETE_NONAME,E_ARRAY_OF_INCOMPLETE) # endif #endif /* Use default functions for poin2oct, oct2point and compressed coordinates */ #define EC_FLAGS_DEFAULT_OCT 0x1 /* Use custom formats for EC_GROUP, EC_POINT and EC_KEY */ #define EC_FLAGS_CUSTOM_CURVE 0x2 /* Curve does not support signing operations */ #define EC_FLAGS_NO_SIGN 0x4 #ifdef OPENSSL_NO_DEPRECATED_3_0 typedef struct ec_method_st EC_METHOD; #endif /* * Structure details are not part of the exported interface, so all this may * change in future versions. */ struct ec_method_st { /* Various method flags */ int flags; /* used by EC_METHOD_get_field_type: */ int field_type; /* a NID */ /* * used by EC_GROUP_new, EC_GROUP_free, EC_GROUP_clear_free, * EC_GROUP_copy: */ int (*group_init) (EC_GROUP *); void (*group_finish) (EC_GROUP *); void (*group_clear_finish) (EC_GROUP *); int (*group_copy) (EC_GROUP *, const EC_GROUP *); /* used by EC_GROUP_set_curve, EC_GROUP_get_curve: */ int (*group_set_curve) (EC_GROUP *, const BIGNUM *p, const BIGNUM *a, const BIGNUM *b, BN_CTX *); int (*group_get_curve) (const EC_GROUP *, BIGNUM *p, BIGNUM *a, BIGNUM *b, BN_CTX *); /* used by EC_GROUP_get_degree: */ int (*group_get_degree) (const EC_GROUP *); int (*group_order_bits) (const EC_GROUP *); /* used by EC_GROUP_check: */ int (*group_check_discriminant) (const EC_GROUP *, BN_CTX *); /* * used by EC_POINT_new, EC_POINT_free, EC_POINT_clear_free, * EC_POINT_copy: */ int (*point_init) (EC_POINT *); void (*point_finish) (EC_POINT *); void (*point_clear_finish) (EC_POINT *); int (*point_copy) (EC_POINT *, const EC_POINT *); /*- * used by EC_POINT_set_to_infinity, * EC_POINT_set_Jprojective_coordinates_GFp, * EC_POINT_get_Jprojective_coordinates_GFp, * EC_POINT_set_affine_coordinates, * EC_POINT_get_affine_coordinates, * EC_POINT_set_compressed_coordinates: */ int (*point_set_to_infinity) (const EC_GROUP *, EC_POINT *); int (*point_set_affine_coordinates) (const EC_GROUP *, EC_POINT *, const BIGNUM *x, const BIGNUM *y, BN_CTX *); int (*point_get_affine_coordinates) (const EC_GROUP *, const EC_POINT *, BIGNUM *x, BIGNUM *y, BN_CTX *); int (*point_set_compressed_coordinates) (const EC_GROUP *, EC_POINT *, const BIGNUM *x, int y_bit, BN_CTX *); /* used by EC_POINT_point2oct, EC_POINT_oct2point: */ size_t (*point2oct) (const EC_GROUP *, const EC_POINT *, point_conversion_form_t form, unsigned char *buf, size_t len, BN_CTX *); int (*oct2point) (const EC_GROUP *, EC_POINT *, const unsigned char *buf, size_t len, BN_CTX *); /* used by EC_POINT_add, EC_POINT_dbl, ECP_POINT_invert: */ int (*add) (const EC_GROUP *, EC_POINT *r, const EC_POINT *a, const EC_POINT *b, BN_CTX *); int (*dbl) (const EC_GROUP *, EC_POINT *r, const EC_POINT *a, BN_CTX *); int (*invert) (const EC_GROUP *, EC_POINT *, BN_CTX *); /* * used by EC_POINT_is_at_infinity, EC_POINT_is_on_curve, EC_POINT_cmp: */ int (*is_at_infinity) (const EC_GROUP *, const EC_POINT *); int (*is_on_curve) (const EC_GROUP *, const EC_POINT *, BN_CTX *); int (*point_cmp) (const EC_GROUP *, const EC_POINT *a, const EC_POINT *b, BN_CTX *); /* used by EC_POINT_make_affine, EC_POINTs_make_affine: */ int (*make_affine) (const EC_GROUP *, EC_POINT *, BN_CTX *); int (*points_make_affine) (const EC_GROUP *, size_t num, EC_POINT *[], BN_CTX *); /* * used by EC_POINTs_mul, EC_POINT_mul, EC_POINT_precompute_mult, * EC_POINT_have_precompute_mult (default implementations are used if the * 'mul' pointer is 0): */ /*- * mul() calculates the value * * r := generator * scalar * + points[0] * scalars[0] * + ... * + points[num-1] * scalars[num-1]. * * For a fixed point multiplication (scalar != NULL, num == 0) * or a variable point multiplication (scalar == NULL, num == 1), * mul() must use a constant time algorithm: in both cases callers * should provide an input scalar (either scalar or scalars[0]) * in the range [0, ec_group_order); for robustness, implementers * should handle the case when the scalar has not been reduced, but * may treat it as an unusual input, without any constant-timeness * guarantee. */ int (*mul) (const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar, size_t num, const EC_POINT *points[], const BIGNUM *scalars[], BN_CTX *); int (*precompute_mult) (EC_GROUP *group, BN_CTX *); int (*have_precompute_mult) (const EC_GROUP *group); /* internal functions */ /* * 'field_mul', 'field_sqr', and 'field_div' can be used by 'add' and * 'dbl' so that the same implementations of point operations can be used * with different optimized implementations of expensive field * operations: */ int (*field_mul) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *); int (*field_sqr) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a, BN_CTX *); int (*field_div) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *); /*- * 'field_inv' computes the multiplicative inverse of a in the field, * storing the result in r. * * If 'a' is zero (or equivalent), you'll get an EC_R_CANNOT_INVERT error. */ int (*field_inv) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a, BN_CTX *); /* e.g. to Montgomery */ int (*field_encode) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a, BN_CTX *); /* e.g. from Montgomery */ int (*field_decode) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a, BN_CTX *); int (*field_set_to_one) (const EC_GROUP *, BIGNUM *r, BN_CTX *); /* private key operations */ size_t (*priv2oct)(const EC_KEY *eckey, unsigned char *buf, size_t len); int (*oct2priv)(EC_KEY *eckey, const unsigned char *buf, size_t len); int (*set_private)(EC_KEY *eckey, const BIGNUM *priv_key); int (*keygen)(EC_KEY *eckey); int (*keycheck)(const EC_KEY *eckey); int (*keygenpub)(EC_KEY *eckey); int (*keycopy)(EC_KEY *dst, const EC_KEY *src); void (*keyfinish)(EC_KEY *eckey); /* custom ECDH operation */ int (*ecdh_compute_key)(unsigned char **pout, size_t *poutlen, const EC_POINT *pub_key, const EC_KEY *ecdh); /* custom ECDSA */ int (*ecdsa_sign_setup)(EC_KEY *eckey, BN_CTX *ctx, BIGNUM **kinvp, BIGNUM **rp); ECDSA_SIG *(*ecdsa_sign_sig)(const unsigned char *dgst, int dgstlen, const BIGNUM *kinv, const BIGNUM *r, EC_KEY *eckey); int (*ecdsa_verify_sig)(const unsigned char *dgst, int dgstlen, const ECDSA_SIG *sig, EC_KEY *eckey); /* Inverse modulo order */ int (*field_inverse_mod_ord)(const EC_GROUP *, BIGNUM *r, const BIGNUM *x, BN_CTX *); int (*blind_coordinates)(const EC_GROUP *group, EC_POINT *p, BN_CTX *ctx); int (*ladder_pre)(const EC_GROUP *group, EC_POINT *r, EC_POINT *s, EC_POINT *p, BN_CTX *ctx); int (*ladder_step)(const EC_GROUP *group, EC_POINT *r, EC_POINT *s, EC_POINT *p, BN_CTX *ctx); int (*ladder_post)(const EC_GROUP *group, EC_POINT *r, EC_POINT *s, EC_POINT *p, BN_CTX *ctx); }; /* * Types and functions to manipulate pre-computed values. */ typedef struct nistp224_pre_comp_st NISTP224_PRE_COMP; typedef struct nistp256_pre_comp_st NISTP256_PRE_COMP; typedef struct nistp521_pre_comp_st NISTP521_PRE_COMP; typedef struct nistz256_pre_comp_st NISTZ256_PRE_COMP; typedef struct ec_pre_comp_st EC_PRE_COMP; struct ec_group_st { const EC_METHOD *meth; EC_POINT *generator; /* optional */ BIGNUM *order, *cofactor; int curve_name; /* optional NID for named curve */ int asn1_flag; /* flag to control the asn1 encoding */ int decoded_from_explicit_params; /* set if decoded from explicit * curve parameters encoding */ point_conversion_form_t asn1_form; unsigned char *seed; /* optional seed for parameters (appears in * ASN1) */ size_t seed_len; /* * The following members are handled by the method functions, even if * they appear generic */ /* * Field specification. For curves over GF(p), this is the modulus; for * curves over GF(2^m), this is the irreducible polynomial defining the * field. */ BIGNUM *field; /* * Field specification for curves over GF(2^m). The irreducible f(t) is * then of the form: t^poly[0] + t^poly[1] + ... + t^poly[k] where m = * poly[0] > poly[1] > ... > poly[k] = 0. The array is terminated with * poly[k+1]=-1. All elliptic curve irreducibles have at most 5 non-zero * terms. */ int poly[6]; /* * Curve coefficients. (Here the assumption is that BIGNUMs can be used * or abused for all kinds of fields, not just GF(p).) For characteristic * > 3, the curve is defined by a Weierstrass equation of the form y^2 = * x^3 + a*x + b. For characteristic 2, the curve is defined by an * equation of the form y^2 + x*y = x^3 + a*x^2 + b. */ BIGNUM *a, *b; /* enable optimized point arithmetics for special case */ int a_is_minus3; /* method-specific (e.g., Montgomery structure) */


context:
space:
mode: