Parent Directory | Revision Log

Revision **25** -
(**hide annotations**)
(**download**)

*Sat Oct 8 06:43:03 2016 UTC*
(8 years, 1 month ago)
by *dashley*

Original Path:*sf_code/esrgpcpj/shared/c_datd/gmp_ints.h*

File MIME type: text/plain

File size: 78633 byte(s)

Original Path:

File MIME type: text/plain

File size: 78633 byte(s)

Initial commit.

1 | dashley | 25 | // $Header: /cvsroot/esrg/sfesrg/esrgpcpj/shared/c_datd/gmp_ints.h,v 1.23 2001/08/16 19:49:40 dtashley Exp $ |

2 | |||

3 | //-------------------------------------------------------------------------------- | ||

4 | //Copyright 2001 David T. Ashley | ||

5 | //------------------------------------------------------------------------------------------------- | ||

6 | //This source code and any program in which it is compiled/used is provided under the GNU GENERAL | ||

7 | //PUBLIC LICENSE, Version 3, full license text below. | ||

8 | //------------------------------------------------------------------------------------------------- | ||

9 | // GNU GENERAL PUBLIC LICENSE | ||

10 | // Version 3, 29 June 2007 | ||

11 | // | ||

12 | // Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/> | ||

13 | // Everyone is permitted to copy and distribute verbatim copies | ||

14 | // of this license document, but changing it is not allowed. | ||

15 | // | ||

16 | // Preamble | ||

17 | // | ||

18 | // The GNU General Public License is a free, copyleft license for | ||

19 | //software and other kinds of works. | ||

20 | // | ||

21 | // The licenses for most software and other practical works are designed | ||

22 | //to take away your freedom to share and change the works. By contrast, | ||

23 | //the GNU General Public License is intended to guarantee your freedom to | ||

24 | //share and change all versions of a program--to make sure it remains free | ||

25 | //software for all its users. We, the Free Software Foundation, use the | ||

26 | //GNU General Public License for most of our software; it applies also to | ||

27 | //any other work released this way by its authors. You can apply it to | ||

28 | //your programs, too. | ||

29 | // | ||

30 | // When we speak of free software, we are referring to freedom, not | ||

31 | //price. Our General Public Licenses are designed to make sure that you | ||

32 | //have the freedom to distribute copies of free software (and charge for | ||

33 | //them if you wish), that you receive source code or can get it if you | ||

34 | //want it, that you can change the software or use pieces of it in new | ||

35 | //free programs, and that you know you can do these things. | ||

36 | // | ||

37 | // To protect your rights, we need to prevent others from denying you | ||

38 | //these rights or asking you to surrender the rights. Therefore, you have | ||

39 | //certain responsibilities if you distribute copies of the software, or if | ||

40 | //you modify it: responsibilities to respect the freedom of others. | ||

41 | // | ||

42 | // For example, if you distribute copies of such a program, whether | ||

43 | //gratis or for a fee, you must pass on to the recipients the same | ||

44 | //freedoms that you received. You must make sure that they, too, receive | ||

45 | //or can get the source code. And you must show them these terms so they | ||

46 | //know their rights. | ||

47 | // | ||

48 | // Developers that use the GNU GPL protect your rights with two steps: | ||

49 | //(1) assert copyright on the software, and (2) offer you this License | ||

50 | //giving you legal permission to copy, distribute and/or modify it. | ||

51 | // | ||

52 | // For the developers' and authors' protection, the GPL clearly explains | ||

53 | //that there is no warranty for this free software. For both users' and | ||

54 | //authors' sake, the GPL requires that modified versions be marked as | ||

55 | //changed, so that their problems will not be attributed erroneously to | ||

56 | //authors of previous versions. | ||

57 | // | ||

58 | // Some devices are designed to deny users access to install or run | ||

59 | //modified versions of the software inside them, although the manufacturer | ||

60 | //can do so. This is fundamentally incompatible with the aim of | ||

61 | //protecting users' freedom to change the software. The systematic | ||

62 | //pattern of such abuse occurs in the area of products for individuals to | ||

63 | //use, which is precisely where it is most unacceptable. Therefore, we | ||

64 | //have designed this version of the GPL to prohibit the practice for those | ||

65 | //products. If such problems arise substantially in other domains, we | ||

66 | //stand ready to extend this provision to those domains in future versions | ||

67 | //of the GPL, as needed to protect the freedom of users. | ||

68 | // | ||

69 | // Finally, every program is threatened constantly by software patents. | ||

70 | //States should not allow patents to restrict development and use of | ||

71 | //software on general-purpose computers, but in those that do, we wish to | ||

72 | //avoid the special danger that patents applied to a free program could | ||

73 | //make it effectively proprietary. To prevent this, the GPL assures that | ||

74 | //patents cannot be used to render the program non-free. | ||

75 | // | ||

76 | // The precise terms and conditions for copying, distribution and | ||

77 | //modification follow. | ||

78 | // | ||

79 | // TERMS AND CONDITIONS | ||

80 | // | ||

81 | // 0. Definitions. | ||

82 | // | ||

83 | // "This License" refers to version 3 of the GNU General Public License. | ||

84 | // | ||

85 | // "Copyright" also means copyright-like laws that apply to other kinds of | ||

86 | //works, such as semiconductor masks. | ||

87 | // | ||

88 | // "The Program" refers to any copyrightable work licensed under this | ||

89 | //License. Each licensee is addressed as "you". "Licensees" and | ||

90 | //"recipients" may be individuals or organizations. | ||

91 | // | ||

92 | // To "modify" a work means to copy from or adapt all or part of the work | ||

93 | //in a fashion requiring copyright permission, other than the making of an | ||

94 | //exact copy. The resulting work is called a "modified version" of the | ||

95 | //earlier work or a work "based on" the earlier work. | ||

96 | // | ||

97 | // A "covered work" means either the unmodified Program or a work based | ||

98 | //on the Program. | ||

99 | // | ||

100 | // To "propagate" a work means to do anything with it that, without | ||

101 | //permission, would make you directly or secondarily liable for | ||

102 | //infringement under applicable copyright law, except executing it on a | ||

103 | //computer or modifying a private copy. Propagation includes copying, | ||

104 | //distribution (with or without modification), making available to the | ||

105 | //public, and in some countries other activities as well. | ||

106 | // | ||

107 | // To "convey" a work means any kind of propagation that enables other | ||

108 | //parties to make or receive copies. Mere interaction with a user through | ||

109 | //a computer network, with no transfer of a copy, is not conveying. | ||

110 | // | ||

111 | // An interactive user interface displays "Appropriate Legal Notices" | ||

112 | //to the extent that it includes a convenient and prominently visible | ||

113 | //feature that (1) displays an appropriate copyright notice, and (2) | ||

114 | //tells the user that there is no warranty for the work (except to the | ||

115 | //extent that warranties are provided), that licensees may convey the | ||

116 | //work under this License, and how to view a copy of this License. If | ||

117 | //the interface presents a list of user commands or options, such as a | ||

118 | //menu, a prominent item in the list meets this criterion. | ||

119 | // | ||

120 | // 1. Source Code. | ||

121 | // | ||

122 | // The "source code" for a work means the preferred form of the work | ||

123 | //for making modifications to it. "Object code" means any non-source | ||

124 | //form of a work. | ||

125 | // | ||

126 | // A "Standard Interface" means an interface that either is an official | ||

127 | //standard defined by a recognized standards body, or, in the case of | ||

128 | //interfaces specified for a particular programming language, one that | ||

129 | //is widely used among developers working in that language. | ||

130 | // | ||

131 | // The "System Libraries" of an executable work include anything, other | ||

132 | //than the work as a whole, that (a) is included in the normal form of | ||

133 | //packaging a Major Component, but which is not part of that Major | ||

134 | //Component, and (b) serves only to enable use of the work with that | ||

135 | //Major Component, or to implement a Standard Interface for which an | ||

136 | //implementation is available to the public in source code form. A | ||

137 | //"Major Component", in this context, means a major essential component | ||

138 | //(kernel, window system, and so on) of the specific operating system | ||

139 | //(if any) on which the executable work runs, or a compiler used to | ||

140 | //produce the work, or an object code interpreter used to run it. | ||

141 | // | ||

142 | // The "Corresponding Source" for a work in object code form means all | ||

143 | //the source code needed to generate, install, and (for an executable | ||

144 | //work) run the object code and to modify the work, including scripts to | ||

145 | //control those activities. However, it does not include the work's | ||

146 | //System Libraries, or general-purpose tools or generally available free | ||

147 | //programs which are used unmodified in performing those activities but | ||

148 | //which are not part of the work. For example, Corresponding Source | ||

149 | //includes interface definition files associated with source files for | ||

150 | //the work, and the source code for shared libraries and dynamically | ||

151 | //linked subprograms that the work is specifically designed to require, | ||

152 | //such as by intimate data communication or control flow between those | ||

153 | //subprograms and other parts of the work. | ||

154 | // | ||

155 | // The Corresponding Source need not include anything that users | ||

156 | //can regenerate automatically from other parts of the Corresponding | ||

157 | //Source. | ||

158 | // | ||

159 | // The Corresponding Source for a work in source code form is that | ||

160 | //same work. | ||

161 | // | ||

162 | // 2. Basic Permissions. | ||

163 | // | ||

164 | // All rights granted under this License are granted for the term of | ||

165 | //copyright on the Program, and are irrevocable provided the stated | ||

166 | //conditions are met. This License explicitly affirms your unlimited | ||

167 | //permission to run the unmodified Program. The output from running a | ||

168 | //covered work is covered by this License only if the output, given its | ||

169 | //content, constitutes a covered work. This License acknowledges your | ||

170 | //rights of fair use or other equivalent, as provided by copyright law. | ||

171 | // | ||

172 | // You may make, run and propagate covered works that you do not | ||

173 | //convey, without conditions so long as your license otherwise remains | ||

174 | //in force. You may convey covered works to others for the sole purpose | ||

175 | //of having them make modifications exclusively for you, or provide you | ||

176 | //with facilities for running those works, provided that you comply with | ||

177 | //the terms of this License in conveying all material for which you do | ||

178 | //not control copyright. Those thus making or running the covered works | ||

179 | //for you must do so exclusively on your behalf, under your direction | ||

180 | //and control, on terms that prohibit them from making any copies of | ||

181 | //your copyrighted material outside their relationship with you. | ||

182 | // | ||

183 | // Conveying under any other circumstances is permitted solely under | ||

184 | //the conditions stated below. Sublicensing is not allowed; section 10 | ||

185 | //makes it unnecessary. | ||

186 | // | ||

187 | // 3. Protecting Users' Legal Rights From Anti-Circumvention Law. | ||

188 | // | ||

