/macosx-10.9.5/dtrace-118.1/test/tst/common/stack/ |
H A D | err.D_STACK_SIZE.d | 31 * Test stack() with an invalid argument. 39 stack("i'm not an integer constant");
|
H A D | err.D_STACK_PROTO.bad.d | 31 * stack() accepts one argument 33 * SECTION: Actions and Subroutines/stack() 40 stack(1, 2);
|
H A D | tst.default.d | 31 * Test the stack action with the default stack depth. 39 stack();
|
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/backward/ |
H A D | stack.h | 64 #include <stack> 66 using std::stack;
|
/macosx-10.9.5/ksh-20/ksh/src/lib/libast/misc/ |
H A D | stack.c | 24 * pointer stack routines 27 static const char id_stack[] = "\n@(#)$Id: stack (AT&T Bell Laboratories) 1984-05-01 $\0\n"; 30 #include <stack.h> 33 * create a new stack 39 register STACK stack; local 43 if (!(stack = newof(0, struct stacktable, 1, 0))) return(0); 46 free(stack); 49 if (!(b->stack = newof(0, void*, size, 0))) 52 free(stack); 55 stack 70 stackfree(register STACK stack) argument 90 stackclear(register STACK stack) argument 101 stackget(register STACK stack) argument 112 stackpush(register STACK stack, void* value) argument 142 stackpop(register STACK stack) argument 168 stacktell(register STACK stack, int set, STACKPOS* position) argument [all...] |
/macosx-10.9.5/dtrace-118.1/test/tst/common/printa/ |
H A D | err.D_PRINTF_ARG_TYPE.stack.d | 27 #pragma ident "@(#)err.D_PRINTF_ARG_TYPE.stack.d 1.1 06/08/28 SMI" 31 @[stack()] = count();
|
H A D | tst.stack.d | 27 #pragma ident "@(#)tst.stack.d 1.1 06/08/28 SMI" 31 @[stack()] = count();
|
/macosx-10.9.5/ruby-104/ruby/ext/dl/ |
H A D | dl.h | 42 #define DLSTACK_ARGS(stack) \ 43 (stack)[0],(stack)[1],(stack)[2],(stack)[3],(stack)[4],\ 44 (stack)[5],(stack)[6],(stack)[7],(stack)[ [all...] |
/macosx-10.9.5/swig-10/Lib/ruby/ |
H A D | std_stack.i | 9 struct traits_asptr<std::stack<T> > { 10 static int asptr(VALUE obj, std::stack<T> **vec) { 11 return traits_asptr_stdseq<std::stack<T> >::asptr(obj, vec); 16 struct traits_from<std::stack<T> > { 17 static VALUE from(const std::stack<T> & vec) { 18 return traits_from_stdseq<std::stack<T> >::from(vec); 25 %rename("delete") std::stack::__delete__; 26 %rename("reject!") std::stack::reject_bang; 27 %rename("map!") std::stack::map_bang; 28 %rename("empty?") std::stack [all...] |
/macosx-10.9.5/tcl-102/tk84/tk/generic/ |
H A D | tkUndo.c | 4 * This module provides the implementation of an undo stack. 20 * Push elem on the stack identified by stack. 29 void TkUndoPushStack ( stack, elem ) 30 TkUndoAtom ** stack; 33 elem->next = *stack; 34 *stack = elem; 40 * Remove and return the top element from the stack identified by 41 * stack. 50 TkUndoAtom * TkUndoPopStack ( stack ) 160 TkUndoRedoStack * stack; /* An Undo/Redo stack */ local [all...] |
H A D | tkUndo.h | 5 * stack. 27 /* enum definining the types used in an undo stack */ 34 /* struct defining the basic undo/redo stack element */ 42 * stack */ 45 /* struct defining the basic undo/redo stack element */ 48 TkUndoAtom * undoStack; /* The undo stack */ 49 TkUndoAtom * redoStack; /* The redo stack */ 57 EXTERN void TkUndoPushStack _ANSI_ARGS_((TkUndoAtom ** stack, 60 EXTERN TkUndoAtom * TkUndoPopStack _ANSI_ARGS_((TkUndoAtom ** stack)); 62 EXTERN int TkUndoInsertSeparator _ANSI_ARGS_((TkUndoAtom ** stack)); [all...] |
/macosx-10.9.5/swig-10/Source/Preprocessor/ |
H A D | expr.c | 30 static exprval stack[256]; /* Parsing stack */ variable 66 /* Reduce a single operator on the stack */ 69 long op_token = stack[sp - 1].value; 71 assert(stack[sp - 1].op == EXPR_OP); 73 if (stack[sp].op != EXPR_VALUE) { 78 if (stack[sp].svalue) { 85 /* top of stack: don't attempt to use sp-2! */ 89 if (stack[sp].op != EXPR_VALUE) { 93 if ((!stack[s [all...] |
/macosx-10.9.5/swig-10/Lib/std/ |
H A D | std_stack.i | 5 * @brief A wrapping of std::stack for Ruby. 14 %define %std_stack_methods(stack...) 15 stack(); 16 stack( const _Sequence& ); 25 %define %std_stack_methods_val(stack...) 26 %std_stack_methods(stack) 30 // std::stack 35 // -- f(std::stack<T>), f(const std::stack<T>&): 37 // previously wrapped std::stack< [all...] |
/macosx-10.9.5/dtrace-118.1/test/tst/common/pid/ |
H A D | tst.emptystack.d | 30 * ASSERTION: the stack() action should be empty for all pid probes 47 @[stack()] = sum(0); 56 @[stack()] = sum(0); 61 @[stack()] = sum(0);
|
/macosx-10.9.5/tcl-102/tk/tk/generic/ |
H A D | tkUndo.c | 4 * This module provides the implementation of an undo stack. 27 * Push elem on the stack identified by stack. 40 TkUndoAtom **stack, 43 elem->next = *stack; 44 *stack = elem; 53 * Remove and return the top element from the stack identified by stack. 66 TkUndoAtom **stack) 70 if (*stack ! 38 TkUndoPushStack( TkUndoAtom **stack, TkUndoAtom *elem) argument 63 TkUndoPopStack( TkUndoAtom **stack) argument 93 TkUndoInsertSeparator( TkUndoAtom **stack) argument 124 TkUndoClearStack( TkUndoAtom **stack) argument 179 TkUndoPushAction( TkUndoRedoStack *stack, TkUndoSubAtom *apply, TkUndoSubAtom *revert) argument 344 TkUndoRedoStack *stack; /* An Undo/Redo stack */ local 373 TkUndoSetDepth( TkUndoRedoStack *stack, int maxdepth) argument 446 TkUndoClearStacks( TkUndoRedoStack *stack) argument 472 TkUndoFreeStack( TkUndoRedoStack *stack) argument 497 TkUndoInsertUndoSeparator( TkUndoRedoStack *stack) argument 523 TkUndoRevert( TkUndoRedoStack *stack) argument 586 TkUndoApply( TkUndoRedoStack *stack) argument [all...] |
H A D | tkUndo.h | 4 * Declarations shared among the files that implement an undo stack. 27 * Enum definining the types used in an undo stack. 65 * Struct representing a single undo+redo atom to be placed in the stack. 76 * stack. */ 80 * Struct defining a single undo+redo stack. 84 TkUndoAtom *undoStack; /* The undo stack. */ 85 TkUndoAtom *redoStack; /* The redo stack. */ 96 MODULE_SCOPE void TkUndoPushStack(TkUndoAtom **stack, TkUndoAtom *elem); 97 MODULE_SCOPE TkUndoAtom *TkUndoPopStack(TkUndoAtom **stack); 98 MODULE_SCOPE int TkUndoInsertSeparator(TkUndoAtom **stack); [all...] |
/macosx-10.9.5/xnu-2422.115.4/osfmk/conf/ |
H A D | Makefile.x86_64 | 19 WKdmDecompress_new.o_CFLAGS_ADD += -fno-stack-protector $(CFLAGS_NOLTO_FLAG) 20 WKdmData_new.o_CFLAGS_ADD += -fno-stack-protector $(CFLAGS_NOLTO_FLAG) 21 hibernate_restore.o_CFLAGS_ADD += -fno-stack-protector $(CFLAGS_NOLTO_FLAG) 22 hibernate_bootstrap.o_CFLAGS_ADD += -fno-stack-protector $(CFLAGS_NOLTO_FLAG) 23 bcopy.o_CFLAGS_ADD += -fno-stack-protector $(CFLAGS_NOLTO_FLAG) 24 bzero.o_CFLAGS_ADD += -fno-stack-protector $(CFLAGS_NOLTO_FLAG)
|
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/bits/ |
H A D | stl_stack.h | 84 * first-in-last-out %stack behavior. 94 * push, @c pop, and @c top, which are standard %stack/FILO 98 class stack class 108 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); 112 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); 131 stack(const _Sequence& __c = _Sequence()) function in class:stack 135 * Returns true if the %stack is empty. 141 /** Returns the number of elements in the %stack 214 operator ==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument 232 operator <(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument 238 operator !=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument 244 operator >(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument 250 operator <=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument 256 operator >=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) argument [all...] |
/macosx-10.9.5/CrackLib-37765/cracklib27/cracklib/ |
H A D | genrules.pl | 20 @stack = (); 24 $stack[$depth] = $set[$i]; 29 foreach (@stack)
|
/macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/struct/stack/ |
H A D | ds.h | 1 /* struct::stack - critcl - layer 1 declarations 23 * the stack */ 24 int max; /* Max number of objects in stack seen so far */ 25 Tcl_Obj* stack; /* List object holding the stack */ member in struct:S
|
/macosx-10.9.5/xnu-2422.115.4/iokit/conf/ |
H A D | Makefile.x86_64 | 12 IOHibernateRestoreKernel.o_CFLAGS_ADD += -fno-stack-protector $(CFLAGS_NOLTO_FLAG)
|
/macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/pt/ |
H A D | text_write.tcl | 32 # Reset state, fully (clear line and block buffers, , stack, set 36 variable stack {} 44 # Reset state (clear line and block buffers, stack, and set the 48 variable stack {} 190 variable stack 191 lappend stack $currentblock 198 variable stack 199 set currentblock [lindex $stack end] 200 set stack [lrange $stack [all...] |
/macosx-10.9.5/ruby-104/ruby/lib/ |
H A D | tsort.rb | 179 stack = [] 182 each_strongly_connected_component_from(node, id_map, stack) {|c| 198 def each_strongly_connected_component_from(node, id_map={}, stack=[]) # :yields: nodes 200 stack_length = stack.length 201 stack << node 209 each_strongly_connected_component_from(child, id_map, stack) {|c| 217 component = stack.slice!(stack_length .. -1)
|
/macosx-10.9.5/Libc-997.90.3/regex/TRE/lib/ |
H A D | tre-stack.c | 2 tre-stack.c - Simple stack implementation 16 #include "tre-stack.h" 29 union tre_stack_item *stack; member in struct:tre_stack_rec 41 s->stack = xmalloc(sizeof(*s->stack) * size); 42 if (s->stack == NULL) 58 xfree(s->stack); 73 s->stack[s->ptr] = value; 80 DPRINT(("tre_stack_push: stack ful [all...] |
/macosx-10.9.5/CPANInternal-140/Test-Deep/lib/Test/Deep/ |
H A D | RegexpMatches.pm | 38 my $stack = shift; 40 $stack = "[$stack =~ $self->{regex}]"; 42 return $stack; 43 # return $self->SUPER::render_stack($stack);
|