mathe能否提供更新的windows版gmp库

〇〇

我下载了你的4.2和4.21.. 现在4.32和5.01出来了

〇〇

D:\lt\dl>vc6\setvar D:\lt\dl>set MSVCDir=d:\lt\dl\vc6 D:\lt\dl>set INCLUDE=d:\lt\dl\vc6\ATL\INCLUDE;d:\lt\dl\vc6\INCLUDE;d:\lt\dl\vc6\MFC\INCLUDE; D:\lt\dl>set LIB=d:\lt\dl\vc6\LIB;d:\lt\dl\vc6\MFC\LIB; D:\lt\dl>set PATH=d:\lt\dl\vc6\BIN;D:\Oracle\ora92\bin;D:\Oracle\jre\1.3.1\bin;D:\Oracle\jre\1.1.8\bin;C:\WINDOWS\system32;C:\WINDOWS;C:\WIN DOWS\System32\Wbem;C:\Program Files\Intel\Wireless\Bin\;C:\Program Files\Diskeeper Corporation\Diskeeper\;C:\Program Files\ThinkPad\ConnectU tilities;C:\Program Files\Common Files\Lenovo;C:\Program Files\Lenovo\Client Security Solution D:\lt\dl>set include=D:\lt\dl\gmp421\include;%include% D:\lt\dl>set lib=D:\lt\dl\gmp421\lib\Win32\Release;%lib% D:\lt\dl>cd gmp421 D:\lt\dl\gmp421>cl gmp-chudnovsky.c /link D:\lt\dl\gmp421\lib\Win32\Release\gmp.lib Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 12.00.8168 for 80x86 Copyright (C) Microsoft Corp 1984-1998. All rights reserved. gmp-chudnovsky.c Microsoft (R) Incremental Linker Version 6.00.8168 Copyright (C) Microsoft Corp 1992-1998. All rights reserved. /out:gmp-chudnovsky.exe D:\lt\dl\gmp421\lib\Win32\Release\gmp.lib gmp-chudnovsky.obj LINK : warning LNK4098: defaultlib "LIBCMT" conflicts with use of other libs; use /NODEFAULTLIB:library gmp.lib(out_str.obj) : error LNK2001: unresolved external symbol ___iob_func gmp.lib(memory.obj) : error LNK2001: unresolved external symbol ___iob_func gmp.lib(assert.obj) : error LNK2001: unresolved external symbol ___iob_func gmp.lib(get_str.obj) : error LNK2001: unresolved external symbol __ftol2_sse gmp.lib(get_str.obj) : error LNK2001: unresolved external symbol ___security_cookie gmp.lib(get_str.obj) : error LNK2001: unresolved external symbol @__security_check_cookie@4 gmp-chudnovsky.exe : fatal error LNK1120: 4 unresolved externals

〇〇

D:\lt\dl\gmp421>cl gmp-chudnovsky.c /link D:\lt\dl\gmp421\dll\Win32\Release\gmp.lib Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 12.00.8168 for 80x86 Copyright (C) Microsoft Corp 1984-1998. All rights reserved. gmp-chudnovsky.c Microsoft (R) Incremental Linker Version 6.00.8168 Copyright (C) Microsoft Corp 1992-1998. All rights reserved. /out:gmp-chudnovsky.exe D:\lt\dl\gmp421\dll\Win32\Release\gmp.lib gmp-chudnovsky.obj D:\lt\dl\gmp421>gmp-chudnovsky.exe #terms=7, depth=4 sieve time = 0.000 ....... bs time = 0.000 gcd time = 0.000 div time = 0.000 sqrt time = 0.000 mul time = 0.000 total time = 0.000 P size=124 digits (1.240000) Q size=117 digits (1.170000) D:\lt\dl\gmp421>gmp-chudnovsky 2 #terms=0, depth=2 sieve time = 0.015 bs time = 0.000 gcd time = 0.000 div 然后非法操作了

〇〇

