OpenXM_contrib2/asir2000/fft/polmul.c - diff

Return to polmul.c CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / fft

Diff for /OpenXM_contrib2/asir2000/fft/polmul.c between version 1.1.1.1 and 1.6

version 1.1.1.1, 1999/12/03 07:39:08

version 1.6, 2018/03/29 01:32:53

Line 1

/* $OpenXM: OpenXM/src/asir99/fft/polmul.c,v 1.1.1.1 1999/11/10 08:12:27 noro Exp $ */

* 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/polmul.c,v 1.5 2015/08/14 13:51:55 fujimoto Exp $

#include "dft.h"

extern struct PrimesS Primes[];

Line 106 double Pinv;

Line 154 double Pinv;

dft1 = wk, dft2 = &wk[n];

dftprod = &dft2[n];

powa = &dftprod[n];

true_wk = &powa[halfn]; /* 2*n areas */

/**/

C_PREP_ALPHA( a, low0s, log2n, halfn -1, powa, P, Pinv );

#ifdef TIMING

Line 156 double Pinv;

Line 204 double Pinv;

dft1 = wk, dft2 = &wk[n];

dftprod = &dft2[n];

powa = &dftprod[n];

true_wk = &powa[halfn]; /* 2*n areas */

/**/

C_PREP_ALPHA( a, low0s, log2n, halfn -1, powa, P, Pinv );

#ifdef TIMING

Line 230 char **argv;

Line 278 char **argv;

d = (d1 = atoi( av[0] )) + (d2 = atoi( av[1] ));

if ( d1 <= 0 || d2 <= 0 || d >= MaxNPnts ) {

fprintf( stderr, "*** invalid degrees %s & %s. (sum < %d)\n",

av[0], av[1], MaxNPnts );

continue;

}

generate_pol( d1, Pol1 );

Line 359 int *error;

Line 407 int *error;

for ( j = 1; j < 5 && i + j < n; j++ ) printf( ",%10d", (int)v1[i+j] );

printf( "\n" );

if ( (int)v1[i] == (int)v2[i] && (int)v1[i+1] == (int)v2[i+1]

&& (int)v1[i+2] == (int)v2[i+2] && (int)v1[i+3] == (int)v2[i+3]

&& (int)v1[i+4] == (int)v2[i+4] ) continue;

printf( " " );

for ( j = 0; j < 5 && i + j < n; j++ )

if ( (int)v1[i+j] == (int)v2[i+j] ) printf( " " );

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>