stack            1163 libglibc/regex.c   fail_stack_elt_t *stack;
stack            1188 libglibc/regex.c   fail_stack_elt_t *stack;
stack            1206 libglibc/regex.c     fail_stack.stack = (fail_stack_elt_t *)				\
stack            1209 libglibc/regex.c     if (fail_stack.stack == NULL)					\
stack            1216 libglibc/regex.c # define RESET_FAIL_STACK()  REGEX_FREE_STACK (fail_stack.stack)
stack            1237 libglibc/regex.c    : ((fail_stack).stack = (fail_stack_elt_t *)				\
stack            1238 libglibc/regex.c         REGEX_REALLOCATE_STACK ((fail_stack).stack, 			\
stack            1242 libglibc/regex.c       (fail_stack).stack == NULL					\
stack            1255 libglibc/regex.c    : ((FAIL_STACK).stack[(FAIL_STACK).avail++].pointer = POINTER,	\
stack            1262 libglibc/regex.c   fail_stack.stack[fail_stack.avail++].pointer = (unsigned char *) (item)
stack            1268 libglibc/regex.c   fail_stack.stack[fail_stack.avail++].integer = (item)
stack            1274 libglibc/regex.c   fail_stack.stack[fail_stack.avail++] =  (item)
stack            1278 libglibc/regex.c #define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer
stack            1279 libglibc/regex.c #define POP_FAILURE_INT() fail_stack.stack[--fail_stack.avail].integer
stack            1280 libglibc/regex.c #define POP_FAILURE_ELT() fail_stack.stack[--fail_stack.avail]
stack            1740 libglibc/regex.c   compile_stack_elt_t *stack;
stack            1752 libglibc/regex.c #define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail])
stack            1878 libglibc/regex.c   return (free (compile_stack.stack), value)
stack            1949 libglibc/regex.c   compile_stack.stack = TALLOC (INIT_COMPILE_STACK_SIZE, compile_stack_elt_t);
stack            1950 libglibc/regex.c   if (compile_stack.stack == NULL)
stack            2448 libglibc/regex.c                   RETALLOC (compile_stack.stack, compile_stack.size << 1,
stack            2450 libglibc/regex.c                   if (compile_stack.stack == NULL) return REG_ESPACE;
stack            2936 libglibc/regex.c   free (compile_stack.stack);
stack            2964 libglibc/regex.c 	if (! fail_stack.stack)
stack            2965 libglibc/regex.c 	  fail_stack.stack
stack            2969 libglibc/regex.c 	  fail_stack.stack
stack            2970 libglibc/regex.c 	    = (fail_stack_elt_t *) xrealloc (fail_stack.stack,
stack            2974 libglibc/regex.c 	if (! fail_stack.stack)
stack            2975 libglibc/regex.c 	  fail_stack.stack
stack            2979 libglibc/regex.c 	  fail_stack.stack
stack            2980 libglibc/regex.c 	    = (fail_stack_elt_t *) realloc (fail_stack.stack,
stack            3116 libglibc/regex.c     if (compile_stack.stack[this_element].regnum == regnum)
stack            3247 libglibc/regex.c 	      p = fail_stack.stack[--fail_stack.avail].pointer;
stack            3399 libglibc/regex.c 	      && fail_stack.stack[fail_stack.avail - 1].pointer == p)
stack            3763 libglibc/regex.c     REGEX_FREE_STACK (fail_stack.stack);				\
stack              63 libparser/C.c  } stack[MAXPIFSTACK], *cur;
stack             596 libparser/C.c  	cur = &stack[piflevel];
stack              81 libparser/Cpp.c 	} stack[MAXCLASSSTACK];
stack              86 libparser/Cpp.c 	stack[0].classname = completename;
stack              87 libparser/Cpp.c 	stack[0].terminate = completename;
stack              88 libparser/Cpp.c 	stack[0].level = 0;
stack             100 libparser/Cpp.c 		if (cc == '~' && level == stack[classlevel].level)
stack             109 libparser/Cpp.c 				} else if (level > stack[classlevel].level || startequal || startmacro) {
stack             111 libparser/Cpp.c 				} else if (level == stack[classlevel].level && !startmacro && !startsharp && !startequal) {
stack             121 libparser/Cpp.c 						if (strcmp(stack[classlevel].classname, savetok))
stack             208 libparser/Cpp.c 				char *p = stack[classlevel].terminate;
stack             215 libparser/Cpp.c 				stack[classlevel].classname = p;
stack             218 libparser/Cpp.c 				stack[classlevel].terminate = p;
stack             219 libparser/Cpp.c 				stack[classlevel].level = level;
stack             239 libparser/Cpp.c 			if (level < stack[classlevel].level)
stack             240 libparser/Cpp.c 				*(stack[--classlevel].terminate) = 0;
stack              55 libparser/java.c 	} stack[MAXCLASSSTACK];
stack              59 libparser/java.c 	stack[0].classname = completename;
stack              60 libparser/java.c 	stack[0].terminate = completename;
stack              61 libparser/java.c 	stack[0].level = 0;
stack              78 libparser/java.c 				if (level == stack[classlevel].level && !startequal)
stack              80 libparser/java.c 					if (strcmp(stack[classlevel].classname, token))
stack              82 libparser/java.c 				if (level > stack[classlevel].level || startequal)
stack              93 libparser/java.c 				char *p = stack[classlevel].terminate;
stack             100 libparser/java.c 				stack[classlevel].classname = p;
stack             103 libparser/java.c 				stack[classlevel].terminate = p;
stack             104 libparser/java.c 				stack[classlevel].level = level;
stack             116 libparser/java.c 			if (level < stack[classlevel].level)
stack             117 libparser/java.c 				*(stack[--classlevel].terminate) = 0;
stack             383 libutil/find.c static VARRAY *stack;				/**< dynamic allocated array */
stack             430 libutil/find.c 	sp = varray_assign(stack, 0, 0);
stack             524 libutil/find.c 	stack = varray_open(sizeof(struct stack_entry), 50);
stack             526 libutil/find.c 	curp = varray_assign(stack, current_entry, 1);
stack             609 libutil/find.c 	struct stack_entry *curp = varray_assign(stack, current_entry, 1);
stack             676 libutil/find.c 				curp = varray_assign(stack, ++current_entry, 1);
stack             693 libutil/find.c 		curp = varray_assign(stack, --current_entry, 0);
stack             779 libutil/find.c 		if (stack)
stack             780 libutil/find.c 			varray_close(stack);