[BACK]Return to fft_primes.c CVS log [TXT][DIR] Up to [local] / OpenXM_contrib2 / asir2000 / fft

Diff for /OpenXM_contrib2/asir2000/fft/fft_primes.c between version 1.1 and 1.6

version 1.1, 1999/12/03 07:39:08 version 1.6, 2018/03/29 01:32:53
Line 1 
Line 1 
 /* $OpenXM: OpenXM/src/asir99/fft/fft_primes.c,v 1.1.1.1 1999/11/10 08:12:27 noro Exp $ */  /*
    * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
    * All rights reserved.
    *
    * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
    * non-exclusive and royalty-free license to use, copy, modify and
    * redistribute, solely for non-commercial and non-profit purposes, the
    * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
    * conditions of this Agreement. For the avoidance of doubt, you acquire
    * only a limited right to use the SOFTWARE hereunder, and FLL or any
    * third party developer retains all rights, including but not limited to
    * copyrights, in and to the SOFTWARE.
    *
    * (1) FLL does not grant you a license in any way for commercial
    * purposes. You may use the SOFTWARE only for non-commercial and
    * non-profit purposes only, such as academic, research and internal
    * business use.
    * (2) The SOFTWARE is protected by the Copyright Law of Japan and
    * international copyright treaties. If you make copies of the SOFTWARE,
    * with or without modification, as permitted hereunder, you shall affix
    * to all such copies of the SOFTWARE the above copyright notice.
    * (3) An explicit reference to this SOFTWARE and its copyright owner
    * shall be made on your publication or presentation in any form of the
    * results obtained by use of the SOFTWARE.
    * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
    * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
    * for such modification or the source code of the modified part of the
    * SOFTWARE.
    *
    * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
    * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
    * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
    * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
    * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
    * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
    * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
    * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
    * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
    * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
    * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
    * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
    * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
    * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
    * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
    * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
    * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
    *
    * $OpenXM: OpenXM_contrib2/asir2000/fft/fft_primes.c,v 1.5 2003/02/14 22:29:10 ohara Exp $
   */
 #include "dft.h"  #include "dft.h"
   
 struct PrimesS Primes[NPrimes+1] = {  struct PrimesS Primes[NPrimes+1] = {
 #if !USE_FLOAT  #if !defined(USE_FLOAT)
 {536813569,234750831,29,13},  {536813569,234750831,29,13},
 {536752129,402492685,29,12},  {536752129,402492685,29,12},
 {536743937,186329165,29,12},  {536743937,186329165,29,12},
Line 13706  static int blen_prod_fftprime[MAX_D+1] =
Line 13754  static int blen_prod_fftprime[MAX_D+1] =
           0 if not.            0 if not.
 */  */
   
 int fft_available(d1,n1,d2,n2)  int int_bits(int);
 int d1,n1,d2,n2;  
   int fft_available(int d1,int n1,int d2,int n2)
 {  {
         int dmin,bound,dlen;    int dmin,bound,dlen;
   
         dmin = d1>d2?d2:d1;    dmin = d1>d2?d2:d1;
         bound = n1+n2+int_bits(dmin)+1;    bound = n1+n2+int_bits(dmin)+1;
         dlen = int_bits(d1+d2);    dlen = int_bits(d1+d2);
         if ( dlen > MAX_D )    if ( dlen > MAX_D )
                 return 0;      return 0;
         else if ( blen_prod_fftprime[dlen] <= bound )    else if ( blen_prod_fftprime[dlen] <= bound )
                 return 0;      return 0;
         else    else
                 return 1;      return 1;
 }  }
   
 void get_fft_prime(int index,int *p,int *d)  void get_fft_prime(int index,int *p,int *d)
 {  {
         if ( index < 0 || index >= NPrimes ) {    if ( index < 0 || index >= NPrimes ) {
                 *p = 0; *d = 0;      *p = 0; *d = 0;
         } else {    } else {
                 *p = Primes[index].prime; *d = Primes[index].d;      *p = Primes[index].prime; *d = Primes[index].d;
         }    }
 }  }
Legend:
Removed from v.1.1  
changed lines
  Added in v.1.6
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>