| version 1.2, 2000/08/21 08:31:28 |
version 1.8, 2015/08/14 13:51:55 |
|
|
| * shall be made on your publication or presentation in any form of the |
* shall be made on your publication or presentation in any form of the |
| * results obtained by use of the SOFTWARE. |
* results obtained by use of the SOFTWARE. |
| * (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
* (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 |
* 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 |
* for such modification or the source code of the modified part of the |
| * SOFTWARE. |
* SOFTWARE. |
| * |
* |
|
|
| * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
| * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
| * |
* |
| * $OpenXM: OpenXM_contrib2/asir2000/engine/up_gfpn.c,v 1.1.1.1 1999/12/03 07:39:08 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/engine/up_gfpn.c,v 1.7 2015/08/08 14:19:41 fujimoto Exp $ |
| */ |
*/ |
| #include "ca.h" |
#include "ca.h" |
| #include <math.h> |
#include <math.h> |
|
|
| k[j] += c2*f[i][j]; |
k[j] += c2*f[i][j]; |
| } |
} |
| uiarraytoup(sum,len,d,&s); |
uiarraytoup(sum,len,d,&s); |
| GC_free(sum_b); |
GCFREE(sum_b); |
| |
|
| u = UPALLOC(d); |
u = UPALLOC(d); |
| for ( j = 0; j <= d; j++ ) { |
for ( j = 0; j <= d; j++ ) { |
| #if 1 |
#if 1 |
| a = (UL)floor(k[j]); |
a = (UL)floor(k[j]); |
| #if defined(i386) || defined(__alpha) || defined(VISUAL) |
#if defined(i386) || defined(__alpha) || defined(VISUAL) || defined(__MINGW32__) || defined(__x86_64) |
| au = ((unsigned int *)&a)[1]; |
au = ((unsigned int *)&a)[1]; |
| al = ((unsigned int *)&a)[0]; |
al = ((unsigned int *)&a)[0]; |
| #else |
#else |
|
|
| invmodup(t,f->d,&invf); |
invmodup(t,f->d,&invf); |
| |
|
| for ( i = 2; i < d; i++ ) { |
for ( i = 2; i < d; i++ ) { |
| if ( debug_up ) |
if ( debug_up ){ |
| fprintf(stderr,"."); |
fprintf(stderr,"."); |
| hybrid_mulup(FF_GFP,tab[i-1],xp,&t); |
} |
| hybrid_rembymulup_special(FF_GFP,t,f,invf,&tab[i]); |
hybrid_mulup(FF_GFP,tab[i-1],xp,&t); |
| |
hybrid_rembymulup_special(FF_GFP,t,f,invf,&tab[i]); |
| } |
} |
| } |
} |
| |
|
|
|
| invmodup(t,f->d,&invf); |
invmodup(t,f->d,&invf); |
| |
|
| for ( i = 2; i < d; i++ ) { |
for ( i = 2; i < d; i++ ) { |
| if ( debug_up ) |
if ( debug_up ){ |
| fprintf(stderr,"."); |
fprintf(stderr,"."); |
| kmulup(tab[i-1],xp,&t); |
} |
| rembymulup_special(t,f,invf,&tab[i]); |
kmulup(tab[i-1],xp,&t); |
| |
rembymulup_special(t,f,invf,&tab[i]); |
| } |
} |
| } |
} |