#define bn_correct_top(a) \
{ \
BN_ULONG *ftl; \
- int top = (a)->top; \
- if (top > 0) \
+ int tmp_top = (a)->top; \
+ if (tmp_top > 0) \
{ \
- for (ftl= &((a)->d[top-1]); top > 0; top--) \
+ for (ftl= &((a)->d[tmp_top-1]); tmp_top > 0; tmp_top--) \
if (*(ftl--)) break; \
- (a)->top = top; \
+ (a)->top = tmp_top; \
} \
bn_pollute(a); \
}