Lines Matching refs:allocated
623 \item The pointer \textbf{dp} points to a dynamically allocated array of digits that represent the given multiple
639 \item The value of \textbf{alloc} may not be less than one. That is \textbf{dp} always points to a previously allocated
704 When an error is detected within a function it should free any memory it allocated, often during the initialization of
725 the initial integer will represent zero. If only a single digit were allocated quite a few subsequent re-allocations
730 If the memory for the digits has been successfully allocated then the rest of the members of the structure must
731 be initialized. Since the initial state of an mp\_int is to represent the zero integer, the allocated digits must be set
766 the digits is allocated. If this fails the function returns before setting any of the other members. The \textbf{MP\_PREC}
795 is assumed that the caller has already allocated memory for the mp\_int structure, typically on the application stack. The
815 When an mp\_int is no longer required by the application, the memory that has been allocated for its digits must be
828 3. Free the memory allocated for the digits of $a$. \\
842 is to free the allocated memory.
917 akin to how the \textit{realloc} function from the standard C library works. Since the newly allocated digits are
935 the re-allocation. All that is left is to clear the newly allocated digits and return.
972 digits allocated can be controlled by the second input argument $b$. The input size is padded upwards so it is a
988 \textbf{MP\_PREC} and then adding \textbf{MP\_PREC} to the result. If the memory can be successfully allocated the
992 The digits are allocated and set to zero at the same time with the calloc() function (line @25,XCALLOC@). The
1174 limited so it is assumed that if a algorithm fails it will clear all temporarily allocated mp\_ints and return
1288 \textbf{a} will have its own memory allocated which means that \textbf{b} may be cleared after the call
3015 the temporaries that have been successfully allocated so far.
3296 \cite[pp.596-597]{HAC}. Similar to algorithm s\_mp\_mul\_digs, a temporary mp\_int is allocated to hold the result of the squaring. This allows the
5141 larger the window size becomes. After a window size $winsize$ has been chosen an array of $2^{winsize}$ mp\_int variables is allocated. This
5144 After the table is allocated the first power of $g$ is found. Since $g \ge p$ is allowed it must be first reduced modulo $p$ to make