189 | // No covered work shall be deemed part of an effective technological | ||

190 | //measure under any applicable law fulfilling obligations under article | ||

191 | //11 of the WIPO copyright treaty adopted on 20 December 1996, or | ||

192 | //similar laws prohibiting or restricting circumvention of such | ||

193 | //measures. | ||

194 | // | ||

195 | // When you convey a covered work, you waive any legal power to forbid | ||

196 | //circumvention of technological measures to the extent such circumvention | ||

197 | //is effected by exercising rights under this License with respect to | ||

198 | //the covered work, and you disclaim any intention to limit operation or | ||

199 | //modification of the work as a means of enforcing, against the work's | ||

200 | //users, your or third parties' legal rights to forbid circumvention of | ||

201 | //technological measures. | ||

202 | // | ||

203 | // 4. Conveying Verbatim Copies. | ||

204 | // | ||

205 | // You may convey verbatim copies of the Program's source code as you | ||

206 | //receive it, in any medium, provided that you conspicuously and | ||

207 | //appropriately publish on each copy an appropriate copyright notice; | ||

208 | //keep intact all notices stating that this License and any | ||

209 | //non-permissive terms added in accord with section 7 apply to the code; | ||

210 | //keep intact all notices of the absence of any warranty; and give all | ||

211 | //recipients a copy of this License along with the Program. | ||

212 | // | ||

213 | // You may charge any price or no price for each copy that you convey, | ||

214 | //and you may offer support or warranty protection for a fee. | ||

215 | // | ||

216 | // 5. Conveying Modified Source Versions. | ||

217 | // | ||

218 | // You may convey a work based on the Program, or the modifications to | ||

219 | //produce it from the Program, in the form of source code under the | ||

220 | //terms of section 4, provided that you also meet all of these conditions: | ||

221 | // | ||

222 | // a) The work must carry prominent notices stating that you modified | ||

223 | // it, and giving a relevant date. | ||

224 | // | ||

225 | // b) The work must carry prominent notices stating that it is | ||

226 | // released under this License and any conditions added under section | ||

227 | // 7. This requirement modifies the requirement in section 4 to | ||

228 | // "keep intact all notices". | ||

229 | // | ||

230 | // c) You must license the entire work, as a whole, under this | ||

231 | // License to anyone who comes into possession of a copy. This | ||

232 | // License will therefore apply, along with any applicable section 7 | ||

233 | // additional terms, to the whole of the work, and all its parts, | ||

234 | // regardless of how they are packaged. This License gives no | ||

235 | // permission to license the work in any other way, but it does not | ||

236 | // invalidate such permission if you have separately received it. | ||

237 | // | ||

238 | // d) If the work has interactive user interfaces, each must display | ||

239 | // Appropriate Legal Notices; however, if the Program has interactive | ||

240 | // interfaces that do not display Appropriate Legal Notices, your | ||

241 | // work need not make them do so. | ||

242 | // | ||

243 | // A compilation of a covered work with other separate and independent | ||

244 | //works, which are not by their nature extensions of the covered work, | ||

245 | //and which are not combined with it such as to form a larger program, | ||

246 | //in or on a volume of a storage or distribution medium, is called an | ||

247 | //"aggregate" if the compilation and its resulting copyright are not | ||

248 | //used to limit the access or legal rights of the compilation's users | ||

249 | //beyond what the individual works permit. Inclusion of a covered work | ||

250 | //in an aggregate does not cause this License to apply to the other | ||

251 | //parts of the aggregate. | ||

252 | // | ||

253 | // 6. Conveying Non-Source Forms. | ||

254 | // | ||

255 | // You may convey a covered work in object code form under the terms | ||

256 | //of sections 4 and 5, provided that you also convey the | ||

257 | //machine-readable Corresponding Source under the terms of this License, | ||

258 | //in one of these ways: | ||

259 | // | ||

260 | // a) Convey the object code in, or embodied in, a physical product | ||

261 | // (including a physical distribution medium), accompanied by the | ||

262 | // Corresponding Source fixed on a durable physical medium | ||

263 | // customarily used for software interchange. | ||

264 | // | ||

265 | // b) Convey the object code in, or embodied in, a physical product | ||

266 | // (including a physical distribution medium), accompanied by a | ||

267 | // written offer, valid for at least three years and valid for as | ||

268 | // long as you offer spare parts or customer support for that product | ||

269 | // model, to give anyone who possesses the object code either (1) a | ||

270 | // copy of the Corresponding Source for all the software in the | ||

271 | // product that is covered by this License, on a durable physical | ||

272 | // medium customarily used for software interchange, for a price no | ||

273 | // more than your reasonable cost of physically performing this | ||

274 | // conveying of source, or (2) access to copy the | ||

275 | // Corresponding Source from a network server at no charge. | ||

276 | // | ||

277 | // c) Convey individual copies of the object code with a copy of the | ||

278 | // written offer to provide the Corresponding Source. This | ||

279 | // alternative is allowed only occasionally and noncommercially, and | ||

280 | // only if you received the object code with such an offer, in accord | ||

281 | // with subsection 6b. | ||

282 | // | ||

283 | // d) Convey the object code by offering access from a designated | ||

284 | // place (gratis or for a charge), and offer equivalent access to the | ||

285 | // Corresponding Source in the same way through the same place at no | ||

286 | // further charge. You need not require recipients to copy the | ||

287 | // Corresponding Source along with the object code. If the place to | ||

288 | // copy the object code is a network server, the Corresponding Source | ||

289 | // may be on a different server (operated by you or a third party) | ||

290 | // that supports equivalent copying facilities, provided you maintain | ||

291 | // clear directions next to the object code saying where to find the | ||

292 | // Corresponding Source. Regardless of what server hosts the | ||

293 | // Corresponding Source, you remain obligated to ensure that it is | ||

294 | // available for as long as needed to satisfy these requirements. | ||

295 | // | ||

296 | // e) Convey the object code using peer-to-peer transmission, provided | ||

297 | // you inform other peers where the object code and Corresponding | ||

298 | // Source of the work are being offered to the general public at no | ||

299 | // charge under subsection 6d. | ||

300 | // | ||

301 | // A separable portion of the object code, whose source code is excluded | ||

302 | //from the Corresponding Source as a System Library, need not be | ||

303 | //included in conveying the object code work. | ||

304 | // | ||

305 | // A "User Product" is either (1) a "consumer product", which means any | ||

306 | //tangible personal property which is normally used for personal, family, | ||

307 | //or household purposes, or (2) anything designed or sold for incorporation | ||

308 | //into a dwelling. In determining whether a product is a consumer product, | ||

309 | //doubtful cases shall be resolved in favor of coverage. For a particular | ||

310 | //product received by a particular user, "normally used" refers to a | ||

311 | //typical or common use of that class of product, regardless of the status | ||

312 | //of the particular user or of the way in which the particular user | ||

313 | //actually uses, or expects or is expected to use, the product. A product | ||

314 | //is a consumer product regardless of whether the product has substantial | ||

315 | //commercial, industrial or non-consumer uses, unless such uses represent | ||

316 | //the only significant mode of use of the product. | ||

317 | // | ||

318 | // "Installation Information" for a User Product means any methods, | ||

319 | //procedures, authorization keys, or other information required to install | ||

320 | //and execute modified versions of a covered work in that User Product from | ||

321 | //a modified version of its Corresponding Source. The information must | ||

322 | //suffice to ensure that the continued functioning of the modified object | ||

323 | //code is in no case prevented or interfered with solely because | ||

324 | //modification has been made. | ||

325 | // | ||

326 | // If you convey an object code work under this section in, or with, or | ||

327 | //specifically for use in, a User Product, and the conveying occurs as | ||

328 | //part of a transaction in which the right of possession and use of the | ||

329 | //User Product is transferred to the recipient in perpetuity or for a | ||

330 | //fixed term (regardless of how the transaction is characterized), the | ||

331 | //Corresponding Source conveyed under this section must be accompanied | ||

332 | //by the Installation Information. But this requirement does not apply | ||

333 | //if neither you nor any third party retains the ability to install | ||

334 | //modified object code on the User Product (for example, the work has | ||

335 | //been installed in ROM). | ||

336 | // | ||

337 | // The requirement to provide Installation Information does not include a | ||

338 | //requirement to continue to provide support service, warranty, or updates | ||

339 | //for a work that has been modified or installed by the recipient, or for | ||

340 | //the User Product in which it has been modified or installed. Access to a | ||

341 | //network may be denied when the modification itself materially and | ||

342 | //adversely affects the operation of the network or violates the rules and | ||

343 | //protocols for communication across the network. | ||

344 | // | ||

345 | // Corresponding Source conveyed, and Installation Information provided, | ||

346 | //in accord with this section must be in a format that is publicly | ||

347 | //documented (and with an implementation available to the public in | ||

348 | //source code form), and must require no special password or key for | ||

349 | //unpacking, reading or copying. | ||

350 | // | ||

351 | // 7. Additional Terms. | ||

352 | // | ||

353 | // "Additional permissions" are terms that supplement the terms of this | ||

354 | //License by making exceptions from one or more of its conditions. | ||

355 | //Additional permissions that are applicable to the entire Program shall | ||

356 | //be treated as though they were included in this License, to the extent | ||

357 | //that they are valid under applicable law. If additional permissions | ||

358 | //apply only to part of the Program, that part may be used separately | ||

359 | //under those permissions, but the entire Program remains governed by | ||

360 | //this License without regard to the additional permissions. | ||

361 | // | ||

362 | // When you convey a copy of a covered work, you may at your option | ||

363 | //remove any additional permissions from that copy, or from any part of | ||

364 | //it. (Additional permissions may be written to require their own | ||

365 | //removal in certain cases when you modify the work.) You may place | ||

366 | //additional permissions on material, added by you to a covered work, | ||

367 | //for which you have or can give appropriate copyright permission. | ||

368 | // | ||

369 | // Notwithstanding any other provision of this License, for material you | ||

370 | //add to a covered work, you may (if authorized by the copyright holders of | ||

371 | //that material) supplement the terms of this License with terms: | ||

372 | // | ||

373 | // a) Disclaiming warranty or limiting liability differently from the | ||

374 | // terms of sections 15 and 16 of this License; or | ||

375 | // | ||

376 | // b) Requiring preservation of specified reasonable legal notices or | ||

377 | // author attributions in that material or in the Appropriate Legal | ||

378 | // Notices displayed by works containing it; or | ||

379 | // | ||

380 | // c) Prohibiting misrepresentation of the origin of that material, or | ||

381 | // requiring that modified versions of such material be marked in | ||

382 | // reasonable ways as different from the original version; or | ||

383 | // | ||

384 | // d) Limiting the use for publicity purposes of names of licensors or | ||

385 | // authors of the material; or | ||

