bigpdiv.c revision 7c478bd95313f5f23a4c958a745db2134aa03244
/*
* Copyright (c) 1999 by Sun Microsystems, Inc.
* All rights reserved.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an
unpublished work protected as such under copyright law. This work
contains proprietary, confidential, and trade secret information of
RSA Data Security, Inc. Use, disclosure or reproduction without the
express written authorization of RSA Data Security, Inc. is
prohibited.
*/
#include "port_before.h"
#include "global.h"
#include "bigmath.h"
#include "port_after.h"
/* BigPdiv POSITIVE DIVIDE
uu=vv * qi+ri
uu in reg of ll cells
vv in reg of kk cells
qi assumed to be ll cells
ri assumed to be kk cells
restriction uu>=0, vv>0
input uu in reg of ll cells
input vv in reg of kk cells
output qi assumed to be ll cells
output ri assumed to be kk cells
restriction uu>=0, vv>0
uu=vv * qi+ri
*/
{
int j, l, n, m, t, x;
l = ll + 2;
else
l = kk + 2;
mk[0] = 0x00FF;
b = 0x0100;
BigConst (u, 0, l);
BigConst (v, 0, l);
/* zero q */
BigConst (q, 0, l);
/* Calculate len of v=n.
*/
for (n = (2 * l) - 1; n >= 0; n--) {
if (VN == 0)
continue;
break;
}
/* Normalize.
*/
a = VN;
if (n % 2 == 1)
a = a >> 8;
d = b / (a+1);
/* vh=high order digit of normalized v */
if (n % 2 == 1)
/* Calculate len of u=t.
*/
for (t = (2 * l)-1; t >= 0; t--) {
if (UT == 0)
continue;
break;
}
/* calc t = n + m */
m = t - n;
/* Divide u by v.
*/
for (j = m + 1 + n; j > n; j--) {
if (j % 2 == 1)
c = u[j / 2];
else {
a = u[j/2];
a = a << 8;
e = u[(j - 1) / 2];
e = e >> 8;
c = a + e;
}
a = c >> 8;
if (vh == a)
qq = b - 1;
else
/* Adjust q.
*/
for (x = 0; ; qq --, x ++) {
break;
}
}
/* Check result.
*/
/* t2 has remainder */
/* transfer results to input registers */
}