Home
last modified time | relevance | path

Searched refs:stack (Results 226 - 250 of 3084) sorted by relevance

12345678910>>...124

/third_party/ninja/src/
H A Dgraph.cc52 std::vector<Node*> stack; in RecomputeDirty() local
63 stack.clear(); in RecomputeDirty()
66 if (!RecomputeNodeDirty(node, &stack, &new_validation_nodes, err)) in RecomputeDirty()
82 bool DependencyScan::RecomputeNodeDirty(Node* node, std::vector<Node*>* stack, in RecomputeNodeDirty() argument
103 // If we encountered this edge earlier in the call stack we have a cycle. in RecomputeNodeDirty()
104 if (!VerifyDAG(node, stack, err)) in RecomputeNodeDirty()
107 // Mark the edge temporarily while in the call stack. in RecomputeNodeDirty()
109 stack->push_back(node); in RecomputeNodeDirty()
128 if (!RecomputeNodeDirty(edge->dyndep_, stack, validation_nodes, err)) in RecomputeNodeDirty()
172 if (!RecomputeNodeDirty(*i, stack, validation_node in RecomputeNodeDirty()
225 VerifyDAG(Node* node, vector<Node*>* stack, string* err) VerifyDAG() argument
[all...]
/third_party/gn/src/base/containers/
H A Dstack.h8 #include <stack>
14 // Provides a definition of base::stack that's like std::stack but uses a
15 // base::circular_queue instead of std::deque. Since std::stack is just a
19 using stack = std::stack<T, Container>;
/third_party/node/deps/openssl/openssl/apps/
H A Dlist.c96 static void collect_ciphers(EVP_CIPHER *cipher, void *stack) in collect_ciphers() argument
98 STACK_OF(EVP_CIPHER) *cipher_stack = stack; in collect_ciphers()
180 static void collect_digests(EVP_MD *digest, void *stack) in collect_digests() argument
182 STACK_OF(EVP_MD) *digest_stack = stack; in collect_digests()
248 static void collect_macs(EVP_MAC *mac, void *stack) in collect_macs() argument
250 STACK_OF(EVP_MAC) *mac_stack = stack; in collect_macs()
312 static void collect_kdfs(EVP_KDF *kdf, void *stack) in collect_kdfs() argument
314 STACK_OF(EVP_KDF) *kdf_stack = stack; in collect_kdfs()
382 static void collect_rands(EVP_RAND *rand, void *stack) in collect_rands() argument
384 STACK_OF(EVP_RAND) *rand_stack = stack; in collect_rands()
508 collect_encoders(OSSL_ENCODER *encoder, void *stack) collect_encoders() argument
573 collect_decoders(OSSL_DECODER *decoder, void *stack) collect_decoders() argument
635 collect_keymanagers(EVP_KEYMGMT *km, void *stack) collect_keymanagers() argument
698 collect_signatures(EVP_SIGNATURE *sig, void *stack) collect_signatures() argument
758 collect_kem(EVP_KEM *kem, void *stack) collect_kem() argument
817 collect_asymciph(EVP_ASYM_CIPHER *asym_cipher, void *stack) collect_asymciph() argument
879 collect_kex(EVP_KEYEXCH *kex, void *stack) collect_kex() argument
1160 collect_store_loaders(OSSL_STORE_LOADER *store, void *stack) collect_store_loaders() argument
1209 collect_providers(OSSL_PROVIDER *provider, void *stack) collect_providers() argument
[all...]
/third_party/openssl/apps/
H A Dlist.c96 static void collect_ciphers(EVP_CIPHER *cipher, void *stack) in collect_ciphers() argument
98 STACK_OF(EVP_CIPHER) *cipher_stack = stack; in collect_ciphers()
180 static void collect_digests(EVP_MD *digest, void *stack) in collect_digests() argument
182 STACK_OF(EVP_MD) *digest_stack = stack; in collect_digests()
248 static void collect_macs(EVP_MAC *mac, void *stack) in collect_macs() argument
250 STACK_OF(EVP_MAC) *mac_stack = stack; in collect_macs()
312 static void collect_kdfs(EVP_KDF *kdf, void *stack) in collect_kdfs() argument
314 STACK_OF(EVP_KDF) *kdf_stack = stack; in collect_kdfs()
382 static void collect_rands(EVP_RAND *rand, void *stack) in collect_rands() argument
384 STACK_OF(EVP_RAND) *rand_stack = stack; in collect_rands()
508 collect_encoders(OSSL_ENCODER *encoder, void *stack) collect_encoders() argument
573 collect_decoders(OSSL_DECODER *decoder, void *stack) collect_decoders() argument
635 collect_keymanagers(EVP_KEYMGMT *km, void *stack) collect_keymanagers() argument
698 collect_signatures(EVP_SIGNATURE *sig, void *stack) collect_signatures() argument
758 collect_kem(EVP_KEM *kem, void *stack) collect_kem() argument
817 collect_asymciph(EVP_ASYM_CIPHER *asym_cipher, void *stack) collect_asymciph() argument
879 collect_kex(EVP_KEYEXCH *kex, void *stack) collect_kex() argument
1160 collect_store_loaders(OSSL_STORE_LOADER *store, void *stack) collect_store_loaders() argument
1209 collect_providers(OSSL_PROVIDER *provider, void *stack) collect_providers() argument
[all...]
/third_party/python/Objects/
H A Dframeobject.c130 /* Model the evaluation stack, to determine which jumps
132 * The stack is modelled by a 64 integer, treating any
133 * stack that can't fit into 64 bits as "overflowed".
169 push_value(int64_t stack, Kind kind) in push_value() argument
171 if (((uint64_t)stack) >= WILL_OVERFLOW) { in push_value()
175 return (stack << BITS_PER_BLOCK) | kind; in push_value()
180 pop_value(int64_t stack) in pop_value() argument
182 return Py_ARITHMETIC_RIGHT_SHIFT(int64_t, stack, BITS_PER_BLOCK); in pop_value()
188 top_of_stack(int64_t stack) in top_of_stack() argument
190 return stack in top_of_stack()
194 peek(int64_t stack, int n) peek() argument
201 stack_swap(int64_t stack, int n) stack_swap() argument
213 pop_to_level(int64_t stack, int level) pop_to_level() argument
[all...]
/kernel/uniproton/src/core/kernel/task/
H A Dprt_task_info.c82 U32 *stack = NULL; in OsTaskStackPeakGet() local
84 stack = (U32 *)(stackInfo->top + sizeof(U32)); in OsTaskStackPeakGet()
85 while ((stack < (U32 *)stackInfo->sp) && (*stack == OS_TSK_STACK_MAGIC)) { in OsTaskStackPeakGet()
86 stack += 1; in OsTaskStackPeakGet()
89 stackInfo->peakUsed = (U32)(stackInfo->bottom - (uintptr_t)stack); in OsTaskStackPeakGet()
/third_party/glslang/glslang/MachineIndependent/
H A DPoolAlloc.cpp164 stack.push_back(state); in push()
181 if (stack.size() < 1) in pop()
184 tHeader* page = stack.back().page; in pop()
185 currentPageOffset = stack.back().offset; in pop()
204 stack.pop_back(); in pop()
213 while (stack.size() > 0) in popAll()
/third_party/libunwind/libunwind/doc/
H A Dunw_step.tex8 \begin{Name}{3}{unw\_step}{David Mosberger-Tang}{Programming Library}{unw\_step}unw\_step -- advance to next stack frame
20 the next older, less deeply nested stack frame.
25 if the updated cursor refers to a valid stack frame, or 0 if the
26 previous stack frame was the last frame in the chain. On error, the
44 (``program-counter'') of the next stack frame is invalid (e.g., not
46 \item[\Const{UNW\_EBADFRAME}] The next stack frame is invalid.
/third_party/python/Lib/
H A Dgraphlib.py200 stack = []
212 # current stack we have found a cycle.
214 return stack[node2stacki[node] :] + [node]
219 node2stacki[node] = len(stack)
220 stack.append(node)
222 # Backtrack to the topmost stack entry with
224 while stack:
229 del node2stacki[stack.pop()]
H A Dpyclbr.py193 self.stack = []
211 parent = self.stack[-1] if self.stack else None
216 self.stack.append(class_)
218 self.stack.pop()
221 parent = self.stack[-1] if self.stack else None
226 self.stack.append(function)
228 self.stack.pop()
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/
H A Dequivalence_relation.h146 std::vector<const T*> stack; in GetEquivalenceClass() local
147 stack.push_back(Find(*value_set_.find(&value))); in GetEquivalenceClass()
148 while (!stack.empty()) { in GetEquivalenceClass()
149 const T* item = stack.back(); in GetEquivalenceClass()
151 stack.pop_back(); in GetEquivalenceClass()
153 stack.push_back(child); in GetEquivalenceClass()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/
H A Dequivalence_relation.h146 std::vector<const T*> stack; in GetEquivalenceClass() local
147 stack.push_back(Find(*value_set_.find(&value))); in GetEquivalenceClass()
148 while (!stack.empty()) { in GetEquivalenceClass()
149 const T* item = stack.back(); in GetEquivalenceClass()
151 stack.pop_back(); in GetEquivalenceClass()
153 stack.push_back(child); in GetEquivalenceClass()
/third_party/spirv-tools/source/fuzz/
H A Dequivalence_relation.h146 std::vector<const T*> stack; in GetEquivalenceClass() local
147 stack.push_back(Find(*value_set_.find(&value))); in GetEquivalenceClass()
148 while (!stack.empty()) { in GetEquivalenceClass()
149 const T* item = stack.back(); in GetEquivalenceClass()
151 stack.pop_back(); in GetEquivalenceClass()
153 stack.push_back(child); in GetEquivalenceClass()
/kernel/linux/linux-5.10/net/llc/
H A Dllc_sap.c363 struct sock **stack, int count) in llc_do_mcast()
371 sock_put(stack[i]); in llc_do_mcast()
375 llc_sap_rcv(sap, skb1, stack[i]); in llc_do_mcast()
376 sock_put(stack[i]); in llc_do_mcast()
395 struct sock *stack[256 / sizeof(struct sock *)]; in llc_sap_mcast() local
408 if (i < ARRAY_SIZE(stack)) in llc_sap_mcast()
409 stack[i++] = sk; in llc_sap_mcast()
411 llc_do_mcast(sap, skb, stack, i); in llc_sap_mcast()
417 llc_do_mcast(sap, skb, stack, i); in llc_sap_mcast()
362 llc_do_mcast(struct llc_sap *sap, struct sk_buff *skb, struct sock **stack, int count) llc_do_mcast() argument
/kernel/linux/linux-6.6/net/llc/
H A Dllc_sap.c367 struct sock **stack, int count) in llc_do_mcast()
375 sock_put(stack[i]); in llc_do_mcast()
379 llc_sap_rcv(sap, skb1, stack[i]); in llc_do_mcast()
380 sock_put(stack[i]); in llc_do_mcast()
399 struct sock *stack[256 / sizeof(struct sock *)]; in llc_sap_mcast() local
412 if (i < ARRAY_SIZE(stack)) in llc_sap_mcast()
413 stack[i++] = sk; in llc_sap_mcast()
415 llc_do_mcast(sap, skb, stack, i); in llc_sap_mcast()
421 llc_do_mcast(sap, skb, stack, i); in llc_sap_mcast()
366 llc_do_mcast(struct llc_sap *sap, struct sk_buff *skb, struct sock **stack, int count) llc_do_mcast() argument
/third_party/ffmpeg/tests/checkasm/arm/
H A Dcheckasm.S49 .asciz "failed to preserve stack"
57 @ Align the used stack space to 8 to preserve the stack alignment.
58 @ +8 for stack canary reference.
86 @ For stack overflows, the callee is free to overwrite the parameters
87 @ that were passed on the stack (if any), so we can only check after
89 @ really took on the stack:
91 @ Load the first non-parameter value from the stack, that should be
105 @ Load the number of stack parameters, stack canar
[all...]
/third_party/mbedtls/scripts/
H A Dgenerate_ssl_debug_helpers.py57 stack = []
63 nonlocal stack
65 if stack:
90 stack.append((directive, param, start, end))
93 if not stack:
96 pair_directive, pair_param, pair_start, pair_end = stack.pop()
116 stack.append((directive, param, start, end))
117 assert not stack, len(stack)
/third_party/skia/third_party/externals/freetype/src/lzw/
H A Dftzopen.c117 /* grow the character stack */
131 if ( state->stack == state->stack_0 ) in ft_lzwstate_stack_grow()
133 state->stack = NULL; in ft_lzwstate_stack_grow()
137 /* requirement of the character stack larger than 1<<LZW_MAX_BITS */ in ft_lzwstate_stack_grow()
146 if ( FT_QRENEW_ARRAY( state->stack, old_size, new_size ) ) in ft_lzwstate_stack_grow()
151 FT_MEM_COPY( state->stack, state->stack_0, FT_LZW_DEFAULT_STACK_SIZE ); in ft_lzwstate_stack_grow()
225 state->stack = state->stack_0; in ft_lzwstate_init()
240 if ( state->stack != state->stack_0 ) in ft_lzwstate_done()
241 FT_FREE( state->stack ); in ft_lzwstate_done()
256 state->stack[stat
[all...]
/third_party/python/Modules/
H A D_pickle.c441 /* Internal data type used as the unpickling stack. */
539 "unpickling stack underflow"); in Pdata_stack_underflow()
544 * must be an lvalue holding PyObject*. On stack underflow, UnpicklingError
570 /* Push an object on stack, transferring its ownership to the stack. */
574 /* Push an object on stack, adding a new reference to the object. */
670 Pdata *stack; /* Pickle data stack, store unpickled objects. */ member
701 Py_ssize_t *marks; /* Mark stack, used for unpickling container
703 Py_ssize_t num_marks; /* Number of marks in the mark stack
[all...]
/kernel/linux/linux-6.6/arch/s390/purgatory/
H A Dhead.S34 #define bufsz purgatory_end-stack
48 larl %r1,stack
95 /* Setup stack */
159 * behind the point of no return it can re-use the stack as buffer.
162 larl %r12,stack
184 larl %r7,stack
261 SYM_DATA_START_LOCAL(stack)
263 .skip stack-purgatory_start
265 SYM_DATA_END_LABEL(stack, SYM_L_LOCAL, purgatory_end)
/third_party/libunwind/libunwind/tests/
H A Dx64-test-dwarf-expressions.S9 # stack-based operations which allow the compiler to encode integer mathematics
14 # always start with the current CFA pushed onto the stack. This file contains a
22 # r12 after stashing its value on the stack. This routine contains a DWARF3 CFI
26 # by using libunwind to unwind the stack through DW_CFA_expression_inner and up
28 # libunwind will be able to restore r12 from the stack.
38 # which uses implicit CFA pushed onto stack. #
66 # Parsing starts with the CFA on the stack, then pushes 16, then does a minus
/kernel/linux/linux-6.6/drivers/media/mc/
H A Dmc-entity.c278 /* push an entity to traversal stack */
287 graph->stack[graph->top].link = entity->links.next; in stack_push()
288 graph->stack[graph->top].entity = entity; in stack_push()
295 entity = graph->stack[graph->top].entity; in stack_pop()
301 #define link_top(en) ((en)->stack[(en)->top].link)
302 #define stack_top(en) ((en)->stack[(en)->top].entity)
339 graph->stack[graph->top].entity = NULL; in media_graph_walk_start()
382 /* Push the new entity to stack and start over. */ in media_graph_walk_iter()
385 dev_dbg(entity->graph_obj.mdev->dev, "walk: pushing '%s' on stack\n", in media_graph_walk_iter()
398 * Depth first search. Push entity to stack an in media_graph_walk_next()
458 } stack; global() member
[all...]
/kernel/linux/linux-5.10/arch/m68k/ifpsp060/
H A Dfskeleton.S72 | for enabled overflow conditions. The exception stack frame is an overflow
73 | stack frame. The FP state frame holds the EXCEPTIONAL OPERAND.
91 | for enabled underflow conditions. The exception stack frame is an underflow
92 | stack frame. The FP state frame holds the EXCEPTIONAL OPERAND.
109 | for enabled operand error exceptions. The exception stack frame is an operand error
110 | stack frame. The FP state frame holds the source operand of the faulting
128 | for enabled signalling NaN exceptions. The exception stack frame is a signalling NaN
129 | stack frame. The FP state frame holds the source operand of the faulting
147 | for enabled divide-by-zero exceptions. The exception stack frame is a divide-by-zero
148 | stack fram
[all...]
/kernel/linux/linux-6.6/arch/m68k/ifpsp060/
H A Dfskeleton.S72 | for enabled overflow conditions. The exception stack frame is an overflow
73 | stack frame. The FP state frame holds the EXCEPTIONAL OPERAND.
91 | for enabled underflow conditions. The exception stack frame is an underflow
92 | stack frame. The FP state frame holds the EXCEPTIONAL OPERAND.
109 | for enabled operand error exceptions. The exception stack frame is an operand error
110 | stack frame. The FP state frame holds the source operand of the faulting
128 | for enabled signalling NaN exceptions. The exception stack frame is a signalling NaN
129 | stack frame. The FP state frame holds the source operand of the faulting
147 | for enabled divide-by-zero exceptions. The exception stack frame is a divide-by-zero
148 | stack fram
[all...]
/kernel/linux/linux-6.6/arch/arm/kernel/
H A Dirq.c55 u8 *stack; in init_irq_stacks() local
60 stack = (u8 *)__get_free_pages(GFP_KERNEL, in init_irq_stacks()
63 stack = __vmalloc_node(THREAD_SIZE, THREAD_ALIGN, in init_irq_stacks()
67 if (WARN_ON(!stack)) in init_irq_stacks()
69 per_cpu(irq_stack_ptr, cpu) = &stack[THREAD_SIZE]; in init_irq_stacks()

Completed in 18 milliseconds

12345678910>>...124