386 | // | ||

387 | // e) Declining to grant rights under trademark law for use of some | ||

388 | // trade names, trademarks, or service marks; or | ||

389 | // | ||

390 | // f) Requiring indemnification of licensors and authors of that | ||

391 | // material by anyone who conveys the material (or modified versions of | ||

392 | // it) with contractual assumptions of liability to the recipient, for | ||

393 | // any liability that these contractual assumptions directly impose on | ||

394 | // those licensors and authors. | ||

395 | // | ||

396 | // All other non-permissive additional terms are considered "further | ||

397 | //restrictions" within the meaning of section 10. If the Program as you | ||

398 | //received it, or any part of it, contains a notice stating that it is | ||

399 | //governed by this License along with a term that is a further | ||

400 | //restriction, you may remove that term. If a license document contains | ||

401 | //a further restriction but permits relicensing or conveying under this | ||

402 | //License, you may add to a covered work material governed by the terms | ||

403 | //of that license document, provided that the further restriction does | ||

404 | //not survive such relicensing or conveying. | ||

405 | // | ||

406 | // If you add terms to a covered work in accord with this section, you | ||

407 | //must place, in the relevant source files, a statement of the | ||

408 | //additional terms that apply to those files, or a notice indicating | ||

409 | //where to find the applicable terms. | ||

410 | // | ||

411 | // Additional terms, permissive or non-permissive, may be stated in the | ||

412 | //form of a separately written license, or stated as exceptions; | ||

413 | //the above requirements apply either way. | ||

414 | // | ||

415 | // 8. Termination. | ||

416 | // | ||

417 | // You may not propagate or modify a covered work except as expressly | ||

418 | //provided under this License. Any attempt otherwise to propagate or | ||

419 | //modify it is void, and will automatically terminate your rights under | ||

420 | //this License (including any patent licenses granted under the third | ||

421 | //paragraph of section 11). | ||

422 | // | ||

423 | // However, if you cease all violation of this License, then your | ||

424 | //license from a particular copyright holder is reinstated (a) | ||

425 | //provisionally, unless and until the copyright holder explicitly and | ||

426 | //finally terminates your license, and (b) permanently, if the copyright | ||

427 | //holder fails to notify you of the violation by some reasonable means | ||

428 | //prior to 60 days after the cessation. | ||

429 | // | ||

430 | // Moreover, your license from a particular copyright holder is | ||

431 | //reinstated permanently if the copyright holder notifies you of the | ||

432 | //violation by some reasonable means, this is the first time you have | ||

433 | //received notice of violation of this License (for any work) from that | ||

434 | //copyright holder, and you cure the violation prior to 30 days after | ||

435 | //your receipt of the notice. | ||

436 | // | ||

437 | // Termination of your rights under this section does not terminate the | ||

438 | //licenses of parties who have received copies or rights from you under | ||

439 | //this License. If your rights have been terminated and not permanently | ||

440 | //reinstated, you do not qualify to receive new licenses for the same | ||

441 | //material under section 10. | ||

442 | // | ||

443 | // 9. Acceptance Not Required for Having Copies. | ||

444 | // | ||

445 | // You are not required to accept this License in order to receive or | ||

446 | //run a copy of the Program. Ancillary propagation of a covered work | ||

447 | //occurring solely as a consequence of using peer-to-peer transmission | ||

448 | //to receive a copy likewise does not require acceptance. However, | ||

449 | //nothing other than this License grants you permission to propagate or | ||

450 | //modify any covered work. These actions infringe copyright if you do | ||

451 | //not accept this License. Therefore, by modifying or propagating a | ||

452 | //covered work, you indicate your acceptance of this License to do so. | ||

453 | // | ||

454 | // 10. Automatic Licensing of Downstream Recipients. | ||

455 | // | ||

456 | // Each time you convey a covered work, the recipient automatically | ||

457 | //receives a license from the original licensors, to run, modify and | ||

458 | //propagate that work, subject to this License. You are not responsible | ||

459 | //for enforcing compliance by third parties with this License. | ||

460 | // | ||

461 | // An "entity transaction" is a transaction transferring control of an | ||

462 | //organization, or substantially all assets of one, or subdividing an | ||

463 | //organization, or merging organizations. If propagation of a covered | ||

464 | //work results from an entity transaction, each party to that | ||

465 | //transaction who receives a copy of the work also receives whatever | ||

466 | //licenses to the work the party's predecessor in interest had or could | ||

467 | //give under the previous paragraph, plus a right to possession of the | ||

468 | //Corresponding Source of the work from the predecessor in interest, if | ||

469 | //the predecessor has it or can get it with reasonable efforts. | ||

470 | // | ||

471 | // You may not impose any further restrictions on the exercise of the | ||

472 | //rights granted or affirmed under this License. For example, you may | ||

473 | //not impose a license fee, royalty, or other charge for exercise of | ||

474 | //rights granted under this License, and you may not initiate litigation | ||

475 | //(including a cross-claim or counterclaim in a lawsuit) alleging that | ||

476 | //any patent claim is infringed by making, using, selling, offering for | ||

477 | //sale, or importing the Program or any portion of it. | ||

478 | // | ||

479 | // 11. Patents. | ||

480 | // | ||

481 | // A "contributor" is a copyright holder who authorizes use under this | ||

482 | //License of the Program or a work on which the Program is based. The | ||

483 | //work thus licensed is called the contributor's "contributor version". | ||

484 | // | ||

485 | // A contributor's "essential patent claims" are all patent claims | ||

486 | //owned or controlled by the contributor, whether already acquired or | ||

487 | //hereafter acquired, that would be infringed by some manner, permitted | ||

488 | //by this License, of making, using, or selling its contributor version, | ||

489 | //but do not include claims that would be infringed only as a | ||

490 | //consequence of further modification of the contributor version. For | ||

491 | //purposes of this definition, "control" includes the right to grant | ||

492 | //patent sublicenses in a manner consistent with the requirements of | ||

493 | //this License. | ||

494 | // | ||

495 | // Each contributor grants you a non-exclusive, worldwide, royalty-free | ||

496 | //patent license under the contributor's essential patent claims, to | ||

497 | //make, use, sell, offer for sale, import and otherwise run, modify and | ||

498 | //propagate the contents of its contributor version. | ||

499 | // | ||

500 | // In the following three paragraphs, a "patent license" is any express | ||

501 | //agreement or commitment, however denominated, not to enforce a patent | ||

502 | //(such as an express permission to practice a patent or covenant not to | ||

503 | //sue for patent infringement). To "grant" such a patent license to a | ||

504 | //party means to make such an agreement or commitment not to enforce a | ||

505 | //patent against the party. | ||

506 | // | ||

507 | // If you convey a covered work, knowingly relying on a patent license, | ||

508 | //and the Corresponding Source of the work is not available for anyone | ||

509 | //to copy, free of charge and under the terms of this License, through a | ||

510 | //publicly available network server or other readily accessible means, | ||

511 | //then you must either (1) cause the Corresponding Source to be so | ||

512 | //available, or (2) arrange to deprive yourself of the benefit of the | ||

513 | //patent license for this particular work, or (3) arrange, in a manner | ||

514 | //consistent with the requirements of this License, to extend the patent | ||

515 | //license to downstream recipients. "Knowingly relying" means you have | ||

516 | //actual knowledge that, but for the patent license, your conveying the | ||

517 | //covered work in a country, or your recipient's use of the covered work | ||

518 | //in a country, would infringe one or more identifiable patents in that | ||

519 | //country that you have reason to believe are valid. | ||

520 | // | ||

521 | // If, pursuant to or in connection with a single transaction or | ||

522 | //arrangement, you convey, or propagate by procuring conveyance of, a | ||

523 | //covered work, and grant a patent license to some of the parties | ||

524 | //receiving the covered work authorizing them to use, propagate, modify | ||

525 | //or convey a specific copy of the covered work, then the patent license | ||

526 | //you grant is automatically extended to all recipients of the covered | ||

527 | //work and works based on it. | ||

528 | // | ||

529 | // A patent license is "discriminatory" if it does not include within | ||

530 | //the scope of its coverage, prohibits the exercise of, or is | ||

531 | //conditioned on the non-exercise of one or more of the rights that are | ||

532 | //specifically granted under this License. You may not convey a covered | ||

533 | //work if you are a party to an arrangement with a third party that is | ||

534 | //in the business of distributing software, under which you make payment | ||

535 | //to the third party based on the extent of your activity of conveying | ||

536 | //the work, and under which the third party grants, to any of the | ||

537 | //parties who would receive the covered work from you, a discriminatory | ||

538 | //patent license (a) in connection with copies of the covered work | ||

539 | //conveyed by you (or copies made from those copies), or (b) primarily | ||

540 | //for and in connection with specific products or compilations that | ||

541 | //contain the covered work, unless you entered into that arrangement, | ||

542 | //or that patent license was granted, prior to 28 March 2007. | ||

543 | // | ||

544 | // Nothing in this License shall be construed as excluding or limiting | ||

545 | //any implied license or other defenses to infringement that may | ||

546 | //otherwise be available to you under applicable patent law. | ||

547 | // | ||

548 | // 12. No Surrender of Others' Freedom. | ||

549 | // | ||

550 | // If conditions are imposed on you (whether by court order, agreement or | ||

551 | //otherwise) that contradict the conditions of this License, they do not | ||

552 | //excuse you from the conditions of this License. If you cannot convey a | ||

553 | //covered work so as to satisfy simultaneously your obligations under this | ||

554 | //License and any other pertinent obligations, then as a consequence you may | ||

555 | //not convey it at all. For example, if you agree to terms that obligate you | ||

556 | //to collect a royalty for further conveying from those to whom you convey | ||

557 | //the Program, the only way you could satisfy both those terms and this | ||

558 | //License would be to refrain entirely from conveying the Program. | ||

559 | // | ||

560 | // 13. Use with the GNU Affero General Public License. | ||

561 | // | ||

562 | // Notwithstanding any other provision of this License, you have | ||

563 | //permission to link or combine any covered work with a work licensed | ||

564 | //under version 3 of the GNU Affero General Public License into a single | ||

565 | //combined work, and to convey the resulting work. The terms of this | ||

566 | //License will continue to apply to the part which is the covered work, | ||

567 | //but the special requirements of the GNU Affero General Public License, | ||

568 | //section 13, concerning interaction through a network will apply to the | ||

569 | //combination as such. | ||

570 | // | ||

571 | // 14. Revised Versions of this License. | ||

572 | // | ||

573 | // The Free Software Foundation may publish revised and/or new versions of | ||

574 | //the GNU General Public License from time to time. Such new versions will | ||

575 | //be similar in spirit to the present version, but may differ in detail to | ||

