kc3-lang/libtommath/tommath_class.h
Branch :
Log
| Author | Commit | Date | CI | Message |
|---|---|---|---|---|
 |
cb1b2dc8 | 2019-10-15 14:04:32 | mp_log_u32: return uint32_t | |
 |
c9d41fba | 2019-10-15 10:40:40 | rename mp_ilogb() to mp_log_u32() | |
|
049e2e85 | 2019-10-15 14:02:22 | add back missing symbols | |
|
fe2f91a1 | 2019-10-09 20:22:11 | to_sbin/to_ubin/pack: don't write anything in case of buffer overflow | |
 |
b6813a41 | 2019-09-27 03:40:08 | replace mp_export/import by mp_pack/unpack | |
|
d68e2877 | 2019-10-02 05:47:04 | bugfix for an edgecase | |
|
abdb0334 | 2019-09-25 00:29:19 | Refactored functions to read and write binaries and added "maxlen" | |
|
702e5391 | 2019-09-06 10:22:45 | add function pointers to tommath_class.h | |
 |
49abba09 | 2019-09-02 18:32:33 | refactor with mp_init_multi | |
|
f0e6ae59 | 2019-09-02 14:36:06 | add `mp_to_radix()` ...a 100% copy&paste of `mp_toradix_n()` besides the changed API signature | |
|
8c1b296e | 2019-04-08 23:48:39 | add feature detection macro MP_HAS | |
|
ca89e9c0 | 2019-07-03 13:10:05 | rename mp_root/mp_expt to mp_*_u32 | |
|
71696549 | 2019-05-29 20:36:18 | deprecate mp_expt_d and mp_n_root in favor of mp_expt and mp_root | |
 |