gmp-chudnovsky 1000 11 .... p(65,70)=3^13 5^16 7 11^3 17^2 23^17 29^15 67^3 19 79 131 397 401 p(61,70)=3^26 5^28 7^3 11^3 13^2 17^2 23^29 29^26 31^3 67^3 3 5 7 11 41 43 53 127 367 373 379 383 389 p(53,70)=3^54 5^53 7^5 11^5 13^2 17^2 19^2 23^52 29^52 31^3 59^3 61^3 67^3 5 7^4 11^3 13^2 17^2 19^2 31 37 47 67 71 73 107 109 113 331 337 347 349 353 359 p(36,70)=3^98 5^107 7^12 11^7 13^6 17^3 19^5 23^104 29^103 31^3 37^3 41^3 43^3 47^3 53^3 59^3 61^3 67^3 3^2 5^3 7^7 11^3 13^2 17^2 19^2 29 31^2 37 41 43 47 53 59 61 73 79 83 89 97 101 103 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 p(0,70)=3^204 5^217 7^23 11^12 13^10 17^7 19^8 23^212 29^210 31^6 37^3 41^3 43^3 47^3 53^3 59^3 61^3 67^3 5^5 7^13 11^7 13^7 17^4 19^6 23^2 31^3 37^3 41^3 43^3 47^2 53^2 59^2 61^2 67^2 71^2 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 51 157 163 167 173 179 181 191 193 197 199 211 bs time = 0.453 gcd time = 0.000 div time = 0.000 sqrt time = 0.000 mul time = 0.000 total time = 0.453 P size=1334 digits (1.334000) Q size=1327 digits (1.327000) pi(0,70)=

〇〇

another code