576 | //address new problems or concerns. | ||

577 | // | ||

578 | // Each version is given a distinguishing version number. If the | ||

579 | //Program specifies that a certain numbered version of the GNU General | ||

580 | //Public License "or any later version" applies to it, you have the | ||

581 | //option of following the terms and conditions either of that numbered | ||

582 | //version or of any later version published by the Free Software | ||

583 | //Foundation. If the Program does not specify a version number of the | ||

584 | //GNU General Public License, you may choose any version ever published | ||

585 | //by the Free Software Foundation. | ||

586 | // | ||

587 | // If the Program specifies that a proxy can decide which future | ||

588 | //versions of the GNU General Public License can be used, that proxy's | ||

589 | //public statement of acceptance of a version permanently authorizes you | ||

590 | //to choose that version for the Program. | ||

591 | // | ||

592 | // Later license versions may give you additional or different | ||

593 | //permissions. However, no additional obligations are imposed on any | ||

594 | //author or copyright holder as a result of your choosing to follow a | ||

595 | //later version. | ||

596 | // | ||

597 | // 15. Disclaimer of Warranty. | ||

598 | // | ||

599 | // THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY | ||

600 | //APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT | ||

601 | //HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY | ||

602 | //OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, | ||

603 | //THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||

604 | //PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM | ||

605 | //IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF | ||

606 | //ALL NECESSARY SERVICING, REPAIR OR CORRECTION. | ||

607 | // | ||

608 | // 16. Limitation of Liability. | ||

609 | // | ||

610 | // IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING | ||

611 | //WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS | ||

612 | //THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY | ||

613 | //GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE | ||

614 | //USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF | ||

615 | //DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD | ||

616 | //PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), | ||

617 | //EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF | ||

618 | //SUCH DAMAGES. | ||

619 | // | ||

620 | // 17. Interpretation of Sections 15 and 16. | ||

621 | // | ||

622 | // If the disclaimer of warranty and limitation of liability provided | ||

623 | //above cannot be given local legal effect according to their terms, | ||

624 | //reviewing courts shall apply local law that most closely approximates | ||

625 | //an absolute waiver of all civil liability in connection with the | ||

626 | //Program, unless a warranty or assumption of liability accompanies a | ||

627 | //copy of the Program in return for a fee. | ||

628 | // | ||

629 | // END OF TERMS AND CONDITIONS | ||

630 | // | ||

631 | // How to Apply These Terms to Your New Programs | ||

632 | // | ||

633 | // If you develop a new program, and you want it to be of the greatest | ||

634 | //possible use to the public, the best way to achieve this is to make it | ||

635 | //free software which everyone can redistribute and change under these terms. | ||

636 | // | ||

637 | // To do so, attach the following notices to the program. It is safest | ||

638 | //to attach them to the start of each source file to most effectively | ||

639 | //state the exclusion of warranty; and each file should have at least | ||

640 | //the "copyright" line and a pointer to where the full notice is found. | ||

641 | // | ||

642 | // <one line to give the program's name and a brief idea of what it does.> | ||

643 | // Copyright (C) <year> <name of author> | ||

644 | // | ||

645 | // This program is free software: you can redistribute it and/or modify | ||

646 | // it under the terms of the GNU General Public License as published by | ||

647 | // the Free Software Foundation, either version 3 of the License, or | ||

648 | // (at your option) any later version. | ||

649 | // | ||

650 | // This program is distributed in the hope that it will be useful, | ||

651 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | ||

652 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||

653 | // GNU General Public License for more details. | ||

654 | // | ||

655 | // You should have received a copy of the GNU General Public License | ||

656 | // along with this program. If not, see <http://www.gnu.org/licenses/>. | ||

657 | // | ||

658 | //Also add information on how to contact you by electronic and paper mail. | ||

659 | // | ||

660 | // If the program does terminal interaction, make it output a short | ||

661 | //notice like this when it starts in an interactive mode: | ||

662 | // | ||

663 | // <program> Copyright (C) <year> <name of author> | ||

664 | // This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. | ||

665 | // This is free software, and you are welcome to redistribute it | ||

666 | // under certain conditions; type `show c' for details. | ||

667 | // | ||

668 | //The hypothetical commands `show w' and `show c' should show the appropriate | ||

669 | //parts of the General Public License. Of course, your program's commands | ||

670 | //might be different; for a GUI interface, you would use an "about box". | ||

671 | // | ||

672 | // You should also get your employer (if you work as a programmer) or school, | ||

673 | //if any, to sign a "copyright disclaimer" for the program, if necessary. | ||

674 | //For more information on this, and how to apply and follow the GNU GPL, see | ||

675 | //<http://www.gnu.org/licenses/>. | ||

676 | // | ||

677 | // The GNU General Public License does not permit incorporating your program | ||

678 | //into proprietary programs. If your program is a subroutine library, you | ||

679 | //may consider it more useful to permit linking proprietary applications with | ||

680 | //the library. If this is what you want to do, use the GNU Lesser General | ||

681 | //Public License instead of this License. But first, please read | ||

682 | //<http://www.gnu.org/philosophy/why-not-lgpl.html>. | ||

683 | //------------------------------------------------------------------------------------------------- | ||

684 | //-------------------------------------------------------------------------------- | ||

685 | /* | ||

686 | This software module is a careful adaptation of the integer functions | ||

687 | in the GNU MP library. | ||

688 | |||

689 | By "adaptation" I mean the following: | ||

690 | |||

691 | o Many of the macros and other constructs that affect readability | ||

692 | have been removed. This has been done for simplicity. | ||

693 | |||

694 | o Only the needed functions (large integer and rational number | ||

695 | functions) have been included. This is for use in Dave Ashley's | ||

696 | set of tools. | ||

697 | |||

698 | o The number of source modules has been dramatically reduced. | ||

699 | |||

700 | o Assembly-language has been removed. Instead, at the lowest | ||

701 | level, the core is generic 'C' provided by GNU (this is | ||

702 | selected if processor=none is the processor chosen). This | ||

703 | certainly has an effect on speed, but I would rather sacrifice | ||

704 | quite a bit of speed and keep it simple (in one module). | ||

705 | |||

706 | o The GNU MP library has been specifically ported for Microsoft | ||

707 | Visual C++ 6.0. In other words, its portability has been | ||

708 | deliberately destroyed. Do NOT try to use this on another | ||

709 | platform (or at least certainly do NOT contact me if you have | ||

710 | problems with this). | ||

711 | |||

712 | o Certain other stylistic changes have been made. | ||

713 | |||

714 | The GNU MP code is impressive, because it is so quick. However, | ||

715 | because many of the algorithms were so advanced, I couldn't | ||

716 | understand their basis. I would rather have a slower software | ||

717 | module that I can debug than a faster one that can't be | ||

718 | decisively debugged if necessary. | ||

719 | |||

720 | This code can be optimized, if necessary, by reincorporating | ||

721 | GNU MP code without changing the interface. This would be | ||

722 | fairly easy to do. I would recommend proceeding in the following | ||

723 | order: | ||

724 | o Replacing the innards of some of the lower-level | ||

725 | functions with assembly-language (there may be usable | ||

726 | assembly-language in the GNU code). The lowest-level | ||

727 | multiplication function, for example, was noted to be | ||

728 | VERY inefficient (but correct!). | ||

729 | o Making algorithmic improvements in the higher-level | ||

730 | functions by reincorporating GNU code. These | ||

731 | algorithmic improvements were removed because | ||

732 | I couldn't understand them. For example, I could | ||

733 | not understand the advanced multiplication and | ||

734 | division algorithms. | ||

735 | |||

736 | I decline to include the GNU public license statement which is | ||

737 | included with the GNU MP code, because this software has been | ||

738 | changed enough that it isn't quite the GNU MP code any longer. | ||

739 | However, this software module is still under the GNU public | ||

740 | license because it is included with Dave Ashley's tool set (The | ||

741 | Iju Tool Set). Additionally, although this software module has been | ||

742 | modified enough that it really is a separate effort, I would like to | ||

743 | acknowledge the tremendous job done by the GNU MP team. Certainly | ||

744 | I would not have undertaken a project of this complexity without | ||

745 | an existing template to work from--i.e. something successful already | ||

746 | in existence. The really hard work--a working and efficient design-- | ||

747 | was done by the GNU MP team, and my modifications, although substantial, | ||

748 | are trivial in comparison to the design work done by the GNU MP team. | ||

749 | |||

750 | It should also be noted that this integer module is not a product | ||

751 | of GNU--I named it GNU_INTS because it is based on the GNU MP | ||

752 | library. The GNU MP library is faster and more sophisticated. This | ||

753 | is a pared down module to give some of the speed benefits of binary | ||

754 | arithmetic without too much extra complexity. Most of the | ||

755 | sophisticated algorithms used by the GNU MP library have been | ||

756 | removed. | ||

757 | |||

758 | The basic abstraction implemented by this type of integer is that | ||

759 | any operation can be performed on integers, and NAN flags propagate. | ||

760 | However, once an integer has reached a NAN state, the tests (is_zero, etc.) | ||

761 | are unreliable. Generally, any client which uses these integers should | ||

762 | check errors before tests, but doesn't need to check them after each | ||

763 | calculation. I say "before" tests because otherwise an integer may reach | ||

764 | NAN and cause an infinite loop because a test will never become TRUE, etc. | ||

765 | */ | ||

766 | |||

767 | #ifndef GMP_INTS_H_INCLUDED | ||

768 | #define GMP_INTS_H_INCLUDED | ||

769 | |||

770 | #ifdef MODULE_GMP_INTS | ||

771 | #define DECMOD_GMP_INTS | ||

772 | #else | ||

773 | #define DECMOD_GMP_INTS extern | ||

774 | #endif | ||

775 | |||

776 | typedef unsigned long int GMP_INTS_limb_t; | ||

777 | //The fundamental data type for representing integers in binary | ||

778 | //form. For MSVC++, this is a 32-bit type. This data type | ||

779 | //is not normally needed publicly. | ||

780 | #define GMP_INTS_BITS_PER_LIMB (32) | ||

781 | //This is the number of bits that each limb is assumed to hold. | ||

782 | //There is an explicit function in the interface to check this, | ||

783 | //in case anything changes with future versions of MSVC++. | ||

784 | //This software module is NOT meant to be portable, or even | ||

785 | //particularly quick. It is meant to be verifiable and | ||

786 | //testable instead. | ||

787 | typedef long int GMP_INTS_limb_signed_t; | ||

788 | //Signed version of above. | ||

789 | typedef GMP_INTS_limb_t * GMP_INTS_limb_ptr; | ||

790 | //Pointer to a limb (or, more characteristically, to an array | ||

791 | //of limbs). | ||

