Searched refs:_stack (Results 1 – 8 of 8) sorted by relevance
81 int ch = __m_screen->_unget._stack[i]; in iqContainsFullLine()95 __m_screen->_unget._stack[__m_screen->_unget._count++] = in iqPush()108 (void) memmove(__m_screen->_unget._stack + 1, in iqAdd()109 __m_screen->_unget._stack, count * sizeof (int)); in iqAdd()111 __m_screen->_unget._stack[0] = (int) ch; in iqAdd()132 ch = __m_screen->_unget._stack[--(__m_screen->_unget._count)]; in iqPull()154 ch = __m_screen->_unget._stack[__m_screen->_unget._count - n - 1]; in iqGetNth()
268 sp->_unget._stack = calloc((size_t) sp->_unget._size, in newterm()269 sizeof (*sp->_unget._stack)); in newterm()270 if (sp->_unget._stack == NULL) in newterm()423 if (sp->_unget._stack != NULL) in delscreen()424 free(sp->_unget._stack); in delscreen()
218 ch = __m_screen->_unget._stack[i];219 __m_screen->_unget._stack[i] = 220 __m_screen->_unget._stack[j];221 __m_screen->_unget._stack[j] = ch;
271 sp->_unget._stack = calloc(272 (size_t) sp->_unget._size, sizeof *sp->_unget._stack274 if (sp->_unget._stack == (void *) 0)411 if (sp->_unget._stack != (int *) 0)412 free(sp->_unget._stack);
220 #define POP() __m_screen->_unget._stack[DEC()]221 #define PUSH(x) (__m_screen->_unget._stack[INC()] = (x))
145 #define STACK_RESERVE(_stack, _n_default) \ argument146 (((_stack).stk_n < (_stack).stk_n_alloc) || \147 stack_resize((generic_stack_t *)&(_stack).stk_s, _n_default, \148 sizeof (*(_stack).stk_s)))153 #define STACK_RESET(_stack) (_stack).stk_n = 0; argument158 #define STACK_IS_EMPTY(_stack) ((_stack).stk_n == 0) argument167 #define STACK_PUSH(_stack) (_stack).stk_s[(_stack).stk_n++] argument173 #define STACK_POP(_stack) ((_stack).stk_s[--(_stack).stk_n]) argument179 #define STACK_TOP(_stack) (((_stack).stk_s)[(_stack).stk_n - 1]) argument
178 int *_stack; /* Buffer used for the input stack. */ member
181 int *_stack; /* Buffer used for the input stack. */ member