Lines Matching full:asize
94 const UINT32 aSize, // IN: size of a
98 UINT16 *cSize, // OUT: set to MAX(aSize, bSize)
107 *cSize = (UINT16)((aSize > bSize) ? aSize : bSize);
109 i = (aSize > bSize) ? bSize : aSize;
111 a = &a[aSize - 1];
121 if(aSize > bSize)
131 else if(aSize < bSize)
160 UINT32 aSize, // IN: size of a
165 for(a = &a[aSize-1];aSize > 0; aSize--)
180 UINT32 aSize, // IN: size of a
184 for(a = &a[aSize-1]; aSize > 0; aSize--)
196 // NULL), the size of the results p is assumed to be aSize + bSize and the results are de-normalized so that
197 // the resulting size is exactly aSize + bSize. If pSize is provided, then the actual size of the result is
198 // returned. The initial value for pSize must be at least aSize + pSize.
207 const UINT32 aSize, // IN: size of a
212 BYTE *p // OUT: product. length of product = aSize +
222 if((pSize != NULL) && (*pSize < (aSize + bSize)))
239 if (BN_bin2bn(a, aSize, bnA) == NULL || BN_bin2bn(b, bSize, bnB) == NULL)
250 BN_bn2bin(bnP, &p[aSize + bSize - retVal]);
251 memset(p, 0, aSize + bSize - retVal);
252 retVal = aSize + bSize;
342 const UINT32 aSize, // IN: size of a
353 if((i = (int)aSize - (int)bSize) > 0)
365 i = (aSize > bSize) ? bSize : aSize;
394 const UINT32 aSize, // IN: size of a
413 return _math__uComp(aSize, a, bSize, b);
416 return 0 - _math__uComp(aSize, a, bSize, b);