792 | typedef const GMP_INTS_limb_t * GMP_INTS_limb_srcptr; | ||

793 | //Constant pointer used as the source pointer for copies | ||

794 | //and other operations. | ||

795 | typedef long int GMP_INTS_size_t; | ||

796 | //Used for representing the size of things to this module | ||

797 | typedef long int GMP_INTS_exp_t; | ||

798 | //Used for representing exponent. Assumed to be large enough | ||

799 | //for this. | ||

800 | |||

801 | //Below is fundamental structure which holds an arbitrary-size | ||

802 | //integer. | ||

803 | typedef struct | ||

804 | { | ||

805 | int flags; | ||

806 | //Bit-flags as to the condition of the | ||

807 | //integer. The bitflags defined so far | ||

808 | //are designed to be mutually exclusive, | ||

809 | //and are listed below. At the same time, | ||

810 | //we need to define the "official" strings | ||

811 | //for these bit flags. | ||

812 | #define GMP_INTS_EF_INTOVF_POS (1) | ||

813 | #define GMP_INTS_EF_INTOVF_POS_STRING \ | ||

814 | "GMP_INTS_EF_INTOVF_POS" | ||

815 | //The integer has become too large | ||

816 | //growing in a positive direction. | ||

817 | //No further arithmetic will be | ||

818 | //performed on it. | ||

819 | #define GMP_INTS_EF_INTOVF_NEG (2) | ||

820 | #define GMP_INTS_EF_INTOVF_NEG_STRING \ | ||

821 | "GMP_INTS_EF_INTOVF_NEG" | ||

822 | //The integer has become too large | ||

823 | //growing in a negative direction. | ||

824 | //No further arithmetic will be | ||

825 | //performed on it. | ||

826 | #define GMP_INTS_EF_INTOVF_TAINT_POS (4) | ||

827 | #define GMP_INTS_EF_INTOVF_TAINT_POS_STRING \ | ||

828 | "GMP_INTS_EF_INTOVF_TAINT_POS" | ||

829 | //The integer has been arithmetically | ||

830 | //combined with an integer that has | ||

831 | //overflowed in the positive direction. | ||

832 | //This integer is thus considered tainted | ||

833 | //and no further arithmetic will be | ||

834 | //performed on it. | ||

835 | #define GMP_INTS_EF_INTOVF_TAINT_NEG (8) | ||

836 | #define GMP_INTS_EF_INTOVF_TAINT_NEG_STRING \ | ||

837 | "GMP_INTS_EF_INTOVF_TAINT_NEG" | ||

838 | //The integer has been arithmetically | ||

839 | //combined with an integer that has | ||

840 | //overflowed in the negative direction. | ||

841 | //This integer is thus considered tainted | ||

842 | //and no further arithmetic will be | ||

843 | //performed on it. | ||

844 | //The flags above will prevent arithmetic | ||

845 | //on an integer and will taint any integer | ||

846 | //that comes into contact with it as the | ||

847 | //result of an operation. These flags are | ||

848 | //cleared only by an assignment operation | ||

849 | //of any kind. | ||

850 | // | ||

851 | //The next logical questions are: | ||

852 | // o Why do we want to make a size | ||

853 | // limit on integers, anyway? | ||

854 | // o How big is too big? | ||

855 | // | ||

856 | //We want a limit because this software module | ||

857 | //will be used in programs that should be | ||

858 | //reliable. Allowing arbitrarily large results | ||

859 | //would invite users to break the software. | ||

860 | //It would also make testing impossible, because | ||

861 | //the module could not be tested out to its | ||

862 | //limits. Assigning limits means that testing | ||

863 | //can be performed to the limits. Also, there | ||

864 | //are certain constructs in the software that | ||

865 | //may break at high limits, such as _alloca(). | ||

866 | // | ||

867 | //The question of how large is too large is a | ||

868 | //harder question. Arbitrarily, let's decide | ||

869 | //that we want the equivalent of integers with | ||

870 | //100,000 decimal digits, which is about | ||

871 | //332,224 bits, or 10,382 limbs. (By the way | ||

872 | //this limit can always be raised later, but | ||

873 | //the important point is that it exists and | ||

874 | //is tested to). Any integer with more limbs | ||

875 | //than this is considered illegal. | ||

876 | #define GMP_INTS_MAXIMUM_LIMBS_PER_INT (10382) | ||

877 | int n_allocd; /* Number of limbs allocated and pointed | ||

878 | to by the limbs field. This gives the | ||

879 | number allocated (i.e. physically | ||

880 | allocated), but the next field tells how | ||

881 | many are used. Memory is never shrunk | ||

882 | automatically by this software module | ||

883 | (per the wise GNU MP design), so this | ||

884 | number does not ever automatically | ||

885 | decrease. */ | ||

886 | int size; /* abs(size) is the number of limbs the | ||

887 | last field points to. If _mp_size is | ||

888 | negative this is a negative number. This | ||

889 | will be zero if the integer is zero. */ | ||

890 | GMP_INTS_limb_t *limbs; | ||

891 | /* Pointer to the limbs. The first field | ||

892 | of the structure (above) tells how many | ||

893 | spots are allocated, and the second | ||

894 | field (above) tells how many are used. | ||

895 | Numbers are stored least-significant | ||

896 | limbs first. */ | ||

897 | } GMP_INTS_mpz_struct; | ||

898 | |||

899 | |||

900 | /* Wrappers for non-stack memory allocation function to be used | ||

901 | ** by integer, rational number, and integer and rational number | ||

902 | ** algorithm functions. These must be public because they are | ||

903 | ** used by the other modules that deal with integers and rational | ||

904 | ** numbers. | ||

905 | */ | ||

906 | DECMOD_GMP_INTS void *GMP_INTS_malloc( size_t size ); | ||

907 | DECMOD_GMP_INTS void *GMP_INTS_calloc( size_t num, size_t size ); | ||

908 | DECMOD_GMP_INTS void *GMP_INTS_realloc( void *memblock, size_t size ); | ||

909 | DECMOD_GMP_INTS void *GMP_INTS_realloc_w_size( void *memblock, | ||

910 | size_t old_size, | ||

911 | size_t size ); | ||

912 | DECMOD_GMP_INTS void GMP_INTS_free( void *memblock ); | ||

913 | DECMOD_GMP_INTS void GMP_INTS_free_w_size( void *memblock, size_t size ); | ||

914 | |||

915 | /******************************************************************/ | ||

916 | /*** PORTABILITY CHECK FUNCTIONS *******************************/ | ||

917 | /******************************************************************/ | ||

918 | //Because there is the risk that Microsoft Visual C++ might | ||

919 | //change in the future, the following function can be called | ||

920 | //to see if the assumptions about data sizes are valid. This | ||

921 | //function returns TRUE if there is a problem, or FALSE | ||

922 | //otherwise. | ||

923 | DECMOD_GMP_INTS int GMP_INTS_data_sizes_are_wrong(void); | ||

924 | |||

925 | |||

926 | /******************************************************************/ | ||

927 | /*** ERROR STRING IDENTIFICATION AND PROCESSING FUNCTIONS *******/ | ||

928 | /******************************************************************/ | ||

929 | //These functions are provided because some clients may deal | ||

930 | //only with symbolic representations (Tcl/Tk, for example). | ||

931 | // | ||

932 | //Attempts to identify the passed string as one of the error | ||

933 | //strings sanctioned by this module. Returns -1 if not a match | ||

934 | //or else the following values. | ||

935 | // 0: GMP_INTS_EF_INTOVF_POS | ||

936 | // 1: GMP_INTS_EF_INTOVF_NEG | ||

937 | // 2: GMP_INTS_EF_INTOVF_TAINT_POS | ||

938 | // 3: GMP_INTS_EF_INTOVF_TAINT_NEG | ||

939 | DECMOD_GMP_INTS | ||

940 | int GMP_INTS_identify_nan_string(const char *s); | ||

941 | |||

942 | //Returns the sanctioned string for the nan value indicated. | ||

943 | //Integers that may be passed are the same as the | ||

944 | //indices above. No parameter except 0-3 is allowed. | ||

945 | DECMOD_GMP_INTS | ||

946 | const char *GMP_INTS_supply_nan_string(int idx); | ||

947 | |||

948 | /******************************************************************/ | ||

949 | /*** DEBUG PRINTING FUNCTIONS **********************************/ | ||

950 | /******************************************************************/ | ||

951 | //These functions are for printing out integers and limbs | ||

952 | //and groups of limbs for unit testing and debugging. | ||

953 | // | ||

954 | //Prints out a group of limbs, preceded by a description. | ||

955 | //n may be 0 and/or the lg pointer supplied may be NULL. | ||

956 | DECMOD_GMP_INTS | ||

957 | void GMP_INTS_print_limb_group(FILE *stream, | ||

958 | GMP_INTS_limb_srcptr lg, | ||

959 | GMP_INTS_size_t n, | ||

960 | char *desc); | ||

961 | //Prints an entire integer for diagnosis. | ||

962 | DECMOD_GMP_INTS | ||

963 | void GMP_INTS_mpz_print_int(FILE *stream, | ||

964 | const GMP_INTS_mpz_struct *arg, | ||

965 | char *desc); | ||

966 | |||

967 | /****************************************************************/ | ||

968 | /*** MACRO REPLACEMENTS *************************************/ | ||

969 | /****************************************************************/ | ||

970 | //The functions here are macros that have been replaced and | ||

971 | //made functions for clarity. Speed was sacrificed for clarity. | ||

972 | DECMOD_GMP_INTS | ||

973 | int GMP_INTS_mpz_get_flags(const GMP_INTS_mpz_struct *arg); | ||

974 | //Allows a caller to obtain the flags of an integer. | ||

975 | //A non-zero value indicates trouble. To figure out which | ||

976 | //trouble, compare against the bit constants defined | ||

977 | //with the "flags" field of the structure type, above. | ||

978 | DECMOD_GMP_INTS GMP_INTS_size_t GMP_INTS_abs_of_size_t(GMP_INTS_size_t arg); | ||

979 | //Returns the absolute value of one of the size arguments used | ||

980 | //to indicate number of limbs. This function is useful | ||

981 | //because integers natively stored with a negative size | ||

982 | //for negative arguments, so the absolute value gives the | ||

983 | //number of limbs consumed. | ||

984 | DECMOD_GMP_INTS int GMP_INTS_mpz_sgn(const GMP_INTS_mpz_struct *arg); | ||

985 | //Returns -1 if integer is negative, 0 if it is zero, | ||

986 | //or 1 if it is positive. | ||

987 | DECMOD_GMP_INTS int GMP_INTS_mpz_is_neg(const GMP_INTS_mpz_struct *arg); | ||

988 | DECMOD_GMP_INTS int GMP_INTS_mpz_is_zero(const GMP_INTS_mpz_struct *arg); | ||

