| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/fusion/iterator/detail/ |
| H A D | segmented_next_impl.hpp | 28 template <typename Sequence, typename Stack>
31 //bool is_invalid(stack)
33 // return empty(car(stack));
36 template <typename Stack>
39 typename Stack::car_type::begin_type,
40 typename Stack::car_type::end_type
45 ////top of a stack of iterator ranges. Return the
46 ////new stack.
47 //auto pop_front_car(stack)
49 // return cons(iterator_range(next(begin(car(stack))), end(car(stack))), cdr(stack));
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/ |
| H A D | stack | 2 //===---------------------------- 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 …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/ |
| H A D | stack | 2 //===---------------------------- 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 …]
|
| /OK3568_Linux_fs/kernel/drivers/misc/altera-stapl/ |
| H A D | altera.c | 119 /* This function checks if enough parameters are available on the stack. */
213 long *stack = astate->stack; in altera_execute() local
528 stack[stack_ptr] = stack[stack_ptr - 1]; in altera_execute()
534 long_tmp = stack[stack_ptr - 2]; in altera_execute()
535 stack[stack_ptr - 2] = stack[stack_ptr - 1]; in altera_execute()
536 stack[stack_ptr - 1] = long_tmp; in altera_execute()
542 stack[stack_ptr - 1] += stack[stack_ptr]; in altera_execute()
548 stack[stack_ptr - 1] -= stack[stack_ptr]; in altera_execute()
554 stack[stack_ptr - 1] *= stack[stack_ptr]; in altera_execute()
560 stack[stack_ptr - 1] /= stack[stack_ptr]; in altera_execute()
[all …]
|
| /OK3568_Linux_fs/buildroot/package/openpowerlink/ |
| H A D | 0001-install-the-stack-libraries-to-lib-subdirectory.patch | 4 Subject: [PATCH] install the stack libraries to "lib" subdirectory
6 Using '.' to install the stack libraries is not correct since
14 the stack directory to be a "local staging" directory which
16 stack project are installed in stack/lib by default.
42 stack/proj/linux/liboplkcn-sim/CMakeLists.txt | 2 +-
43 stack/proj/linux/liboplkcn/CMakeLists.txt | 2 +-
44 stack/proj/linux/liboplkcnapp-kernelintf/CMakeLists.txt | 2 +-
45 stack/proj/linux/liboplkcnapp-userintf/CMakeLists.txt | 2 +-
46 stack/proj/linux/liboplkcndrv-pcap/CMakeLists.txt | 2 +-
47 stack/proj/linux/liboplkmn-sim/CMakeLists.txt | 2 +-
[all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/bits/ |
| H A D | stl_stack.h | 1 // Stack implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{stack}
85 * first-in-last-out %stack behavior. in _GLIBCXX_VISIBILITY()
95 * push, @c pop, and @c top, which are standard %stack/FILO in _GLIBCXX_VISIBILITY()
99 class stack in _GLIBCXX_VISIBILITY()
113 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); in _GLIBCXX_VISIBILITY()
117 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); in _GLIBCXX_VISIBILITY()
122 operator<=>(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); in _GLIBCXX_VISIBILITY()
157 stack(const _Sequence& __c = _Sequence()) in _GLIBCXX_VISIBILITY()
162 stack() in _GLIBCXX_VISIBILITY()
[all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/bits/ |
| H A D | stl_stack.h | 1 // Stack implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{stack}
85 * first-in-last-out %stack behavior. in _GLIBCXX_VISIBILITY()
95 * push, @c pop, and @c top, which are standard %stack/FILO in _GLIBCXX_VISIBILITY()
99 class stack in _GLIBCXX_VISIBILITY()
113 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); in _GLIBCXX_VISIBILITY()
117 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); in _GLIBCXX_VISIBILITY()
122 operator<=>(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); in _GLIBCXX_VISIBILITY()
157 stack(const _Sequence& __c = _Sequence()) in _GLIBCXX_VISIBILITY()
162 stack() in _GLIBCXX_VISIBILITY()
[all …]
|
| /OK3568_Linux_fs/kernel/arch/x86/kernel/ |
| H A D | dumpstack_32.c | 38 static bool in_hardirq_stack(unsigned long *stack, struct stack_info *info) in in_hardirq_stack() argument
44 * This is a software stack, so 'end' can be a valid stack pointer. in in_hardirq_stack()
45 * It just means the stack is empty. in in_hardirq_stack()
47 if (stack < begin || stack > end) in in_hardirq_stack()
55 * See irq_32.c -- the next stack pointer is stored at the beginning of in in_hardirq_stack()
56 * the stack. in in_hardirq_stack()
63 static bool in_softirq_stack(unsigned long *stack, struct stack_info *info) in in_softirq_stack() argument
69 * This is a software stack, so 'end' can be a valid stack pointer. in in_softirq_stack()
70 * It just means the stack is empty. in in_softirq_stack()
72 if (stack < begin || stack > end) in in_softirq_stack()
[all …]
|
| H A D | dumpstack_64.c | 40 * On 64-bit, we have a generic entry stack that we in stack_type_name()
55 * @offs: Offset from the start of the exception stack area
56 * @size: Size of the exception stack
73 * Array of exception stack page descriptors. If the stack is larger than
74 * PAGE_SIZE, all pages covering a particular stack will have the same
75 * info. The guard pages including the not mapped DB2 stack are zeroed
88 static __always_inline bool in_exception_stack(unsigned long *stack, struct stack_info *info) in in_exception_stack() argument
90 unsigned long begin, end, stk = (unsigned long)stack; in in_exception_stack()
99 * Handle the case where stack trace is collected _before_ in in_exception_stack()
106 /* Bail if @stack is outside the exception stack area. */ in in_exception_stack()
[all …]
|
| H A D | dumpstack.c | 32 bool noinstr in_task_stack(unsigned long *stack, struct task_struct *task, in in_task_stack() argument
38 if (stack < begin || stack >= end) in in_task_stack()
50 bool noinstr in_entry_stack(unsigned long *stack, struct stack_info *info) in in_entry_stack() argument
57 if ((void *)stack < begin || (void *)stack >= end) in in_entry_stack()
134 /* No access to the user space stack of other tasks. Ignore. */ in show_opcodes()
166 * ordering reasons: if the registers are on the next stack, we don't in show_regs_if_on_stack()
168 * the wrong stack. Later, when show_trace_log_lvl() switches to the in show_regs_if_on_stack()
169 * next stack, this function will be called again with the same regs so in show_regs_if_on_stack()
187 unsigned long *stack, const char *log_lvl) in show_trace_log_lvl() argument
197 unwind_start(&state, task, regs, stack); in show_trace_log_lvl()
[all …]
|
| /OK3568_Linux_fs/kernel/tools/testing/selftests/bpf/verifier/ |
| H A D | precise.c | 43 regs=4 stack=0 before 25\
44 regs=4 stack=0 before 24\
45 regs=4 stack=0 before 23\
46 regs=4 stack=0 before 22\
47 regs=4 stack=0 before 20\
48 parent didn't have regs=4 stack=0 marks\
50 regs=4 stack=0 before 19\
51 regs=200 stack=0 before 18\
52 regs=300 stack=0 before 17\
53 regs=201 stack=0 before 15\
[all …]
|
| H A D | var_off.c | 21 "variable-offset stack read, priv vs unpriv",
23 /* Fill the top 8 bytes of the stack */
34 /* dereference it for a stack read */
41 .errstr_unpriv = "R2 variable stack access prohibited for !root",
45 "variable-offset stack read, uninitialized",
56 /* dereference it for a stack read */
62 .errstr = "invalid variable-offset read from stack R2",
66 "variable-offset stack write, priv vs unpriv",
77 /* Dereference it for a stack write */
89 /* Variable stack access is rejected for unprivileged.
[all …]
|
| /OK3568_Linux_fs/kernel/arch/um/os-Linux/skas/ |
| H A D | mem.c | 26 unsigned long *stack) in check_init_stack() argument
28 if (stack == NULL) { in check_init_stack()
29 stack = (unsigned long *) mm_idp->stack + 2; in check_init_stack()
30 *stack = 0; in check_init_stack()
32 return stack; in check_init_stack()
74 * beginning of the stack: in do_syscall_stub()
78 ret = *((unsigned long *) mm_idp->stack); in do_syscall_stub()
79 offset = *((unsigned long *) mm_idp->stack + 1); in do_syscall_stub()
81 data = (unsigned long *)(mm_idp->stack + offset - STUB_DATA); in do_syscall_stub()
114 unsigned long *stack = check_init_stack(mm_idp, *addr); in run_syscall_stub() local
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v1/export-user_ta/include/openssl/ |
| H A D | stack.h | 69 // A stack, in OpenSSL, is an array of pointers. They are the most commonly
72 // This file defines macros for type safe use of the stack functions. A stack
83 // Although note that the stack will contain /pointers/ to |FOO|.
116 // These are the raw stack functions, you shouldn't be using them. Rather you
117 // should be using the type stack macros implemented above.
119 // sk_new creates a new, empty stack with the given comparison function, which
120 // may be zero. It returns the new stack or NULL on allocation failure.
123 // sk_new_null creates a new, empty stack. It returns the new stack or NULL on
142 // sk_free frees the given stack and array of pointers, but does nothing to
146 // sk_pop_free calls |free_func| on each element in the stack and then frees
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v1/export-user_ta/host_include/openssl/ |
| H A D | stack.h | 69 // A stack, in OpenSSL, is an array of pointers. They are the most commonly
72 // This file defines macros for type safe use of the stack functions. A stack
83 // Although note that the stack will contain /pointers/ to |FOO|.
116 // These are the raw stack functions, you shouldn't be using them. Rather you
117 // should be using the type stack macros implemented above.
119 // sk_new creates a new, empty stack with the given comparison function, which
120 // may be zero. It returns the new stack or NULL on allocation failure.
123 // sk_new_null creates a new, empty stack. It returns the new stack or NULL on
142 // sk_free frees the given stack and array of pointers, but does nothing to
146 // sk_pop_free calls |free_func| on each element in the stack and then frees
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/fusion/view/iterator_range/detail/ |
| H A D | segmented_iterator_range.hpp | 30 // - Each segmented iterator has a stack
31 // - Each value in the stack is an iterator range
32 // - The range at the top of the stack points to values
34 // - The front of each range in the stack (besides the
96 template <typename Stack, std::size_t Size = Stack::size::value>
109 typename Stack::car_type::begin_type
117 , typename Stack::cdr_type::car_type::end_type
123 typename Stack::cdr_type::car_type::begin_type
132 typename Stack::car_type::begin_type
144 make_segment_sequence_front<typename Stack::cdr_type>
[all …]
|
| /OK3568_Linux_fs/kernel/security/ |
| H A D | Kconfig.hardening | 8 stack variable initializations, this warning is silenced for
38 prompt "Initialize kernel stack variables at function entry"
44 This option enables initialization of stack variables at
56 bool "no automatic stack variable initialization (weakest)"
58 Disable automatic stack variable initialization.
60 classes of uninitialized stack variable exploits
68 Zero-initialize any structures on the stack containing
70 uninitialized stack variable exploits and information
80 Zero-initialize any structures on the stack that may
83 of uninitialized stack variable exploits and information
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/host_include/openssl/ |
| H A D | stack.h | 69 // A stack, in OpenSSL, is an array of pointers. They are the most commonly
72 // This file defines macros for type safe use of the stack functions. A stack
83 // Although note that the stack will contain /pointers/ to |FOO|.
89 // stack_free_func is a function that frees an element in a stack. Note its
94 // stack_copy_func is a function that copies an element in a stack. Note its
129 // These are the raw stack functions, you shouldn't be using them. Rather you
130 // should be using the type stack macros implemented above.
132 // sk_new creates a new, empty stack with the given comparison function, which
133 // may be zero. It returns the new stack or NULL on allocation failure.
136 // sk_new_null creates a new, empty stack. It returns the new stack or NULL on
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/openssl/ |
| H A D | stack.h | 69 // A stack, in OpenSSL, is an array of pointers. They are the most commonly
72 // This file defines macros for type safe use of the stack functions. A stack
83 // Although note that the stack will contain /pointers/ to |FOO|.
89 // stack_free_func is a function that frees an element in a stack. Note its
94 // stack_copy_func is a function that copies an element in a stack. Note its
129 // These are the raw stack functions, you shouldn't be using them. Rather you
130 // should be using the type stack macros implemented above.
132 // sk_new creates a new, empty stack with the given comparison function, which
133 // may be zero. It returns the new stack or NULL on allocation failure.
136 // sk_new_null creates a new, empty stack. It returns the new stack or NULL on
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/openssl/ |
| H A D | stack.h | 69 // A stack, in OpenSSL, is an array of pointers. They are the most commonly
72 // This file defines macros for type safe use of the stack functions. A stack
83 // Although note that the stack will contain /pointers/ to |FOO|.
89 // stack_free_func is a function that frees an element in a stack. Note its
94 // stack_copy_func is a function that copies an element in a stack. Note its
129 // These are the raw stack functions, you shouldn't be using them. Rather you
130 // should be using the type stack macros implemented above.
132 // sk_new creates a new, empty stack with the given comparison function, which
133 // may be zero. It returns the new stack or NULL on allocation failure.
136 // sk_new_null creates a new, empty stack. It returns the new stack or NULL on
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/host_include/openssl/ |
| H A D | stack.h | 69 // A stack, in OpenSSL, is an array of pointers. They are the most commonly
72 // This file defines macros for type safe use of the stack functions. A stack
83 // Although note that the stack will contain /pointers/ to |FOO|.
89 // stack_free_func is a function that frees an element in a stack. Note its
94 // stack_copy_func is a function that copies an element in a stack. Note its
129 // These are the raw stack functions, you shouldn't be using them. Rather you
130 // should be using the type stack macros implemented above.
132 // sk_new creates a new, empty stack with the given comparison function, which
133 // may be zero. It returns the new stack or NULL on allocation failure.
136 // sk_new_null creates a new, empty stack. It returns the new stack or NULL on
[all …]
|
| /OK3568_Linux_fs/kernel/arch/x86/entry/ |
| H A D | entry_32.S | 7 * Stack layout while running C code:
8 * ptrace needs to have all registers on the stack.
59 * %gs is used for userland TLS and kernel only uses it for stack
200 * When we're here from kernel mode; the (exception) stack looks like:
248 * so any attempt to access the stack needs to use SS. (except for
257 * middle doesn't scribble our stack.
313 /* Switch to kernel stack if necessary */
409 * Setup and switch to ESPFIX stack
411 * We're returning to userspace with a 16 bit stack. The CPU will not
445 * entry-stack, it will overwrite the task-stack and everything we
[all …]
|
| /OK3568_Linux_fs/kernel/Documentation/x86/ |
| H A D | kernel-stacks.rst | 14 Like all other architectures, x86_64 has a kernel stack for every
17 zombie. While the thread is in user space the kernel stack is empty
25 * Interrupt stack. IRQ_STACK_SIZE
29 kernel switches from the current task to the interrupt stack. Like
32 of every per thread stack.
34 The interrupt stack is also used when processing a softirq.
36 Switching to the kernel interrupt stack is done by software based on a
41 to automatically switch to a new stack for designated events such as
43 events on x86_64. This feature is called the Interrupt Stack Table
46 point to dedicated stacks; each stack can be a different size.
[all …]
|
| /OK3568_Linux_fs/kernel/lib/ |
| H A D | stackdepot.c | 3 * Generic stack depot for storing stack traces.
5 * Some debugging tools need to save stack traces of certain events which can
7 * free stacks for each object, but storing two stack traces per object
11 * Instead, stack depot maintains a hashtable of unique stacktraces. Since alloc
39 #define STACK_ALLOC_ORDER 2 /* 'Slab' size order for stack depot, 4 pages */
64 u32 size; /* Number of frames in the stack */
104 /* Allocation of a new stack in raw storage */
108 struct stack_record *stack; in depot_alloc_stack() local
109 size_t required_size = struct_size(stack, entries, size); in depot_alloc_stack()
115 WARN_ONCE(1, "Stack depot reached limit capacity"); in depot_alloc_stack()
[all …]
|
| /OK3568_Linux_fs/kernel/kernel/trace/ |
| H A D | trace_stack.c | 58 * The stack tracer looks for a maximum stack at each call from a function. It
59 * registers a callback from ftrace, and in that callback it examines the stack
60 * size. It determines the stack size from the variable passed in, which is the
62 * The stack size is calculated by the address of the local variable to the top
63 * of the current stack. If that size is smaller than the currently saved max
64 * stack size, nothing more is done.
66 * If the size of the stack is greater than the maximum recorded size, then the
70 * saving the function's local variables, the stack will look something like
73 * [ top of stack ]
80 * 31: [ do trace stack here ]
[all …]
|