square
short square; /* square description */
m(square[0]);
m(square[propnum]);
square[num_good++] = sqnum(op->sqr);
unm(square[0]);
unm(square[propnum]);
square[num_good++] = sqnum(op->sqr);
static short square[MAX_PRP+2];
if ((res = square(&a0, &w0)) != MP_OKAY) {
if ((res = square(&a2, &w4)) != MP_OKAY) {
if ((res = square(&tmp1, &w1)) != MP_OKAY) {
if ((res = square(&tmp1, &w3)) != MP_OKAY) {
if ((res = square(&tmp1, &w2)) != MP_OKAY) {
if (square(&x0, &x0x0) != MP_OKAY) {
if (square(&x1, &x1x1) != MP_OKAY) {
if (square(&t1, &t1) != MP_OKAY) {
if ((err = square(&M[1 << (winsize - 1)],
if ((err = square(&res, &res)) != MP_OKAY) {
if ((err = square(&res, &res)) != MP_OKAY) {
if ((err = square(&res, &res)) != MP_OKAY) {
if ((err = square(&M[1 << (winsize - 1)], &M[1 << (winsize - 1)])) != MP_OKAY) {
if ((err = square(&res, &res)) != MP_OKAY) {
if ((err = square(&res, &res)) != MP_OKAY) {
if ((err = square(&res, &res)) != MP_OKAY) {
if ((res = square(a, &t)) != MP_OKAY) {
static int square(mp_int * a, mp_int * b);
int square = base * base;
square * base;