Searched refs:digits (Results 1 - 24 of 24) sorted by relevance

/barrelfish-master/lib/tommath/
H A Dbn_mp_rand.c20 mp_rand (mp_int * a, int digits) argument
26 if (digits <= 0) {
39 while (--digits > 0) {
H A Dtommath.tex171 reason that $7$ times $6$ is $42$. However, $42$ has two digits of precision as opposed to one digit we started with.
285 A multiple precision integer of $n$-digits shall be denoted as $x = (x_{n-1}, \ldots, x_1, x_0)_{ \beta }$ and represent
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
291 The term ``mp\_int'' shall refer to a composite structure which contains the digits of the integer it represents, as well
344 The norm of a multiple precision integer, for example $\vert \vert x \vert \vert$, will be used to represent the number of digits in the representation
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
568 the largest single digit value is $9$. However, by concatenating digits together larger numbers may be represented. Newly prepended digits
576 that is the sign of this particular integer is positive as opposed to negative. Second, the integer has three digits in
578 arithmetic. The third property is how many digits placeholder
[all...]
H A Dbn.tex346 Where ``mp\_digit'' is a data type that represents individual digits of the integer. By default, an mp\_digit is the
515 default number of digits. By default, all initializers allocate \textbf{MP\_PREC} digits. This function lets
524 to have $size$ digits (which are all initially zero).
549 digits can be removed to return memory to the heap with the mp\_shrink() function.
556 This will remove excess digits of the mp\_int $a$. If the operation fails the mp\_int should be intact without the
557 excess digits being removed. Note that you can use a shrunk mp\_int in further computations, however, such operations
592 \subsection{Adding additional digits}
594 Within the mp\_int structure are two parameters which control the limitations of the array of digits that represent
595 the integer the mp\_int is meant to equal. The \textit{used} parameter dictates how many digits ar
[all...]
H A Dtommath.h81 /* this is the default case, 28-bit digits */
98 /* this is an extension that uses 31-bit digits */
101 /* default case is 28-bit digits, defines MP_28BIT as a handy macro to test */
169 #define MP_PREC 32 /* default digits of precision */
171 #define MP_PREC 8 /* default digits of precision */
217 /* init to a given number of digits */
249 /* trim unused digits */
254 /* right shift by "b" digits */
257 /* left shift by "b" digits */
284 int mp_rand(mp_int *a, int digits);
[all...]
/barrelfish-master/lib/libc/inet/
H A Dinet_net_pton.c66 static const char digits[] = "0123456789"; local
105 n = strchr(digits, ch) - digits;
134 n = strchr(digits, ch) - digits;
193 static const char digits[] = "0123456789"; local
203 pch = strchr(digits, ch);
208 val += (pch - digits);
223 static const char digits[] = "0123456789"; local
234 pch = strchr(digits, c
272 int digits; local
[all...]
H A Dinet_cidr_pton.c84 static const char digits[] = "0123456789"; variable
96 n = strchr(digits, ch) - digits;
265 cp = strchr(digits, ch);
269 bits += cp - digits;
H A Dinet_pton.c81 static const char digits[] = "0123456789"; local
91 if ((pch = strchr(digits, ch)) != NULL) {
92 u_int new = *tp * 10 + (pch - digits);
/barrelfish-master/lib/libc/nameser/
H A Dns_ttl.c101 int ch, digits, dirty; local
105 digits = 0;
113 digits++;
116 if (digits == 0)
130 digits = 0;
133 if (digits > 0) {
H A Dns_name.c51 static const char digits[] = "0123456789"; variable
163 *dn++ = digits[c / 100];
164 *dn++ = digits[(c % 100) / 10];
165 *dn++ = digits[c % 10];
253 else if ((cp = strchr(digits, c)) != NULL) {
254 n = (cp - digits) * 100;
256 (cp = strchr(digits, c)) == NULL) {
260 n += (cp - digits) * 10;
262 (cp = strchr(digits, c)) == NULL) {
266 n += (cp - digits);
[all...]
/barrelfish-master/lib/posixcompat/
H A Dinet_pton.c79 static const char digits[] = "0123456789"; local
90 if ((pch = strchr(digits, ch)) != NULL) {
91 u_int new = *tp * 10 + (pch - digits);
/barrelfish-master/lib/openssl-1.0.0d/crypto/ts/
H A Dts_conf.c453 long digits = 0; local
457 &digits))
458 digits = 0;
459 if (digits < 0 || digits > TS_MAX_CLOCK_PRECISION_DIGITS)
465 if (!TS_RESP_CTX_set_clock_precision_digits(ctx, digits))
/barrelfish-master/usr/eclipseclp/Contrib/
H A Drdtok.pl263 % reads a sequence of letters, digits, and underscores, and returns
321 % <digit> ' <digits> - the digits, read in that base
322 % <digits> - the digits, read in base 10.
323 % Note that radix 16 is not understood, because 16 is two digits,
324 % and that all the decimal digits are accepted in each base (this
H A Dxml_acquisition.pl506 "#", digit( Digit ), digits( Digits ), ";",
745 digits( [Digit|Digits] ) -->
747 digits( Digits ).
748 digits( [] ) --> [].
/barrelfish-master/usr/eclipseclp/documents/megalog/
H A Dmultiuser-sec.tex318 1 ?- transaction( digits <++ [ 1,2,3,4,5 ] ).
321 2 ?- transaction( ( ins_tup( digits(6) ),
322 findall(X,retr_tup( old(digits), X), L))).
327 3 ?- transaction( findall(X,retr_tup(digits,X),L) ).
333 The second transaction inserts a tuple into the digits relation,
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumssyntax.tex78 digit & \notation{N} &digits\\
202 digits.
279 ES three octal digits & character with given octal character code & not iso_escapes\\
280 ES octal digits ES & character with given octal character code & iso_escapes\\
281 ES \verb'x' hex digits ES & character with given hexadecimal character code &\\
310 ES octal digits ES & character with given octal character code & iso_escapes\\
311 ES \verb'x' hex digits ES & character with given hexadecimal character code &\\
/barrelfish-master/lib/lwip2/src/apps/smtp/
H A Dsmtp.c948 char digits[4]; local
954 /* copy three digits and convert them to int */
955 if (pbuf_copy_partial(s->p, digits, 3, 0) != 3) {
959 digits[3] = 0;
960 num = strtol(digits, NULL, 10);
/barrelfish-master/lib/libc/resolv/
H A Dres_mkupdate.c769 static char digits[] = "0123456789"; variable
821 (strchr(digits, c) - digits);
/barrelfish-master/usr/eclipseclp/documents/visualisation/
H A Dannotate.tex65 the \emph{carry} digits. If we suppose that the user is only
75 viewable_create(digits, Digits),
179 the \emph{carry} digits to it. The code to do this is
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Dio.tex210 the required precision, and the required digits on both sides of
/barrelfish-master/lib/tommath/pre_gen/
H A Dmpi.c245 /* first we have to get the digits of the input into
255 /* alias for the digits of x*/
258 /* copy the digits of a into W[0..a->used-1] */
269 /* now we proceed to zero successive digits
290 * column since the Montgomery reduction requires digits of the
301 /* alias for the digits of the modulus */
319 * significant digits we zeroed].
354 /* zero oldused digits, if the input a was larger than
355 * m->used+1 we'll have to clear the digits
407 * digits o
6329 mp_rand(mp_int * a, int digits) argument
[all...]
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dicintro.tex1121 A magic square is a $3 \times 3$ grid containing the digits 1 through 9
/barrelfish-master/lib/pcre/
H A Dpcre_compile.c489 "(?R or (?[+-]digits must be followed by )\0"
562 "digits missing in \\x{} or \\o{}\0"
566 /* Table to identify digits and hex digits. This is used when compiling
568 may mark arbitrary characters as digits - but the PCRE compiling code expects
569 to handle only 0-9, a-z, and A-Z as digits when compiling. That is why we have
954 where the ddds are digits.
1025 /* Non-alphanumerics are literals. For digits or letters, do an initial lookup
1198 /* The handling of escape sequences consisting of a string of digits
1203 Outside a character class, the digits ar
[all...]
/barrelfish-master/doc/011-idc/
H A DIDC.tex83 digits, optionally preceded by a radix specifier. As in C, decimal (base 10)
/barrelfish-master/doc/002-mackerel/
H A DMackerel.tex168 digits, optionally preceded by a radix specifier. As in C, decimal (base 10)

Completed in 285 milliseconds