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

Diff for /OpenXM_contrib2/asir2000/engine/up.c between version 1.1.1.1 and 1.3

version 1.1.1.1, 1999/12/03 07:39:08 version 1.3, 2000/08/21 08:31:28
Line 1 
Line 1 
 /* $OpenXM: OpenXM/src/asir99/engine/up.c,v 1.1.1.1 1999/11/10 08:12:26 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@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/engine/up.c,v 1.2 1999/12/27 04:16:31 noro Exp $
   */
 #include "ca.h"  #include "ca.h"
 #include <math.h>  #include <math.h>
   
Line 1582  UP *r;
Line 1630  UP *r;
 }  }
 #endif  #endif
   
   /*
    * dbd == 0 => n1 * n2
    * dbd > 0  => n1 * n2 mod x^dbd
    * n1 == n2 => squaring
    * return: n1*n2 mod Primes[modind[0]]*.prime...*Primes[modind[nmod-1]].prime
    */
   
   void fft_mulup_specialmod_main(n1,n2,dbd,modind,nmod,nr)
   UP n1,n2;
   int dbd;
   int *modind;
   int nmod;
   UP *nr;
   {
           ModNum *f1,*f2,*w,*fr;
           ModNum **frarray,**fa;
           N m,m1,m2;
           unsigned int *modarray;
           int d1,d2,dmin,i,mod,root,d,cond,bound;
           UP r;
   
           if ( !n1 || !n2 ) {
                   *nr = 0; return;
           }
           d1 = n1->d; d2 = n2->d; dmin = MIN(d1,d2);
           if ( !d1 || !d2 ) {
                   mulup(n1,n2,nr); return;
           }
           m = ONEN;
           bound = maxblenup(n1)+maxblenup(n2)+int_bits(dmin)+1;
           f1 = (ModNum *)MALLOC_ATOMIC((d1+d2+1)*sizeof(ModNum));
           if ( n1 == n2 )
                   f2 = 0;
           else
                   f2 = (ModNum *)MALLOC_ATOMIC((d1+d2+1)*sizeof(ModNum));
           w = (ModNum *)MALLOC_ATOMIC(6*(1<<int_bits(d1+d2+1))*sizeof(ModNum));
           frarray = (ModNum **)MALLOC(nmod*sizeof(ModNum *));
           modarray = (unsigned int *)MALLOC_ATOMIC(nmod*sizeof(unsigned int *));
   
           for ( i = 0; i < nmod; i++ ) {
                   FFT_primes(modind[i],&modarray[i],&root,&d);
                           if ( (1<<d) < d1+d2+1 )
                                   error("fft_mulup_specialmod_main : invalid modulus");
                   frarray[i] = fr
                           = (ModNum *)MALLOC_ATOMIC((d1+d2+1)*sizeof(ModNum));
                   uptofmarray(modarray[i],n1,f1);
                   if ( !f2 )
                           cond = FFT_pol_square(d1,f1,fr,modind[i],w);
                   else {
                           uptofmarray(modarray[i],n2,f2);
                           cond = FFT_pol_product(d1,f1,d2,f2,fr,modind[i],w);
                   }
                   if ( cond )
                           error("fft_mulup_specialmod_main : error in FFT_pol_product");
                   STON(modarray[i],m1); muln(m,m1,&m2); m = m2;
           }
           if ( !dbd )
                   dbd = d1+d2+1;
           crup(frarray,MIN(d1+d2,dbd-1),modarray,nmod,m,nr);
   }
Legend:
Removed from v.1.1.1.1  
changed lines
  Added in v.1.3
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>