/barrelfish-master/lib/tommath/ |
H A D | bn_mp_read_radix.c | 18 /* read a string [ASCII] in a given radix */ 19 int mp_read_radix (mp_int * a, const char *str, int radix) argument 27 /* make sure the radix is ok */ 28 if (radix < 2 || radix > 64) { 47 /* if the radix < 36 the conversion is case insensitive 51 ch = (char) ((radix < 36) ? toupper ((int)*str) : *str); 59 * and is less than the given radix add it 62 if (y < radix) { 63 if ((res = mp_mul_d (a, (mp_digit) radix, [all...] |
H A D | bn_mp_radix_size.c | 19 int mp_radix_size (mp_int * a, int radix, int *size) argument 28 if (radix == 2) { 33 /* make sure the radix is in range */ 34 if (radix < 2 || radix > 64) { 61 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
|
H A D | bn_mp_fwrite.c | 18 int mp_fwrite(mp_int *a, int radix, FILE *stream) argument 23 if ((err = mp_radix_size(a, radix, &len)) != MP_OKAY) { 32 if ((err = mp_toradix(a, buf, radix)) != MP_OKAY) {
|
H A D | bn_mp_fread.c | 19 int mp_fread(mp_int *a, int radix, FILE *stream) argument 36 /* find y in the radix map */ 37 for (y = 0; y < radix; y++) { 42 if (y == radix) { 47 if ((err = mp_mul_d(a, radix, a)) != MP_OKAY) {
|
H A D | bn_mp_toradix.c | 18 /* stores a bignum as a ASCII string in a given radix (2..64) */ 19 int mp_toradix (mp_int * a, char *str, int radix) argument 26 /* check range of the radix */ 27 if (radix < 2 || radix > 64) { 51 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
|
H A D | bn_mp_toradix_n.c | 18 /* stores a bignum as a ASCII string in a given radix (2..64) 22 int mp_toradix_n(mp_int * a, char *str, int radix, int maxlen) argument 29 /* check range of the maxlen, radix */ 30 if (maxlen < 2 || radix < 2 || radix > 64) { 64 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
|
H A D | tommath.h | 518 /* ---> radix conversion <--- */ 531 int mp_read_radix(mp_int *a, const char *str, int radix); 532 int mp_toradix(mp_int *a, char *str, int radix); 533 int mp_toradix_n(mp_int * a, char *str, int radix, int maxlen); 534 int mp_radix_size(mp_int *a, int radix, int *size); 536 int mp_fread(mp_int *a, int radix, FILE *stream); 537 int mp_fwrite(mp_int *a, int radix, FILE *stream);
|
H A D | bn.tex | 1066 ``polynomial basis''. This simply means a field element is stored by divisions of a radix. For example, if 1068 the polynomial basis representation of $z$ if $f(\beta) = z$ for a given radix $\beta$. 1400 where $R = \beta^n$, $n$ is the n number of digits in $m$ and $\beta$ is radix used (default is $2^{28}$). 1497 form $\beta^k - p$ for some $k \ge 0$ and $0 < p < \beta$ where $\beta$ is the radix (default to $2^{28}$). 1516 dimminished radix form and $a$ must be in the range $0 \le a < b^2$. Dimminished radix reductions are 1568 moduli of the a ``restricted dimminished radix'' form lead to the fastest modular exponentiations. Followed by Montgomery 1710 int mp_toradix (mp_int * a, char *str, int radix); 1712 This still store $a$ in ``str'' as a base-``radix'' string of ASCII chars. This function appends a NUL character 1713 to terminate the string. Valid values of ``radix'' lin [all...] |
H A D | tommath.tex | 286 the integer $x \equiv \sum_{i=0}^{n-1} x_i\beta^i$. The elements of the array $x$ are said to be the radix $\beta$ digits 308 The variable $\beta$ represents the radix of a single digit of a multiple precision integer and 311 $0 \le x < q \beta^2$. The extra radix-$q$ factor allows additions and subtractions to proceed without truncation of the 567 As a well known analogy, school children are taught how to form numbers larger than nine by prepending more radix ten digits. In the decimal system 572 precision computer words with the exception that a different radix is used. 1627 logical shifts respectively. A logical shift is analogous to sliding the decimal point of radix-10 representations. For example, the real 2016 are on radix-$\beta$ digits. 2020 In a binary system where the radix is a power of two multiplication by two not only arises often in other algorithms it is a fairly efficient 2138 polynomial basis representation for $89$ using radix ten. That is, $f(10) = 8(10) + 9 = 89$. 2590 Each row of the product is added to the result after being shifted to the left (\textit{multiplied by a power of the radix}) b [all...] |
/barrelfish-master/lib/tommath/mtest/ |
H A D | mpi.h | 210 mp_err mp_read_radix(mp_int *mp, unsigned char *str, int radix); 211 int mp_radix_size(mp_int *mp, int radix); 212 int mp_value_radix_size(int num, int qty, int radix); 213 mp_err mp_toradix(mp_int *mp, unsigned char *str, int radix);
|
H A D | mpi.c | 39 function. Since a number n in radix r takes up about log_r(n) 104 /* Value to digit maps for radix conversion */ 2231 stream 'ofp'. Output is generated using the internal radix. 2448 /* {{{ mp_read_radix(mp, str, radix) */ 2451 mp_read_radix(mp, str, radix) 2459 mp_err mp_read_radix(mp_int *mp, unsigned char *str, int radix) argument 2465 ARGCHK(mp != NULL && str != NULL && radix >= 2 && radix <= MAX_RADIX, 2472 (s_mp_tovalue(str[ix], radix) < 0) && 2486 while((val = s_mp_tovalue(str[ix], radix)) > 2507 mp_radix_size(mp_int *mp, int radix) argument 2532 mp_value_radix_size(int num, int qty, int radix) argument 2544 mp_toradix(mp_int *mp, unsigned char *str, int radix) argument [all...] |
/barrelfish-master/lib/devif/backends/net/mlx4/include/linux/ |
H A D | linux_radix.c | 40 #include <linux/radix-tree.h> 46 static MALLOC_DEFINE(M_RADIX, "radix", "Linux radix compat"); 143 /* expand radix tree as needed */ 145 /* check if the radix tree is getting too big */ 150 * If the root radix level is not empty, we need to 151 * allocate a new radix level: 164 /* get radix tree height index */ 175 /* allocate the missing radix levels, if any */ 191 /* setup new radix level [all...] |
/barrelfish-master/lib/tommath/pre_gen/ |
H A D | mpi.c | 2574 /* modified diminished radix reduction */ 3052 int mp_fread(mp_int *a, int radix, FILE *stream) argument 3069 /* find y in the radix map */ 3070 for (y = 0; y < radix; y++) { 3075 if (y == radix) { 3080 if ((err = mp_mul_d(a, radix, a)) != MP_OKAY) { 3122 int mp_fwrite(mp_int *a, int radix, FILE *stream) argument 3127 if ((err = mp_radix_size(a, radix, &len)) != MP_OKAY) { 3136 if ((err = mp_toradix(a, buf, radix)) != MP_OKAY) { 4120 * Let B represent the radix [ 6218 mp_radix_size(mp_int * a, int radix, int *size) argument 6387 mp_read_radix(mp_int * a, const char *str, int radix) argument 8367 mp_toradix(mp_int * a, char *str, int radix) argument 8449 mp_toradix_n(mp_int * a, char *str, int radix, int maxlen) argument [all...] |
/barrelfish-master/usr/eclipseclp/Kernel/src/ |
H A D | write.c | 1990 int radix; local 2314 case 'r': /* radix printing */ 2322 radix = elem->val.nint; 2325 radix = 8; 2328 Get_Counter(par+1,npar,radix); 2330 if (radix < 2 || radix > 'z' - 'a' + 11) { 2337 int bufsize = 1 + tag_desc[TagType(elem->tag)].string_size(elem->val, elem->tag, radix); 2339 int len = tag_desc[TagType(elem->tag)].to_string(elem->val, elem->tag, buf, radix);
|
/barrelfish-master/usr/eclipseclp/Contrib/ |
H A D | rdtok.pl | 33 In particular, radix notation is EXACTLY as in Dec-10 Prolog version 3.53. 318 % read_integer is complicated by having to understand radix notation. 323 % Note that radix 16 is not understood, because 16 is two digits,
|
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/ |
H A D | io.tex | 111 \item different syntax for radix numbers
|
/barrelfish-master/lib/devif/backends/net/mlx4/include/linux/mlx4/ |
H A D | device.h | 42 #include <linux/radix-tree.h>
|
/barrelfish-master/usr/eclipseclp/documents/userman/ |
H A D | umssyntax.tex | 85 radix & \notation{RA} & \\
|
/barrelfish-master/doc/011-idc/ |
H A D | IDC.tex | 83 digits, optionally preceded by a radix specifier. As in C, decimal (base 10)
|
/barrelfish-master/doc/002-mackerel/ |
H A D | Mackerel.tex | 168 digits, optionally preceded by a radix specifier. As in C, decimal (base 10)
|