Lines Matching refs:top
15 long int top; /* Index of the topmost _unused_ cell in the
34 s->top = 0;
43 if (s->freeCellProc && s->top) {
45 for (i=0; i < s->top; i++) {
58 if (s->top >= s->max) {
66 ASSERT_BOUNDS(s->top,s->max);
67 s->cell [s->top] = item;
68 s->top ++;
74 ASSERT_BOUNDS(s->top-1,s->max);
75 return s->cell [s->top - 1];
86 s->top --;
87 ASSERT_BOUNDS(s->top,s->max);
88 s->freeCellProc ( s->cell [s->top] );
92 s->top -= n;
102 while (s->top > n) {
103 s->top --;
104 ASSERT_BOUNDS(s->top,s->max);
105 s->freeCellProc ( s->cell [s->top] );
108 s->top = n;
117 s->top -= n;
130 while (src->top > 0) {
131 src->top --;
132 ASSERT_BOUNDS(src->top,src->max);
133 rde_stack_push (dst, src->cell [src->top] );
140 *cn = s->top;
147 return s->top;