/*
 *        Big Arithmetic routines
 *        coded by D. P. Mitchell and Jack Lacy December, 1991
 *
 *        Copyright (c) 1991 AT&T Bell Laboratories
 */
#include "lib9.h"
#include <libcrypt.h>

void bigOr(BigInt a, BigInt b, BigInt c)
{
	BigData ap, bp, cp, maxp;
	int i, maxlen, minlen;
	
	if (LENGTH(a) > LENGTH(b)) {
		maxlen = LENGTH(a);
		minlen = LENGTH(b);
		maxp = NUM(a) + minlen;
	}
	else {
		maxlen = LENGTH(b);
		minlen = LENGTH(a);
		maxp = NUM(b) + minlen;
	}
	GUARANTEE(c, (ulong)maxlen);
	LENGTH(c) = (ulong)maxlen;
	
	SIGN(c) = SIGN(a);
	ap = NUM(a);
	bp = NUM(b);
	cp = NUM(c);
	i = minlen;    
	ap -= 4 - (i&3);
	bp -= 4 - (i&3);
	cp -= 4 - (i&3);
	
	switch (i&3) {
	case 3:  cp[1] = ap[1] | bp[1];
	case 2:  cp[2] = ap[2] | bp[2];
	case 1:  cp[3] = ap[3] | bp[3];
	case 0:
		ap += 4;
		bp += 4;
		cp += 4;
		i -= 4;
	}
	while (i >= 0) {
		cp[0] = ap[0] | bp[0];
		cp[1] = ap[1] | bp[1];
		cp[2] = ap[2] | bp[2];
		cp[3] = ap[3] | bp[3];
		ap += 4;
		bp += 4;
		cp += 4;
		i -= 4;
	}
	i = maxlen-minlen;
	while (i--)
		*cp++ = *maxp++;
	trim(c);
}