2. /*
3. Hi again!
4. Here is a simple recursive parallel gmp-chudnovsky program using Cilk or Cilk++.
6. The Cilk/Cilk++ compiler is based on GNU C, with a few extra keywords to control
7. parallelism and works with the normal GNU GMP library. Using Cilk/Cilk++
8. instead of C with Pthreads or OpenMP makes recursive divide-and-conquer code
9. easier to implement, debug (see cilkscreen), and maybe faster.
10. More information about Cilk is at http://en.wikipedia.org/wiki/Cilk.
12. Also, this simple version of gmp-chudnovsky has the factorization performance
13. enhancement removed for readability, so running with one core will not be as
14. fast as the Hanhong Xue's original version.
16. Enjoy,
17. David Carver
18. */
20. /* Pi computation using Chudnovsky's algortithm.
22. * Copyright 2002,2005 Hanhong Xue (macroxue at yahoo dot com)
24. * Slightly modified 2005 by Torbjorn Granlund to allow more than 2G
25. digits to be computed.
27. * Modified 2010 by David Carver (dcarver at tacc dot utexas dot edu) to
28. demonstrate a parallel and fully recursive version of the gmp-chudnovsky
29. program, using cilk/cilk++.
31. To compile with GMP:
32. cilk++ -Wall -O2 -o pgmp-chudnovsky pgmp-chudnovsky.cilk -lgmp -lm -lmiser
34. To run:
35. ./pgmp-chudnovsky 1000 1
37. or add the Cilk++ option "-cilk_set_worker_count=" to specify the number
38. of workers (hardware threads used).
40. ./pgmp-chudnovsky 1000 1 -cilk_set_worker_count=1
42. To get help run the program with no options:
43. ./pgmp-chudnovsky
45. Syntax: ./pgmp-chudnovsky.cilk.bin <digits> <option>
46. <digits> digits of pi to output
47. <option> 0 - just run (default)
48. 1 - output decimal digits to stdout
50. * Redistribution and use in source and binary forms,with or without
51. * modification,are permitted provided that the following conditions are met:
52. * 1. Redistributions of source code must retain the above copyright notice,
53. * this list of conditions and the following disclaimer.
54. * 2. Redistributions in binary form must reproduce the above copyright notice,
55. * this list of conditions and the following disclaimer in the documentation
56. * and/or other materials provided with the distribution.
57. *
58. * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
59. * IMPLIED WARRANTIES,INCLUDING,BUT NOT LIMITED TO,THE IMPLIED WARRANTIES OF
60. * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
61. * EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT,INDIRECT,INCIDENTAL,
62. * SPECIAL,EXEMPLARY,OR CONSEQUENTIAL DAMAGES (INCLUDING,BUT NOT LIMITED TO,
63. * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,DATA,OR PROFITS;
64. * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
65. * WHETHER IN CONTRACT,STRICT LIABILITY,OR TORT (INCLUDING NEGLIGENCE OR
66. * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,EVEN IF
67. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
68. */
70. #include <assert.h>
71. #include <math.h>
72. #include <stdio.h>
73. #include <stdlib.h>
74. #include <string.h>
75. #include <time.h>
76. #include <sys/time.h>
77. #include <gmp.h>
78. #include <cilk.h>
80. #define A 13591409
81. #define B 545140134
82. #define C 640320
83. #define D 12
85. #define BITS_PER_DIGIT 3.32192809488736234787
86. #define DIGITS_PER_ITER 14.1816474627254776555
87. #define DOUBLE_PREC 53
89. ////////////////////////////////////////////////////////////////////////////
91. double wall_clock()
92. {
93. struct timeval timeval;
94. (void) gettimeofday (&timeval,NULL);
95. return (timeval.tv_sec + (timeval.tv_usec / 1000000.0));
96. }
98. ////////////////////////////////////////////////////////////////////////////
100. /* binary splitting */
101. void
102. bs(unsigned long a,unsigned long b,unsigned gflag,mpz_t pstack1,mpz_t qstack1,
103. mpz_t gstack1)
104. {
105. unsigned long mid;
106. mpz_t pstack2,qstack2,gstack2;
108. if (b-a==1) {
110. /*
111. g(b-1,b) = (6b-5)(2b-1)(6b-1)
112. p(b-1,b) = b^3 * C^3 / 24
113. q(b-1,b) = (-1)^b*g(b-1,b)*(A+Bb).
114. */
116. mpz_set_ui(pstack1,b);
117. mpz_mul_ui(pstack1,pstack1,b);
118. mpz_mul_ui(pstack1,pstack1,b);
119. mpz_mul_ui(pstack1,pstack1,(C/24)*(C/24));
120. mpz_mul_ui(pstack1,pstack1,C*24);
122. mpz_set_ui(gstack1,2*b-1);
123. mpz_mul_ui(gstack1,gstack1,6*b-1);
124. mpz_mul_ui(gstack1,gstack1,6*b-5);
126. mpz_set_ui(qstack1,b);
127. mpz_mul_ui(qstack1,qstack1,B);
128. mpz_add_ui(qstack1,qstack1,A);
129. mpz_mul (qstack1,qstack1,gstack1);
130. if (b%2)
131. mpz_neg(qstack1,qstack1);
133. } else {
135. /*
136. p(a,b) = p(a,m) * p(m,b)
137. g(a,b) = g(a,m) * g(m,b)
138. q(a,b) = q(a,m) * p(m,b) + q(m,b) * g(a,m)
139. */
141. mid = a+(b-a)*0.5224; /* tuning parameter */
143. mpz_init(pstack2);
144. mpz_init(qstack2);
145. mpz_init(gstack2);
147. cilk_spawn bs(mid,b,gflag,pstack2,qstack2,gstack2);
148. bs(a,mid,1,pstack1,qstack1,gstack1);
149. cilk_sync;
151. mpz_mul(pstack1,pstack1,pstack2);
152. mpz_mul(qstack1,qstack1,pstack2);
153. mpz_mul(qstack2,qstack2,gstack1);
154. mpz_add(qstack1,qstack1,qstack2);
156. if (gflag) {
157. mpz_mul(gstack1,gstack1,gstack2);
158. }
160. mpz_clear(pstack2);
161. mpz_clear(qstack2);
162. mpz_clear(gstack2);
163. }
164. }
166. int
167. cilk_main(int argc,char *argv[])
168. {
169. mpf_t pi,qi;
170. mpz_t pstack,qstack,gstack;
171. long int d=100,out=0,terms;
172. unsigned long psize,qsize;
173. char *prog_name;
174. clock_t begin,end;
175. double wbegin,wend;
177. prog_name = argv[0];
179. if (argc==1) {
180. fprintf(stderr,"\nSyntax: %s <digits> <option>\n",prog_name);
181. fprintf(stderr," <digits> digits of pi to output\n");
182. fprintf(stderr," <option> 0 - just run (default)\n");
183. fprintf(stderr," 1 - output decimal digits to stdout\n");
184. exit(1);
185. }
186. if (argc>1)
187. d = strtoul(argv[1],0,0);
188. if (argc>2)
189. out = atoi(argv[2]);
191. terms = d/DIGITS_PER_ITER;
193. fprintf(stderr,"#terms=%ld workers=%d\n",terms,cilk::current_worker_count());
195. begin = clock();
196. wbegin = wall_clock();
198. mpz_init(pstack);
199. mpz_init(qstack);
200. mpz_init(gstack);
202. /* begin binary splitting process */
204. if (terms<=0) {
205. mpz_set_ui(pstack,1);
206. mpz_set_ui(qstack,0);
207. mpz_set_ui(gstack,1);
208. } else {
209. bs(0,terms,0,pstack,qstack,gstack);
210. }
212. end = clock();
213. wend = wall_clock();
214. fprintf(stderr,"bs cputime = %6.3f wallclock = %6.3f\n",
215. (double)(end-begin)/CLOCKS_PER_SEC,(wend-wbegin));
216. fflush(stderr);
218. mpz_clear(gstack);
220. /* prepare to convert integers to floats */
222. mpf_set_default_prec((long int)(d*BITS_PER_DIGIT+16));
224. /*
225. p*(C/D)*sqrt(C)
226. pi = -----------------
227. (q+A*p)
228. */
230. psize = mpz_sizeinbase(pstack,10);
231. qsize = mpz_sizeinbase(qstack,10);
233. mpz_addmul_ui(qstack,pstack,A);
234. mpz_mul_ui(pstack,pstack,C/D);
236. mpf_init(pi);
237. mpf_set_z(pi,pstack);
238. mpz_clear(pstack);
240. mpf_init(qi);
241. mpf_set_z(qi,qstack);
242. mpz_clear(qstack);
244. /* final step */
246. mpf_div(qi,pi,qi);
247. mpf_sqrt_ui(pi,C);
248. mpf_mul(qi,qi,pi);
250. end = clock();
251. wend = wall_clock();
253. /* output Pi and timing statistics */
255. fprintf(stderr,"total cputime = %6.3f wallclock = %6.3f\n",
256. (double)(end-begin)/CLOCKS_PER_SEC,(wend-wbegin));
257. fflush(stderr);
259. printf(" P size=%ld digits (%f)\n"
260. " Q size=%ld digits (%f)\n",
261. psize,(double)psize/d,qsize,(double)qsize/d);
263. if (out&1) {
264. printf("pi(0,%ld)=\n",terms);
265. mpf_out_str(stdout,10,d+2,qi);
266. printf("\n");
267. }
269. /* free float resources */
271. mpf_clear(pi);
272. mpf_clear(qi);
274. exit (0);
275. }

复制代码

wayne

我也很想得到gmp5.0.1的VC版

无心人

你们为啥都想要lib呢？？ 不修改代码，gmp不可能用VC静态编译

mathe

我基本都在Linux下用gmp.以前那个vc可以使用的版本不是我自己编译的，是从网络上找到的

wayne

7# 无心人 因为得不到，所以更想得到。 至于OO出于什么理由，我就不知道了 ，呵呵

〇〇

我用msys+mingw编了1个dll,但没有.h也没有.lib没法用