989 | DECMOD_GMP_INTS int GMP_INTS_mpz_is_pos(const GMP_INTS_mpz_struct *arg); | ||

990 | //These functions return 1 if the condition is met, or 0 | ||

991 | //otherwise. | ||

992 | DECMOD_GMP_INTS int GMP_INTS_mpz_is_odd(const GMP_INTS_mpz_struct *arg); | ||

993 | //Returns 1 if the integer is odd, or 0 if it is even. | ||

994 | DECMOD_GMP_INTS int GMP_INTS_mpz_is_even(const GMP_INTS_mpz_struct *arg); | ||

995 | //Returns 1 if the integer is even, or 0 if it is odd. | ||

996 | DECMOD_GMP_INTS void GMP_INTS_mpz_negate(GMP_INTS_mpz_struct *arg); | ||

997 | //Negates the number (changes the sign). | ||

998 | DECMOD_GMP_INTS | ||

999 | void GMP_INTS_mpn_normalize(GMP_INTS_limb_ptr limb_array, | ||

1000 | GMP_INTS_size_t *idx); | ||

1001 | //Adjusts an index downward to bypass any most significant | ||

1002 | //zero limbs. This was a macro in the GNU implementation. | ||

1003 | //This is for when the size of a result is overestimated | ||

1004 | //(the most pessimistic estimates must be made when | ||

1005 | //allocating memory before an operation). | ||

1006 | DECMOD_GMP_INTS | ||

1007 | void GMP_INTS_mpn_copy_limbs(GMP_INTS_limb_ptr dest, | ||

1008 | GMP_INTS_limb_srcptr src, | ||

1009 | GMP_INTS_size_t n); | ||

1010 | //Copies limbs from source to destination. This | ||

1011 | //function replaces a macro that was present in the | ||

1012 | //GNU code. Again, clarity over speed. | ||

1013 | /****************************************************************/ | ||

1014 | /*** LOW-LEVEL ARITHMETIC FUNCTIONS *************************/ | ||

1015 | /****************************************************************/ | ||

1016 | //Gives the flags of a result integer as a function of the | ||

1017 | //flags of its two operands. If the function requires only | ||

1018 | //one operand, just use zero as the second parameter and the | ||

1019 | //result will be correct. Handles tainting. | ||

1020 | DECMOD_GMP_INTS | ||

1021 | int GMP_INTS_two_op_flags_map(int flags1, int flags2); | ||

1022 | |||

1023 | //Adds the single limb s2_limb to the array of limbs s1, | ||

1024 | //processing carries, and copies the result to the location | ||

1025 | //res_ptr. res_ptr is assumed to be [at least] the same size | ||

1026 | //as s1. From the design, s1 and res_ptr may be the | ||

1027 | //same set of locations. The | ||

1028 | //result is 1 if there was a carry out of the final limb or | ||

1029 | //0 otherwise. | ||

1030 | DECMOD_GMP_INTS | ||

1031 | GMP_INTS_limb_t GMP_INTS_mpn_add_1 (GMP_INTS_limb_ptr res_ptr, | ||

1032 | GMP_INTS_limb_srcptr s1_ptr, | ||

1033 | GMP_INTS_size_t s1_size, | ||

1034 | GMP_INTS_limb_t s2_limb); | ||

1035 | |||

1036 | //Very similar to the addition function. Counts on the single | ||

1037 | //limb that is being subtracted being not enough to roll over the | ||

1038 | //integer that is being subtracted from. No harm if this is done | ||

1039 | //(it just obeys 2-s complement rules) but this was probably not | ||

1040 | //the intent. From the design, s1 and res_ptr may | ||

1041 | //be the same set of locations. The | ||

1042 | //result is 1 if there was a borrow out of the final limb or | ||

1043 | //0 otherwise. | ||

1044 | DECMOD_GMP_INTS | ||

1045 | GMP_INTS_limb_t GMP_INTS_mpn_sub_1(GMP_INTS_limb_ptr res_ptr, | ||

1046 | GMP_INTS_limb_srcptr s1_ptr, | ||

1047 | GMP_INTS_size_t s1_size, | ||

1048 | GMP_INTS_limb_t s2_limb); | ||

1049 | |||

1050 | //Multiplies a limb by a group of limbs. The return value is | ||

1051 | //the unsigned overflow out of the "top", which may be up to | ||

1052 | //one limb large (i.e. it is more than just a carry, it has | ||

1053 | //a value besides 0 and 1). | ||

1054 | DECMOD_GMP_INTS | ||

1055 | GMP_INTS_limb_t GMP_INTS_mpn_mul_1(GMP_INTS_limb_ptr res_ptr, | ||

1056 | GMP_INTS_limb_srcptr s1_ptr, | ||

1057 | GMP_INTS_size_t s1_size, | ||

1058 | GMP_INTS_limb_t s2_limb); | ||

1059 | |||

1060 | //Adds together two groups of limbs of same size. The result | ||

1061 | //may be the same location as one or both of the two | ||

1062 | //operands. | ||

1063 | DECMOD_GMP_INTS | ||

1064 | GMP_INTS_limb_t GMP_INTS_mpn_add_n(GMP_INTS_limb_ptr res_ptr, | ||

1065 | GMP_INTS_limb_srcptr s1_ptr, | ||

1066 | GMP_INTS_limb_srcptr s2_ptr, | ||

1067 | GMP_INTS_size_t size); | ||

1068 | |||

1069 | //This function makes the mapping: | ||

1070 | // res_ptr = res_ptr + s2_limb * s1_ptr | ||

1071 | //From the design, it appears that it is alright if | ||

1072 | //res_ptr and s1_ptr are the same area. The return | ||

1073 | //value is the excess that that should exist one limb | ||

1074 | //above the MSL of res_ptr (i.e. it is more than a carry, it | ||

1075 | //may be larger than one). | ||

1076 | DECMOD_GMP_INTS | ||

1077 | GMP_INTS_limb_t GMP_INTS_mpn_addmul_1(GMP_INTS_limb_ptr res_ptr, | ||

1078 | GMP_INTS_limb_srcptr s1_ptr, | ||

1079 | GMP_INTS_size_t s1_size, | ||

1080 | GMP_INTS_limb_t s2_limb); | ||

1081 | |||

1082 | //This function adds in general two natural numbers. Numbers must | ||

1083 | //be arranged so that S2 takes no more limbs than S1, i.e. | ||

1084 | //LIMBS(s1) >= LIMBS(s2). Memory must be allocated, and there must | ||

1085 | //be space for the result. Not clear from the design if memory | ||

1086 | //areas can be coincident, but suspect can. | ||

1087 | DECMOD_GMP_INTS | ||

1088 | GMP_INTS_limb_t GMP_INTS_mpn_add(GMP_INTS_limb_ptr res_ptr, | ||

1089 | GMP_INTS_limb_srcptr s1_ptr, | ||

1090 | GMP_INTS_size_t s1_size, | ||

1091 | GMP_INTS_limb_srcptr s2_ptr, | ||

1092 | GMP_INTS_size_t s2_size); | ||

1093 | |||

1094 | //Subtracts two same-size operands. They may be coincident in | ||

1095 | //memory. | ||

1096 | DECMOD_GMP_INTS | ||

1097 | GMP_INTS_limb_t GMP_INTS_mpn_sub_n(GMP_INTS_limb_ptr res_ptr, | ||

1098 | GMP_INTS_limb_srcptr s1_ptr, | ||

1099 | GMP_INTS_limb_srcptr s2_ptr, | ||

1100 | GMP_INTS_size_t size); | ||

1101 | |||

1102 | //This function subtracts in general two natural numbers. Numbers must | ||

1103 | //be arranged so that S2 takes no more limbs than S1, i.e. | ||

1104 | //LIMBS(s1) >= LIMBS(s2). Memory must be allocated, and there must | ||

1105 | //be space for the result. Not clear from the design if memory | ||

1106 | //areas can be coincident. Result is S1-S2. | ||

1107 | DECMOD_GMP_INTS | ||

1108 | GMP_INTS_limb_t GMP_INTS_mpn_sub (GMP_INTS_limb_ptr res_ptr, | ||

1109 | GMP_INTS_limb_srcptr s1_ptr, | ||

1110 | GMP_INTS_size_t s1_size, | ||

1111 | GMP_INTS_limb_srcptr s2_ptr, | ||

1112 | GMP_INTS_size_t s2_size); | ||

1113 | |||

1114 | //Shifts UP of size USIZE left by CNT. CNT must be less than the number | ||

1115 | //of bits per limb, which is at this time 32. "wp" and "up" may be | ||

1116 | //coincident. Zero count is not allowed. Value returned is the bits shifted | ||

1117 | //out the left. | ||

1118 | DECMOD_GMP_INTS | ||

1119 | GMP_INTS_limb_t GMP_INTS_mpn_lshift(GMP_INTS_limb_ptr wp, | ||

1120 | GMP_INTS_limb_srcptr up, | ||

1121 | GMP_INTS_size_t usize, | ||

1122 | unsigned int cnt); | ||

1123 | |||

1124 | //Shifts UP of size USIZE right by CNT. CNT must be less than the number | ||

1125 | //of bits per limb, which is at this time 32. "wp" and "up" may be | ||

1126 | //coincident. Zero count is not allowed. Value returned is the bits shifted | ||

1127 | //out the right. | ||

1128 | DECMOD_GMP_INTS | ||

1129 | GMP_INTS_limb_t GMP_INTS_mpn_rshift (GMP_INTS_limb_ptr wp, | ||

1130 | GMP_INTS_limb_srcptr up, | ||

1131 | GMP_INTS_size_t usize, | ||

1132 | unsigned int cnt); | ||

1133 | |||

1134 | //Compares two natural numbers of same size and returns the expected | ||

1135 | //1 iff op1 > op2, -1 if op1 < op2, or 0 if they are equal. Leading | ||

1136 | //zero limbs are alright and do not affect the result. | ||

1137 | DECMOD_GMP_INTS | ||

1138 | int GMP_INTS_mpn_cmp (GMP_INTS_limb_srcptr op1_ptr, | ||

1139 | GMP_INTS_limb_srcptr op2_ptr, | ||

1140 | GMP_INTS_size_t size); | ||

1141 | |||

1142 | //This is the basic multiplication of two natural numbers, each of | ||

1143 | //which may occuply many limbs. In the | ||

1144 | //original GNU MP code, there were several algorithms which could | ||

1145 | //be selected, depending on the size of the operands and other | ||

1146 | //factors. This was the most basic case--the basic longhand | ||

1147 | //multiplication. The code has been pared so that this is the | ||

1148 | //only case. | ||

1149 | DECMOD_GMP_INTS | ||