0db64fc8 | 2019-07-03 14:45:14 | Rename bn_get_magxx -> bn_get_mag_uxx. Documentation updated too | |
|
fde85249 | 2019-06-13 16:58:06 | @minad 's suggestions | |
|
db4afb3d | 2019-06-12 13:11:58 | Provide explicit symbols for bn_xxx_l and bn_xxx_ll functions. | |
|
3ef6efd3 | 2019-06-06 23:01:51 | sort tommath_class.h dependencies: this makes it easier to see changes | |
|
0d06d67e | 2019-06-06 12:44:36 | generate tommath_class from pre-processed code | |
|
30e8fbbc | 2019-06-06 12:09:39 | Update makefiles etc | |
|
c7314fa4 | 2019-05-25 06:42:01 | deprecate mp_n_root_ex and mp_expt_d_ex These functions were introduced to give some timing guarantees. However the guarantees are too weak to be useful. The functions seem to be unused essentially by downstream users. | |
|
bcec605a | 2019-05-22 15:34:49 | deprecate mp_prime_is_divisible and ltm_prime_tab * it is an implementation detail used for prime testing * there is upcoming work by @czurnieden regarding a generalised prime sieve * furthermore remove jacobi test (replaced by kronecker) | |
|
0a9f5e9b | 2019-05-24 10:21:54 | use u32 i64 suffix | |
|
b58c9966 | 2019-05-23 23:39:47 | use int32 and uint32 instead of sint and uint | |
|
3289c959 | 2019-05-20 10:41:06 | introduce various mp_set_sint/mp_set_uint functions with precise types | |
|
991aea53 | 2019-05-22 08:23:37 | explicit condition | |
|
228e487b | 2019-05-16 23:51:02 | faster Toom-Cook 3 algorithm | |
|
1af0de1f | 2019-05-20 19:11:25 | deprecate mp_tc_(and|or|xor) in favor of mp_(and|or|xor) * same behavior for positive numbers * generalisation for negative numbers, treating them as two complement * improve algorithm, iterate once over the digits, manually perform two complement * simplify mp_add_d, mp_sub_d * functions are safe in case of a==c or b==c * renamed mp_tc_div_2d to mp_signed_rsh (signed right shift) | |
|
6552f55f | 2019-05-20 08:38:25 | handle EOF condition in mp_fread, fix #163 | |
|
c1f5b06d | 2019-05-20 05:36:08 | refactor with mp_init_multi | |
|
f55f0a9e | 2019-05-18 09:28:33 | fix some usages of enum types | |
|
a8239c24 | 2019-05-13 11:32:42 | deprecate mp_get_bit The return type of mp_get_bit was imprecise (either mp_err or mp_bool), therefore this function is deprecated in favor of s_mp_get_bit for now. If we need s_mp_get_bit to be public, we should add it under a different name. However since mp_set_bit is not available, I don't think there any downstream users (ab)using mp_int as bitsets. | |
|
56e7a401 | 2019-05-13 02:46:11 | deprecate mp_jacobi | |
|
75e85a73 | 2019-05-13 11:18:34 | move mp_prime_random_ex to bn_deprecated.c | |
|
2a2e2716 | 2019-05-12 11:33:17 | move jenkins prng to bn_s_mp_rand_jenkins.c | |
|
c8cc3657 | 2019-05-11 09:09:12 | mov s_mp_rand_source_platform to separate file | |
|
0669e92e | 2019-05-08 20:18:53 | deprecate mp_prime_random_ex in favor of mp_prime_rand We can use the internal mp_rand generator now, since it generates numbers which are safe for crypto purposes. | |
|
2a0021a4 | 2019-05-08 14:57:04 | mp_rand: remove superflous mp_clamp | |
|
9ddf1e58 | 2019-05-07 12:26:46 | support custom random data source via mp_rand_source * deprecate MP_PRNG_ENABLE_LTM_RNG * custom mp_rand_source is used always if set, which should be more aligned with user expectations * use custom source in tune.c * don't call random number generator once per digit, which is slow | |
|
2ea04fb7 | 2019-05-07 10:42:26 | dep.pl: strip comments | |
|
c7596983 | 2019-05-07 10:28:32 | fix dep.pl - use lookahead to only generated dependencies for 'mp_*(' | |
|
818d8fb7 | 2019-05-03 17:39:10 | Rework handling of tunable cutoffs * In the default settings, a cutoff X can be modified at runtime by adjusting the corresponding X_CUTOFF variable. * Tunability of the library can be disabled at compile time by defining the MP_FIXED_CUTOFFS macro. * There is an additional file tommath_cutoffs.h, which defines the default cutoffs. These can be adjusted manually or by the autotuner. | |
|
e05b1e18 | 2019-04-12 19:07:08 | fix includes as of @czurnieden "there's always leftovers" and he's right that's a leftover of #127 | |
|
fbfcb661 | 2019-04-12 14:56:29 | apply rename | |
|
3afec571 | 2019-04-10 15:19:23 | Re-generate callgraph and tommath_class.h | |
|
35311aea | 2019-04-03 23:50:57 | added function mp_ilogb | |
|
27ca25cb | 2019-04-06 18:55:43 | added multiplcation balancing for the Toom-Cook algorithms | |
|
ff561404 | 2019-04-07 15:29:11 | shorter headers | |
|
70a30ae7 | 2019-04-07 02:29:28 | remove footers | |
|
984d3ff6 | 2019-04-01 03:41:26 | changed seed to make nth-root usable | |
|
58e9084e | 2019-04-06 17:38:41 | run `make new_file` | |
|
769218cc | 2019-04-03 18:59:09 | additional functions mp_incr and mp_decr | |
|
646ac880 | 2019-04-04 07:55:02 | update callgraph and tommath_class | |
|
6ce271c4 | 2018-12-28 09:41:54 | mp_iseven & mp_isodd becomes C functions | |
|
b879bd49 | 2018-12-31 12:15:44 | refactor with new macros IS_* | |
|
487cbba0 | 2018-12-28 09:34:02 | refactor without macro mp_isneg | |
|
662a1709 | 2019-01-15 18:28:31 | run `make new_file` | |
 |
