Lines Matching refs:top
250 int i = a->top - 1;
308 ret->top=0;
347 for (i=b->top>>2; i>0; i--,A+=4,B+=4)
362 switch (b->top&3)
368 * the switch table by doing a=top&3; a--; goto jump_table[a];
369 * which fails for top== 0 */
376 memcpy(A,b->d,sizeof(b->d[0])*b->top);
401 * words <= b->dmax && top < words
415 r->top = b->top;
458 /* None of this should be necessary because of what b->top means! */
461 if (b->top < b->dmax)
464 BN_ULONG *A = &(b->d[b->top]);
465 for (i=(b->dmax - b->top)>>3; i>0; i--,A+=8)
470 for (i=(b->dmax - b->top)&7; i>0; i--,A++)
506 if (bn_wexpand(a,b->top) == NULL) return(NULL);
511 for (i=b->top>>2; i>0; i--,A+=4,B+=4)
517 switch (b->top&3)
525 memcpy(a->d,b->d,sizeof(b->d[0])*b->top);
528 a->top=b->top;
547 tmp_top = a->top;
552 a->top = b->top;
557 b->top = tmp_top;
572 a->top=0;
578 if (a->top > 1)
580 else if (a->top == 1)
582 /* a->top == 0 */
592 a->top = (w ? 1 : 0);
612 ret->top=0;
622 ret->top=i;
634 /* need to call this due to clear byte at top if avoiding
635 * having the top bit set (-ve number) */
664 i=a->top-b->top;
668 for (i=a->top-1; i>=0; i--)
707 if (a->top > b->top) return(gt);
708 if (a->top < b->top) return(lt);
709 for (i=a->top-1; i>=0; i--)
728 if (a->top <= i)
731 for(k=a->top; k<i+1; k++)
733 a->top=i+1;
750 if (a->top <= i) return(0);
765 if (a->top <= i) return 0;
778 if (w >= a->top) return 0;
780 a->top=w;
783 a->top=w+1;
