Home
last modified time | relevance | path

Searched refs:stack (Results 1 – 25 of 1201) sorted by relevance

12345678910>>...49

/minix3/external/bsd/libc++/dist/libcxx/include/
H A Dstack2 //===---------------------------- stack -----------------------------------===//
15 stack synopsis
21 class stack
34 stack() = default;
35 ~stack() = default;
37 stack(const stack& q) = default;
38 stack(stack&& q) = default;
40 stack& operator=(const stack& q) = default;
41 stack& operator=(stack&& q) = default;
43 explicit stack(const container_type& c);
[all …]
/minix3/common/lib/libprop/
H A Dprop_stack.c36 _prop_stack_init(prop_stack_t stack) in _prop_stack_init() argument
38 stack->used_intern_elems = 0; in _prop_stack_init()
39 SLIST_INIT(&stack->extern_elems); in _prop_stack_init()
43 _prop_stack_push(prop_stack_t stack, prop_object_t obj, void *data1, in _prop_stack_push() argument
49 if (stack->used_intern_elems == PROP_STACK_INTERN_ELEMS) { in _prop_stack_push()
60 SLIST_INSERT_HEAD(&stack->extern_elems, eelem, stack_link); in _prop_stack_push()
65 _PROP_ASSERT(stack->used_intern_elems < PROP_STACK_INTERN_ELEMS); in _prop_stack_push()
66 _PROP_ASSERT(SLIST_EMPTY(&stack->extern_elems)); in _prop_stack_push()
68 ielem = &stack->intern_elems[stack->used_intern_elems]; in _prop_stack_push()
74 ++stack->used_intern_elems; in _prop_stack_push()
[all …]
/minix3/lib/libterminfo/
H A Dtparm.c65 push(long num, char *string, TPSTACK *stack) in push() argument
67 if (stack->offset >= sizeof(stack->nums)) { in push()
71 stack->nums[stack->offset] = num; in push()
72 stack->strings[stack->offset] = string; in push()
73 stack->offset++; in push()
78 pop(long *num, char **string, TPSTACK *stack) in pop() argument
80 if (stack->offset == 0) { in pop()
88 stack->offset--; in pop()
90 *num = stack->nums[stack->offset]; in pop()
92 *string = stack->strings[stack->offset]; in pop()
[all …]
/minix3/external/bsd/libc++/dist/libcxx/test/std/containers/container.adaptors/stack/stack.defn/
H A Dtypes.pass.cpp32 : private std::stack<int>
50 static_assert((std::is_same<std::stack<int>::container_type, std::deque<int> >::value), ""); in main()
51 …static_assert((std::is_same<std::stack<double, std::vector<int> >::container_type, std::vector<int… in main()
52 … static_assert((std::is_same<std::stack<double, std::vector<int> >::value_type, int>::value), ""); in main()
53 … static_assert((std::is_same<std::stack<int>::reference, std::deque<int>::reference>::value), ""); in main()
54 …static_assert((std::is_same<std::stack<int>::const_reference, std::deque<int>::const_reference>::v… in main()
55 … static_assert((std::is_same<std::stack<int>::size_type, std::deque<int>::size_type>::value), ""); in main()
56 static_assert((std::uses_allocator<std::stack<int>, std::allocator<int> >::value), ""); in main()
57 static_assert((!std::uses_allocator<std::stack<int, C>, std::allocator<int> >::value), ""); in main()
H A Dswap.pass.cpp29 std::stack<int> q1 = make<std::stack<int> >(5); in main()
30 std::stack<int> q2 = make<std::stack<int> >(10); in main()
31 std::stack<int> q1_save = q1; in main()
32 std::stack<int> q2_save = q2; in main()
/minix3/external/bsd/libc++/dist/libcxx/test/containers/container.adaptors/stack/stack.defn/
H A Dtypes.pass.cpp32 : private std::stack<int>
50 static_assert((std::is_same<std::stack<int>::container_type, std::deque<int> >::value), ""); in main()
51 …static_assert((std::is_same<std::stack<double, std::vector<int> >::container_type, std::vector<int… in main()
52 … static_assert((std::is_same<std::stack<double, std::vector<int> >::value_type, int>::value), ""); in main()
53 … static_assert((std::is_same<std::stack<int>::reference, std::deque<int>::reference>::value), ""); in main()
54 …static_assert((std::is_same<std::stack<int>::const_reference, std::deque<int>::const_reference>::v… in main()
55 … static_assert((std::is_same<std::stack<int>::size_type, std::deque<int>::size_type>::value), ""); in main()
56 static_assert((std::uses_allocator<std::stack<int>, std::allocator<int> >::value), ""); in main()
57 static_assert((!std::uses_allocator<std::stack<int, C>, std::allocator<int> >::value), ""); in main()
H A Dswap.pass.cpp29 std::stack<int> q1 = make<std::stack<int> >(5); in main()
30 std::stack<int> q2 = make<std::stack<int> >(10); in main()
31 std::stack<int> q1_save = q1; in main()
32 std::stack<int> q2_save = q2; in main()
/minix3/external/bsd/llvm/dist/llvm/test/CodeGen/X86/
H A Dwin_ftol2.ll11 ; the x87 stack instead of the callstack. The input value is popped by the
42 ;; stack is empty
44 ;; stack is %z
46 ;; stack is %y %z
48 ;; stack is %x %y %z
50 ;; stack is %x %1 %z
52 ;; stack is %1 %2
56 ;; stack is %2 %1
62 ;; stack is empty
76 ;; stack is empty
[all …]
H A Dstack-probe-size.ll1 ; This test is attempting to detect that the compiler correctly generates stack
2 ; probe calls when the size of the local variables exceeds the specified stack
6 ; stack probe size equals the page size (4096 bytes for all x86 targets), and
14 define i32 @test1() "stack-probe-size"="0" {
36 define i32 @test3() "stack-probe-size"="8192" {
47 define i32 @test4() "stack-probe-size"="0" {
69 define i32 @test6() "stack-probe-size"="8192" {
/minix3/crypto/external/bsd/openssl/dist/crypto/stack/
H A DMakefile5 DIR= stack
20 LIBSRC=stack.c
21 LIBOBJ=stack.o
25 EXHEADER= stack.h safestack.h
79 stack.o: ../../e_os.h ../../include/openssl/asn1.h ../../include/openssl/bio.h
80 stack.o: ../../include/openssl/buffer.h ../../include/openssl/crypto.h
81 stack.o: ../../include/openssl/e_os2.h ../../include/openssl/err.h
82 stack.o: ../../include/openssl/lhash.h ../../include/openssl/obj_mac.h
83 stack.o: ../../include/openssl/objects.h ../../include/openssl/opensslconf.h
84 stack.o: ../../include/openssl/opensslv.h ../../include/openssl/ossl_typ.h
[all …]
/minix3/external/bsd/libc++/dist/libcxx/test/containers/container.adaptors/stack/stack.special/
H A Dswap.pass.cpp30 std::stack<int> q1 = make<std::stack<int> >(5); in main()
31 std::stack<int> q2 = make<std::stack<int> >(10); in main()
32 std::stack<int> q1_save = q1; in main()
33 std::stack<int> q2_save = q2; in main()
/minix3/external/bsd/libc++/dist/libcxx/test/containers/container.adaptors/stack/stack.ops/
H A Deq.pass.cpp33 std::stack<int> q1 = make<std::stack<int> >(5); in main()
34 std::stack<int> q2 = make<std::stack<int> >(10); in main()
35 std::stack<int> q1_save = q1; in main()
36 std::stack<int> q2_save = q2; in main()
H A Dlt.pass.cpp39 std::stack<int> q1 = make<std::stack<int> >(5); in main()
40 std::stack<int> q2 = make<std::stack<int> >(10); in main()
/minix3/external/bsd/libc++/dist/libcxx/test/std/containers/container.adaptors/stack/stack.ops/
H A Deq.pass.cpp33 std::stack<int> q1 = make<std::stack<int> >(5); in main()
34 std::stack<int> q2 = make<std::stack<int> >(10); in main()
35 std::stack<int> q1_save = q1; in main()
36 std::stack<int> q2_save = q2; in main()
H A Dlt.pass.cpp39 std::stack<int> q1 = make<std::stack<int> >(5); in main()
40 std::stack<int> q2 = make<std::stack<int> >(10); in main()
/minix3/external/bsd/libc++/dist/libcxx/test/std/containers/container.adaptors/stack/stack.special/
H A Dswap.pass.cpp30 std::stack<int> q1 = make<std::stack<int> >(5); in main()
31 std::stack<int> q2 = make<std::stack<int> >(10); in main()
32 std::stack<int> q1_save = q1; in main()
33 std::stack<int> q2_save = q2; in main()
/minix3/external/bsd/libarchive/dist/tar/
H A Dtree.c123 struct tree_entry *stack; member
188 for (te = t->stack; te != NULL; te = te->next) { in tree_dump()
213 te->next = t->stack; in tree_push()
217 t->stack = te; in tree_push()
284 t->stack->flags = needsFirstVisit | isDirLink | needsAscent; in tree_open()
285 t->stack->symlink_parent_fd = open(".", O_RDONLY); in tree_open()
321 t->stack->flags = needsFirstVisit | isDirLink | needsAscent; in tree_open()
322 t->stack->symlink_parent_path = cwd; in tree_open()
337 te = t->stack;
378 if (t->stack == t->current && t->current != NULL)
[all …]
/minix3/external/bsd/llvm/dist/llvm/tools/llvm-c-test/
H A Dcalc.c45 LLVMValueRef stack[MAX_DEPTH]; in build_from_tokens() local
64 stack[depth - 2] = LLVMBuildBinOp(builder, op_to_opcode(tok), in build_from_tokens()
65 stack[depth - 1], stack[depth - 2], ""); in build_from_tokens()
78 off = LLVMBuildGEP(builder, param, &stack[depth - 1], 1, ""); in build_from_tokens()
79 stack[depth - 1] = LLVMBuildLoad(builder, off, ""); in build_from_tokens()
97 stack[depth++] = LLVMConstInt(LLVMInt64Type(), val, 1); in build_from_tokens()
108 LLVMBuildRet(builder, stack[depth - 1]); in build_from_tokens()
110 return stack[depth - 1]; in build_from_tokens()
/minix3/tests/lib/libc/sys/
H A Dt_clone.c97 void *allocstack, *stack; in ATF_TC_BODY() local
107 stack = allocstack; in ATF_TC_BODY()
109 stack = (char *)stack + STACKSIZE; in ATF_TC_BODY()
112 printf("parent: stack = %p, frobme = %p\n", stack, frobme); in ATF_TC_BODY()
116 frobme[1] = (long)stack; in ATF_TC_BODY()
123 switch (pid = __clone(clone_func, stack, in ATF_TC_BODY()
193 void *allocstack, *stack; in ATF_TC_BODY() local
199 stack = allocstack; in ATF_TC_BODY()
201 stack = (char *)stack + STACKSIZE; in ATF_TC_BODY()
205 rv = __clone(0, stack, in ATF_TC_BODY()
/minix3/external/bsd/llvm/dist/llvm/docs/
H A DStackMaps.rst16 A stack map records the location of ``live values`` at a particular
18 LLVM values live across the stack map. Instead, they are only the
22 containing the stack map.
24 LLVM emits stack map data into the object code within a designated
25 :ref:`stackmap-section`. This stack map data contains a record for
26 each stack map. The record stores the stack map's instruction address
28 value's location as a register, stack offset, or constant.
33 convention and may return a value. They also imply stack map
50 used whenever stack maps or code patching are needed. Because the
54 The stack map functionality described in this document is separate
[all …]
H A DInAlloca.rst13 argument stack memory. Prior to the addition of inalloca, calls in LLVM
15 work, such as object construction, between the first stack adjustment
74 To avoid stack leaks, the frontend saves the current stack pointer with
76 argument stack space with alloca and calls the default constructor. The
79 constructed argument ``b`` before restoring the stack pointer. If the
81 ``g`` will destroy its arguments, and then the stack is restored in
92 because all calls need to use the memory at the top of the stack to pass
98 lifetime is handled explicitly with stack save and restore calls. In
100 or ``afree`` to make it clear that this stack adjusting cleanup is less
101 powerful than a full stack save and restore.
[all …]
/minix3/crypto/external/bsd/openssl/lib/libcrypto/
H A Dstack.inc1 # $NetBSD: stack.inc,v 1.1 2009/07/19 23:30:44 christos Exp $
5 # SRCS extracted from src/crypto/dist/openssl/crypto/stack/Makefile
8 .PATH: ${OPENSSLSRC}/crypto/stack
11 STACK_SRCS = stack.c
15 CPPFLAGS.${cryptosrc} = -I${OPENSSLSRC}/crypto/stack
/minix3/crypto/external/bsd/openssl/dist/crypto/perlasm/
H A Dx86asm.pl23 if ($opcode =~ /^push/) { $stack+=4; }
24 elsif ($opcode =~ /^pop/) { $stack-=4; }
44 sub ::stack_push{ my $num=$_[0]*4; $stack+=$num; &sub("esp",$num); }
45 sub ::stack_pop { my $num=$_[0]*4; $stack-=$num; &add("esp",$num); }
46 sub ::blindpop { &pop($_[0]); $stack+=4; }
47 sub ::wparam { &DWP($stack+4*$_[0],"esp"); }
173 $stack=4;
187 $stack=0;
197 $stack+=16; # readjust esp as if we didn't pop anything
/minix3/external/bsd/llvm/dist/llvm/test/CodeGen/Generic/
H A Dundef-phi.ll9 define i32 @push(%struct.xx_stack* %stack) nounwind uwtable readonly ssp {
11 %tobool1 = icmp eq %struct.xx_stack* %stack, null
15 %stack.addr.02 = phi %struct.xx_stack* [ %0, %for.body ], [ %stack, %entry ]
16 %next = getelementptr inbounds %struct.xx_stack* %stack.addr.02, i64 0, i32 1
22 %top.0.lcssa = phi %struct.xx_stack* [ undef, %entry ], [ %stack.addr.02, %for.body ]
/minix3/external/gpl3/binutils/usr.bin/gas/
H A DMakefile16 COPTS.obj-elf.c = -Wno-stack-protector
17 COPTS.atof-generic.c = -Wno-stack-protector
18 COPTS.dwarf2dbg.c = -Wno-stack-protector
19 COPTS.symbols.c = -Wno-stack-protector
20 COPTS.stabs.c = -Wno-stack-protector
21 COPTS.macro.c = -Wno-stack-protector

12345678910>>...49