1150 | void GMP_INTS_mpn_mul_basecase (GMP_INTS_limb_ptr prodp, | ||

1151 | GMP_INTS_limb_srcptr up, | ||

1152 | GMP_INTS_size_t usize, | ||

1153 | GMP_INTS_limb_srcptr vp, | ||

1154 | GMP_INTS_size_t vsize); | ||

1155 | |||

1156 | //This is the basic multiplication of two natural numbers. In the old | ||

1157 | //GNU MP code, one of several algorithms would be selected. The code | ||

1158 | //has been pared down so that this is just a passthrough to | ||

1159 | //GMP_INTS_mpn_mul_basecase(). Only the simplest multiplication | ||

1160 | //algorithm is used at this point. | ||

1161 | DECMOD_GMP_INTS | ||

1162 | void GMP_INTS_mpn_mul_n (GMP_INTS_limb_ptr p, | ||

1163 | GMP_INTS_limb_srcptr a, | ||

1164 | GMP_INTS_limb_srcptr b, | ||

1165 | GMP_INTS_size_t n); | ||

1166 | //Multiplication of two natural numbers. Value returned is the most | ||

1167 | //significant limb of the array of predicted size un+vn, rather than | ||

1168 | //the spillover (this is unlike most functions). | ||

1169 | DECMOD_GMP_INTS | ||

1170 | GMP_INTS_limb_t GMP_INTS_mpn_mul(GMP_INTS_limb_ptr prodp, | ||

1171 | GMP_INTS_limb_srcptr up, | ||

1172 | GMP_INTS_size_t un, | ||

1173 | GMP_INTS_limb_srcptr vp, | ||

1174 | GMP_INTS_size_t vn); | ||

1175 | |||

1176 | /******************************************************************/ | ||

1177 | /*** LIMB SPACE REALLOCATION FUNCTIONS *************************/ | ||

1178 | /******************************************************************/ | ||

1179 | DECMOD_GMP_INTS | ||

1180 | void *GMP_INTS_mpz_realloc (GMP_INTS_mpz_struct *m, | ||

1181 | GMP_INTS_size_t new_size); | ||

1182 | //Changes the number of limbs allocated. | ||

1183 | |||

1184 | /******************************************************************/ | ||

1185 | /*** PUBLIC INITIALIZATION AND MEMORY MANAGEMENT FUNCTIONS *****/ | ||

1186 | /******************************************************************/ | ||

1187 | //Allocate space for an integer and sets it to zero. | ||

1188 | //This must be the first call made. | ||

1189 | DECMOD_GMP_INTS | ||

1190 | void GMP_INTS_mpz_init (GMP_INTS_mpz_struct *x); | ||

1191 | |||

1192 | //Deallocates space for an integer. This must be the | ||

1193 | //final call made. | ||

1194 | DECMOD_GMP_INTS | ||

1195 | void GMP_INTS_mpz_clear (GMP_INTS_mpz_struct *x); | ||

1196 | |||

1197 | |||

1198 | /******************************************************************/ | ||

1199 | /*** PUBLIC ASSIGNMENT FUNCTIONS *******************************/ | ||

1200 | /******************************************************************/ | ||

1201 | //Copies from one integer to another. Must both be allocated and \ | ||

1202 | //not be the same variable. | ||

1203 | DECMOD_GMP_INTS | ||

1204 | void GMP_INTS_mpz_copy( GMP_INTS_mpz_struct *dst, | ||

1205 | const GMP_INTS_mpz_struct *src); | ||

1206 | |||

1207 | //Assigns the integer to be the value of an unsigned long. | ||

1208 | DECMOD_GMP_INTS | ||

1209 | void GMP_INTS_mpz_set_ui (GMP_INTS_mpz_struct *dest, | ||

1210 | unsigned long int val); | ||

1211 | |||

1212 | //Assigns the integer to be the value of a signed long. | ||

1213 | DECMOD_GMP_INTS | ||

1214 | void GMP_INTS_mpz_set_si (GMP_INTS_mpz_struct *dest, | ||

1215 | signed long int val); | ||

1216 | //Assigns the integer to be the value of a simple string | ||

1217 | //(simple = no E notation). Only form handled is | ||

1218 | // [-]digits. | ||

1219 | //Other forms will not cause catastrophic failure but might | ||

1220 | //not behave as expected. | ||

1221 | DECMOD_GMP_INTS | ||

1222 | void GMP_INTS_mpz_set_simple_char_str(GMP_INTS_mpz_struct *z, | ||

1223 | const char *s); | ||

1224 | //Assigns an arbitary integer to be a number with E notation. | ||

1225 | //*failure set non-zero if can't parse or set. Number must | ||

1226 | //be pure integer--no lost precison when scientific notation | ||

1227 | //is processed. | ||

1228 | void GMP_INTS_mpz_set_sci_not_num(GMP_INTS_mpz_struct *z, | ||

1229 | int *failure, | ||

1230 | const char *s); | ||

1231 | |||

1232 | //Attempts to parse an integer using the following three | ||

1233 | //formats: a)simple integer, b)simple integer with commas, | ||

1234 | //c)integer in scientific notation. Returns the value of | ||

1235 | //the integer if parse successful, or 0 and a failure flag | ||

1236 | //otherwise. | ||

1237 | void GMP_INTS_mpz_set_general_int(GMP_INTS_mpz_struct *z, | ||

1238 | int *failure, | ||

1239 | const char *s); | ||

1240 | |||

1241 | //Attempts to parse an integer as either a simple integer, | ||

1242 | //an integer with commas, or a number in scientific notation | ||

1243 | //into a UINT32. If the number cannot be parsed into that, | ||

1244 | //the result is zero and failure is true. | ||

1245 | void GMP_INTS_mpz_parse_into_uint32(unsigned *result, | ||

1246 | int *failure, | ||

1247 | char *s); | ||

1248 | |||

1249 | //Swaps a and b. What this does is a swap of the area | ||

1250 | //pointed to (i.e. the control block). Pointers held in | ||

1251 | //these blocks are therefore automatically swapped. | ||

1252 | DECMOD_GMP_INTS | ||

1253 | void GMP_INTS_mpz_swap(GMP_INTS_mpz_struct *a, | ||

1254 | GMP_INTS_mpz_struct *b); | ||

1255 | |||

1256 | /****************************************************************/ | ||

1257 | /*** PUBLIC INTEGER ARITHMETIC FUNCTIONS ********************/ | ||

1258 | /****************************************************************/ | ||

1259 | //Adds two arbitrary integers to produce an arbitrary result. | ||

1260 | //The result space must be initialized already. | ||

1261 | DECMOD_GMP_INTS | ||

1262 | void GMP_INTS_mpz_add ( GMP_INTS_mpz_struct *w, | ||

1263 | const GMP_INTS_mpz_struct *u, | ||

1264 | const GMP_INTS_mpz_struct *v); | ||

1265 | |||

1266 | //Adds the integer v to u and produces w. u and w must be | ||

1267 | //be created already. | ||

1268 | void GMP_INTS_mpz_add_ui ( GMP_INTS_mpz_struct *w, | ||

1269 | const GMP_INTS_mpz_struct *u, | ||

1270 | unsigned long int v); | ||

1271 | |||

1272 | //Subtracts two aribtrary integers to produce an arbitrary | ||

1273 | //result. The result space must be initialized already. | ||

1274 | DECMOD_GMP_INTS | ||

1275 | void GMP_INTS_mpz_sub ( GMP_INTS_mpz_struct *w, | ||

1276 | const GMP_INTS_mpz_struct *u, | ||

1277 | const GMP_INTS_mpz_struct *v); | ||

1278 | |||

1279 | //Subtracts the integer v from u to produce w. u and w must | ||

1280 | //be created already. | ||

1281 | void GMP_INTS_mpz_sub_ui ( GMP_INTS_mpz_struct *w, | ||

1282 | const GMP_INTS_mpz_struct *u, | ||

1283 | unsigned long int v); | ||

1284 | |||

1285 | //Multiplies two arbitrary integers to produce an arbitrary | ||

1286 | //result. The result space must be initialized already. | ||

1287 | DECMOD_GMP_INTS | ||

1288 | void GMP_INTS_mpz_mul ( GMP_INTS_mpz_struct *w, | ||

1289 | const GMP_INTS_mpz_struct *u, | ||

1290 | const GMP_INTS_mpz_struct *v); | ||

1291 | |||

1292 | //Multiplies the arbitrary integer by a C-native signed | ||

1293 | //long. | ||

1294 | DECMOD_GMP_INTS | ||

1295 | void GMP_INTS_mpz_mul_si ( GMP_INTS_mpz_struct *w, | ||

1296 | const GMP_INTS_mpz_struct *u, | ||

1297 | long int v); | ||

1298 | //Multiplies the arbitrary integer by a C-native unsigned | ||

1299 | //long. | ||

1300 | DECMOD_GMP_INTS | ||

1301 | void GMP_INTS_mpz_mul_ui ( GMP_INTS_mpz_struct *w, | ||

1302 | const GMP_INTS_mpz_struct *u, | ||

1303 | unsigned long int v); | ||

1304 | |||

1305 | //Divides integers. | ||

1306 | DECMOD_GMP_INTS | ||

1307 | void GMP_INTS_mpz_tdiv_qr ( GMP_INTS_mpz_struct *quot, | ||

1308 | GMP_INTS_mpz_struct *rem, | ||

1309 | const GMP_INTS_mpz_struct *num, | ||

1310 | const GMP_INTS_mpz_struct *den); | ||

1311 | |||

1312 | //Calculates the factorial. All values <=1 result in a | ||

1313 | //value of 1. | ||

1314 | DECMOD_GMP_INTS | ||

1315 | void GMP_INTS_mpz_fac_ui(GMP_INTS_mpz_struct *result, | ||

1316 | unsigned long int n); | ||

1317 | |||

1318 | //Exponentiates a base to an exponent. 0^0=1, N^0=1. The algorithm | ||

1319 | //used is successive squaring and multiplying. Not the MOST efficient, | ||

1320 | //but OK. The result and the base must be different variables. | ||

1321 | DECMOD_GMP_INTS | ||

1322 | void GMP_INTS_mpz_pow_ui( GMP_INTS_mpz_struct *result, | ||

1323 | const GMP_INTS_mpz_struct *base, | ||

1324 | unsigned exponent); | ||

1325 | |||

1326 | //Takes the absolute value of the arbitrary integer passed. | ||

1327 | DECMOD_GMP_INTS | ||

1328 | void GMP_INTS_mpz_abs(GMP_INTS_mpz_struct *arg); | ||

1329 | |||

1330 | //Calculates the gcd() of the two arguments. If either argument is zero, the | ||

1331 | //result is automatically 1. If either argument is negative, its absolute | ||

