## OpenJDK / jdk7 / jdk7 / jdk

### view src/share/native/sun/security/ec/impl/mpprime.h @ 3909:272483f6650b

Find changesets by keywords (author, files, the commit message), revision
number or hash, or revset expression.

7033660: Update copyright year to 2011 on any files changed in 2011
Reviewed-by: dholmes

author | ohair |
---|---|

date | Wed, 06 Apr 2011 22:06:11 -0700 |

parents | 1b5c838b8db8 |

children | b49a0af85821 |

line wrap: on

line source

/* ********************************************************************* * * Sun elects to have this file available under and governed by the * Mozilla Public License Version 1.1 ("MPL") (see * http://www.mozilla.org/MPL/ for full license text). For the avoidance * of doubt and subject to the following, Sun also elects to allow * licensees to use this file under the MPL, the GNU General Public * License version 2 only or the Lesser General Public License version * 2.1 only. Any references to the "GNU General Public License version 2 * or later" or "GPL" in the following shall be construed to mean the * GNU General Public License version 2 only. Any references to the "GNU * Lesser General Public License version 2.1 or later" or "LGPL" in the * following shall be construed to mean the GNU Lesser General Public * License version 2.1 only. However, the following notice accompanied * the original version of this file: * * * Utilities for finding and working with prime and pseudo-prime * integers * * Version: MPL 1.1/GPL 2.0/LGPL 2.1 * * The contents of this file are subject to the Mozilla Public License Version * 1.1 (the "License"); you may not use this file except in compliance with * the License. You may obtain a copy of the License at * http://www.mozilla.org/MPL/ * * Software distributed under the License is distributed on an "AS IS" basis, * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License * for the specific language governing rights and limitations under the * License. * * The Original Code is the MPI Arbitrary Precision Integer Arithmetic library. * * The Initial Developer of the Original Code is * Michael J. Fromberger. * Portions created by the Initial Developer are Copyright (C) 1997 * the Initial Developer. All Rights Reserved. * * Contributor(s): * * Alternatively, the contents of this file may be used under the terms of * either the GNU General Public License Version 2 or later (the "GPL"), or * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), * in which case the provisions of the GPL or the LGPL are applicable instead * of those above. If you wish to allow use of your version of this file only * under the terms of either the GPL or the LGPL, and not to allow others to * use your version of this file under the terms of the MPL, indicate your * decision by deleting the provisions above and replace them with the notice * and other provisions required by the GPL or the LGPL. If you do not delete * the provisions above, a recipient may use your version of this file under * the terms of any one of the MPL, the GPL or the LGPL. * *********************************************************************** */ /* * Copyright (c) 2007, 2011, Oracle and/or its affiliates. All rights reserved. * Use is subject to license terms. */ #ifndef _MP_PRIME_H #define _MP_PRIME_H #include "mpi.h" extern const int prime_tab_size; /* number of primes available */ extern const mp_digit prime_tab[]; /* Tests for divisibility */ mp_err mpp_divis(mp_int *a, mp_int *b); mp_err mpp_divis_d(mp_int *a, mp_digit d); /* Random selection */ mp_err mpp_random(mp_int *a); mp_err mpp_random_size(mp_int *a, mp_size prec); /* Pseudo-primality testing */ mp_err mpp_divis_vector(mp_int *a, const mp_digit *vec, int size, int *which); mp_err mpp_divis_primes(mp_int *a, mp_digit *np); mp_err mpp_fermat(mp_int *a, mp_digit w); mp_err mpp_fermat_list(mp_int *a, const mp_digit *primes, mp_size nPrimes); mp_err mpp_pprime(mp_int *a, int nt); mp_err mpp_sieve(mp_int *trial, const mp_digit *primes, mp_size nPrimes, unsigned char *sieve, mp_size nSieve); mp_err mpp_make_prime(mp_int *start, mp_size nBits, mp_size strong, unsigned long * nTries); #endif /* _MP_PRIME_H */