1c8c5348 | 2019-01-15 18:20:24 | Merge pull request #147 from czurnieden/moarvm_workarounds workaround for the MoarVM problem with MP_GEN_RAND et al. (cherry picked from commit 11d6e0391421bc996b2cf780f3f4c3fa634001d0) | |
|
c93afda1 | 2019-01-15 17:05:39 | run `make new_file` | |
|
08eb995d | 2019-01-13 20:21:36 | implemented Steffen Jaeckels superior suggestion regarding MoarVM's problem | |
|
6a9deb79 | 2018-12-26 15:44:26 | fix & run dep.pl | |
|
18355de6 | 2018-12-29 17:56:20 | Update file headers [skip ci] | |
|
4f245b04 | 2018-12-02 21:18:32 | Update makefiles etc. | |
|
3ec93dab | 2018-12-12 00:14:05 | bugfix in bn_mp_kronecker.c, cleanup and formatting in div. files | |
 |
0493739d | 2018-12-02 13:10:09 | add missing comments | |
 |
adbadc70 | 2018-11-18 01:30:51 | Fix includes Header files which are located in the same directory that the file from where it is included must be included using `" "`, not `< >`. Otherwise the compiler (gcc 5) cannot understand `#include <tommath_class.h>` in `/usr/include/tommath/tommath.h`. | |
|
81cdb9ac | 2018-09-10 18:52:29 | regenerate files | |
|
109bfa57 | 2018-09-10 18:49:10 | regenerate files | |
|
22550d41 | 2018-05-02 22:01:09 | Do not use tommath.h from the system for building | |
|
9034e712 | 2018-05-02 21:43:17 | Do not use installed headers for building | |
|
82a2d385 | 2017-08-30 05:56:38 | refactor indentation of preprocessor directives | |
|
49e54320 | 2017-08-28 16:59:11 | update tommath_class.h | |
|
3ab918e7 | 2017-04-09 01:00:00 | update tommath_class.h | |
|
1f889479 | 2015-04-18 11:03:22 | update makefiles etc. | |
|
d4cccd52 | 2014-12-10 18:59:56 | udpate makefiles etc. | |
|
cf045216 | 2014-12-10 17:21:14 | update makefiles etc. | |
|
d7171985 | 2014-10-18 18:56:56 | update after removing balance multiplication | |
|
b425b0ea | 2014-10-18 18:54:06 | Revert "balancing multiplication like that in Ruby 1.9" This reverts commit e68439aae10d003250afa6c1f57025bfee5f82ed. Conflicts: bn_mp_balance_mul.c makefile | |
 |
e9b1837c | 2014-02-13 20:21:18 | mp_expt_d: bring back pre 921be35779f7d71080ad85c27ed58671602d59b3 state The implementation of the expt_d functionality is now implemented in the mp_expt_d_ex() function. The user can now choose between the old (more timing resistant) version and the new version by modification of the parameter 'fast'. mp_expt_d() defaults to the old version | |
|
52cfd5ff | 2014-02-14 11:26:07 | mp_n_root: add mp_n_root_ex() with parameter 'fast' for mp_expt_d_ex() This change is introduced to be able to choose the underlying implementation of mp_expt_d_ex() The implementation of the root_n functionality is now implemented in the mp_n_root_ex() function. The parameter 'fast' is just passed over to mp_expt_d_ex(). mp_n_root() defaults to the pre 921be35779f7d71080ad85c27ed58671602d59b3 implementation | |
|
c8202864 | 2014-01-22 17:53:34 | add missing updates | |
 |
e68439aa | 2011-05-23 19:44:05 | balancing multiplication like that in Ruby 1.9 | |
 |
3e1ae078 | 2013-01-22 21:29:12 | added mp_import / mp_export | |
 |
9294e791 | 2005-08-01 16:37:28 | added libtommath-0.36 | |
|
fdfa2f4f | 2005-03-12 11:55:11 | added libtommath-0.35 | |
|
3d0fcaab | 2005-02-12 08:40:15 | added libtommath-0.34 | |
|
4b7111d9 | 2004-12-23 02:40:37 | added libtommath-0.33 | |
|
e549ccfe | 2004-10-29 22:07:18 | added libtommath-0.32 |