1332 | //value is used. The two input pointers may not be the same, because doing | ||

1333 | //that is senseless--it would become a copy operation, because gcd(x,x) = x. | ||

1334 | //However, the result may be the same as either of the two inputs. | ||

1335 | DECMOD_GMP_INTS | ||

1336 | void GMP_INTS_mpz_gcd(GMP_INTS_mpz_struct *result, | ||

1337 | const GMP_INTS_mpz_struct *arg1, | ||

1338 | const GMP_INTS_mpz_struct *arg2); | ||

1339 | |||

1340 | |||

1341 | /******************************************************************/ | ||

1342 | /*** PUBLIC CONVERSION AND OUTPUT FUNCTIONS ********************/ | ||

1343 | /******************************************************************/ | ||

1344 | |||

1345 | //Get an upper bound on the number of characters required for | ||

1346 | //representing an integer, including minus sign and commas, | ||

1347 | //Terminating zero, etc. This is just a little wasteful, but | ||

1348 | //will always reserve enough memory. | ||

1349 | DECMOD_GMP_INTS | ||

1350 | int GMP_INTS_mpz_size_in_base_10(const GMP_INTS_mpz_struct *arg); | ||

1351 | |||

1352 | //Convert from integer to string. Commas must be | ||

1353 | //added separately, and there is enough space reserved for | ||

1354 | //them. This function is only warrantied not to overflow | ||

1355 | //a buffer allocated using the function above as a sizing | ||

1356 | //guide. | ||

1357 | DECMOD_GMP_INTS | ||

1358 | void GMP_INTS_mpz_to_string(char *out, | ||

1359 | const GMP_INTS_mpz_struct *in); | ||

1360 | |||

1361 | //Prints the integer passed to the stream in a long-hand | ||

1362 | //format. | ||

1363 | DECMOD_GMP_INTS | ||

1364 | void GMP_INTS_mpz_long_int_format_to_stream(FILE *s, | ||

1365 | const GMP_INTS_mpz_struct *i, | ||

1366 | const char *desc); | ||

1367 | |||

1368 | //Prints the integer raw to a stream--just digits, no extra chars. | ||

1369 | DECMOD_GMP_INTS | ||

1370 | void GMP_INTS_mpz_arb_int_raw_to_stream(FILE *s, | ||

1371 | const GMP_INTS_mpz_struct *i); | ||

1372 | |||

1373 | /******************************************************************/ | ||

1374 | /*** COMPARISON AND SIZING FUNCTIONS ***************************/ | ||

1375 | /******************************************************************/ | ||

1376 | //Returns 1 if arbitrary integer will fit in an unsigned integer, | ||

1377 | //or 0 otherwise. | ||

1378 | DECMOD_GMP_INTS | ||

1379 | int GMP_INTS_mpz_fits_uint_p (const GMP_INTS_mpz_struct *src); | ||

1380 | |||

1381 | //Returns 1 if arbitrary integer will fit in a signed integer, | ||

1382 | //or 0 otherwise. | ||

1383 | DECMOD_GMP_INTS | ||

1384 | int GMP_INTS_mpz_fits_sint_p (const GMP_INTS_mpz_struct *src); | ||

1385 | |||

1386 | //Retrieves an unsigned version of limb zero from the number, | ||

1387 | //or will return zero if the number is zero. This is the | ||

1388 | //officially sanctioned way to get the value if it fits in | ||

1389 | //an unsigned. | ||

1390 | DECMOD_GMP_INTS | ||

1391 | unsigned GMP_INTS_mpz_get_limb_zero(const GMP_INTS_mpz_struct *src); | ||

1392 | |||

1393 | //Returnes neg value if u<v, 0 if u==v, and 1 if u>v. | ||

1394 | DECMOD_GMP_INTS | ||

1395 | int GMP_INTS_mpz_cmp (const GMP_INTS_mpz_struct *u, | ||

1396 | const GMP_INTS_mpz_struct *v); | ||

1397 | |||

1398 | //Compares an arbitrary integer to an unsigned long | ||

1399 | //and returns relative ordering, <0 if u < v, 0 if u==v, | ||

1400 | //and >0 if u > v. | ||

1401 | DECMOD_GMP_INTS | ||

1402 | int GMP_INTS_mpz_cmp_ui (const GMP_INTS_mpz_struct *u, | ||

1403 | unsigned long int v_digit); | ||

1404 | //Compares arbitrary integer to a signed long | ||

1405 | //and returns relative ordering, <0 if u<v, 0 if u==v, | ||

1406 | //and >0 if u>v. | ||

1407 | DECMOD_GMP_INTS | ||

1408 | int GMP_INTS_mpz_cmp_si (const GMP_INTS_mpz_struct *u, | ||

1409 | signed long int v_digit); | ||

1410 | |||

1411 | //Compares the absolute value of two arbitrary integers. | ||

1412 | DECMOD_GMP_INTS | ||

1413 | int GMP_INTS_mpz_cmpabs (const GMP_INTS_mpz_struct *u, | ||

1414 | const GMP_INTS_mpz_struct *v); | ||

1415 | //Compares the absolute value of an arbitrary integer and | ||

1416 | //an unsigned long. | ||

1417 | DECMOD_GMP_INTS | ||

1418 | int GMP_INTS_mpz_cmpabs_ui(const GMP_INTS_mpz_struct *u, | ||

1419 | unsigned long int v_digit); | ||

1420 | |||

1421 | /****************************************************************/ | ||

1422 | /*** VERSION CONTROL REPORTING FUNCTIONS ********************/ | ||

1423 | /****************************************************************/ | ||

1424 | DECMOD_GMP_INTS const char *GMP_INTS_cvcinfo(void); | ||

1425 | DECMOD_GMP_INTS const char *GMP_INTS_hvcinfo(void); | ||

1426 | |||

1427 | /* Preprocessor string to allow the H-file version to be | ||

1428 | ** compiled into the C-file. | ||

1429 | */ | ||

1430 | #define GMP_INTS_H_VERSION ("$Header: /cvsroot/esrg/sfesrg/esrgpcpj/shared/c_datd/gmp_ints.h,v 1.23 2001/08/16 19:49:40 dtashley Exp $") | ||

1431 | |||

1432 | #endif /* GMP_INTS_H_INCLUDED */ | ||

1433 | |||

1434 | |||

1435 | //************************************************************************** | ||

1436 | // $Log: gmp_ints.h,v $ | ||

1437 | // Revision 1.23 2001/08/16 19:49:40 dtashley | ||

1438 | // Beginning to prepare for v1.05 release. | ||

1439 | // | ||

1440 | // Revision 1.22 2001/08/15 06:56:05 dtashley | ||

1441 | // Substantial progress. Safety check-in. | ||

1442 | // | ||

1443 | // Revision 1.21 2001/08/07 10:42:48 dtashley | ||

1444 | // Completion of CFRATNUM extensions and DOS command-line utility. | ||

1445 | // | ||

1446 | // Revision 1.20 2001/07/30 02:51:18 dtashley | ||

1447 | // INTGCD extension and command-line utility finished up. | ||

1448 | // | ||

1449 | // Revision 1.19 2001/07/29 07:18:22 dtashley | ||

1450 | // Completion of ARBINT INTFAC extension. | ||

1451 | // | ||

1452 | // Revision 1.18 2001/07/25 23:40:02 dtashley | ||

1453 | // Completion of INTFAC program, many changes to handling of large | ||

1454 | // integers. | ||

1455 | // | ||

1456 | // Revision 1.17 2001/07/21 03:32:44 dtashley | ||

1457 | // Addition of several files. | ||

1458 | // | ||

1459 | // Revision 1.16 2001/07/21 01:39:01 dtashley | ||

1460 | // Safety check-in. Major function to output an integer as rows of digits | ||

1461 | // has been completed. This was the last major function that needed to be | ||

1462 | // completed before useful command-line utilities can be constructed. | ||

1463 | // | ||

1464 | // Revision 1.15 2001/07/19 20:06:03 dtashley | ||

1465 | // Division finished. String formatting functions underway. Safety check-in. | ||

1466 | // | ||

1467 | // Revision 1.14 2001/07/18 21:53:09 dtashley | ||

1468 | // Division function finished and passes preliminary tests. Safety check-in. | ||

1469 | // | ||

1470 | // Revision 1.13 2001/07/17 22:30:14 dtashley | ||

1471 | // Safety check-in. Division function under construction. | ||

1472 | // | ||

1473 | // Revision 1.12 2001/07/16 17:46:46 dtashley | ||

1474 | // Multiplication finished, and only indirectly unit-tested. More detailed unit | ||

1475 | // test must follow, but expect no problems. | ||

1476 | // | ||

1477 | // Revision 1.11 2001/07/16 00:28:22 dtashley | ||

1478 | // Safety check-in. Addition and subtraction functions finished. | ||

1479 | // | ||

1480 | // Revision 1.10 2001/07/15 06:40:10 dtashley | ||

1481 | // Adaptation of GNU arbitrary-size integer package integrated into IjuScripter | ||

1482 | // and IjuConsole. | ||

1483 | // | ||

1484 | // Revision 1.9 2001/07/15 00:59:52 dtashley | ||

1485 | // Safety check-in. Commit before working on laptop. | ||

1486 | // | ||

1487 | // Revision 1.8 2001/07/14 07:03:37 dtashley | ||

1488 | // Safety check-in. Modifications and progress. | ||

1489 | // | ||

1490 | // Revision 1.7 2001/07/14 02:05:02 dtashley | ||

1491 | // Safety check-in. Almost ready for first unit-testing. | ||

1492 | // | ||

1493 | // Revision 1.6 2001/07/13 21:02:20 dtashley | ||

1494 | // Version control reporting changes. | ||

1495 | // | ||

1496 | // Revision 1.5 2001/07/13 18:17:16 dtashley | ||

1497 | // Safety check-in. Additionally, new files added. | ||

1498 | // | ||

1499 | // Revision 1.4 2001/07/13 06:54:57 dtashley | ||

1500 | // Safety check-in. Substantial progress and modifications. | ||

1501 | // | ||

1502 | // Revision 1.3 2001/07/13 00:57:08 dtashley | ||

1503 | // Safety check-in. Substantial progress on port. | ||

1504 | // | ||

1505 | // Revision 1.2 2001/07/12 06:44:12 dtashley | ||

1506 | // Safety check-in. | ||

1507 | // | ||

1508 | // Revision 1.1 2001/07/12 05:07:02 dtashley | ||

1509 | // Initial checkin. | ||

1510 | // | ||

1511 | //************************************************************************** | ||

1512 | // End of GMP_INTS.H. |

dashley@gmail.com | ViewVC Help |

Powered by ViewVC 1.1.25 |