| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| RawMessageChannel.java | 1 package gov.nist.javax.sip.stack;
|
| SIPStackTimerTask.java | 9 package gov.nist.javax.sip.stack;
31 System.out.println("SIP stack timer task failed due to exception:");
|
| ServerRequestInterface.java | 29 package gov.nist.javax.sip.stack;
35 * This is implemented by the application. The stack calls the message
|
| /external/skia/tests/ |
| ClipBoundsTest.cpp | 29 // create a clip stack that will (trivially) reduce to a single rect that
31 SkClipStack stack; local
32 stack.clipRect(clipRect, SkMatrix::I(), kReplace_SkClipOp, false);
37 stack.getConservativeBounds(0, 0, kXSize, kYSize,
46 GrClipStackClip clipData(&stack);
|
| /external/skqp/tests/ |
| ClipBoundsTest.cpp | 29 // create a clip stack that will (trivially) reduce to a single rect that
31 SkClipStack stack; local
32 stack.clipRect(clipRect, SkMatrix::I(), kReplace_SkClipOp, false);
37 stack.getConservativeBounds(0, 0, kXSize, kYSize,
46 GrClipStackClip clipData(&stack);
|
| /external/compiler-rt/lib/lsan/ |
| lsan_allocator.h | 23 void *Allocate(const StackTrace &stack, uptr size, uptr alignment,
26 void *Reallocate(const StackTrace &stack, void *p, uptr new_size,
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_symbolizer_mac.h | 27 bool SymbolizePC(uptr addr, SymbolizedStack *stack) override;
37 bool SymbolizePC(uptr addr, SymbolizedStack *stack) override;
|
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.cons/ |
| deduct.pass.cpp | 10 // <stack>
19 // stack(Container) -> stack<typename Container::value_type, Container>;
22 // stack(Container, Allocator) -> stack<typename Container::value_type, Container>;
25 #include <stack>
45 std::stack stk(v);
47 static_assert(std::is_same_v<decltype(stk), std::stack<int, std::vector<int>>>, "");
54 std::stack stk(l, test_allocator<long>(0,2)); // different allocator
59 // I'd like to assert that we've gotten the right allocator in the stack, bu
[all...] |
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/ |
| push_rv.pass.cpp | 12 // <stack>
16 #include <stack>
23 std::stack<MoveOnly> q;
|
| /external/skia/src/sksl/lex/ |
| RegexParser.h | 13 #include <stack>
86 std::stack<RegexNode> fStack;
|
| /external/skqp/src/sksl/lex/ |
| RegexParser.h | 13 #include <stack>
86 std::stack<RegexNode> fStack;
|
| /external/mesa3d/src/mesa/main/ |
| matrix.c | 62 * the top matrix of the current matrix stack and sets
105 * the top matrix of the current matrix stack and sets
138 * Set the current matrix stack.
140 * \param mode matrix stack.
146 * with the specified matrix stack.
216 * Push the current matrix stack.
220 * Verifies the current matrix stack is not full, and duplicates the top-most
221 * matrix in the stack.
222 * Marks __struct gl_contextRec::NewState with the stack dirty flag.
228 struct gl_matrix_stack *stack = ctx->CurrentStack local
285 struct gl_matrix_stack *stack = ctx->CurrentStack; local
[all...] |
| /device/linaro/bootloader/edk2/StdLib/LibC/CRT/Ia32/ |
| lldvrm.c | 37 ; Original local stack when calling _alldvrm
56 ; NOTE: this routine removes the parameters from the stack.
60 ; Set up the local stack for Reminder pointer
66 ; Set up the local stack for Divisor parameter
74 ; Set up the local stack for Dividend parameter
94 ; Adjust stack
local
|
| ulldvrm.c | 37 ; Original local stack when calling _aulldvrm
56 ; NOTE: this routine removes the parameters from the stack.
60 ; Set up the local stack for Remainder pointer
66 ; Set up the local stack for Divisor parameter
74 ; Set up the local stack for Dividend parameter
94 ; Adjust stack
local
|
| /external/apache-http/src/org/apache/http/impl/client/ |
| ClientParamsStack.java | 42 * Represents a stack of parameter collections.
43 * When retrieving a parameter, the stack is searched in a fixed order
44 * and the first match returned. Setting parameters via the stack is
45 * not supported. To minimize overhead, the stack has a fixed size and
47 * The supported stack entries, sorted by increasing priority, are:
69 * Each stack entry may be <code>null</code>. That is preferable over
101 * Creates a new parameter stack from elements.
120 * Creates a copy of a parameter stack.
121 * The new stack will have the exact same entries as the argument stack
[all...] |
| /external/tensorflow/tensorflow/lite/kernels/ |
| skip_gram.cc | 69 const std::vector<int>& stack, int stack_idx,
71 // If current stack size and next word enumeration are within valid range.
72 if (stack_idx < params->ngram_size && stack[stack_idx] + 1 < num_words) {
73 // If this stack is empty, step in for first word enumeration.
79 // next_word_idx = stack[stack_idx] + 1
80 // next_word_idx - stack[stack_idx-1] <= max_skip_size + 1
81 if (stack[stack_idx] - stack[stack_idx - 1] <= params->max_skip_size) {
114 // Stack stores the index of word used to generate ngram.
115 // The size of stack is the size of ngram
[all...] |
| /external/xz-java/src/org/tukaani/xz/ |
| BasicArrayCache.java | 59 * A thread-safe stack-like data structure whose {@code push} method
60 * overwrites the oldest element in the stack if the stack is full.
64 * Array that holds the elements in the cyclic stack.
72 * If it is {@code null}, then the stack is empty and all
76 * the stack is empty. This means that when the first element is
78 * {@code refs} and the stack will start growing from there.
83 * Gets the most recently added element from the stack.
84 * If the stack is empty, {@code null} is returned.
94 * Adds a new element to the stack. If the stack is full, the oldes
[all...] |
| /external/elfutils/libdwfl/ |
| frame_unwind.c | 39 /* Maximum number of DWARF expression stack slots before returning an error. */
107 do_push (struct eval_stack *stack, Dwarf_Addr val)
109 if (stack->used >= DWARF_EXPR_STACK_MAX)
114 if (stack->used == stack->allocated)
116 stack->allocated = MAX (stack->allocated * 2, 32);
118 new_addrs = realloc (stack->addrs,
119 stack->allocated * sizeof (*stack->addrs))
156 struct eval_stack stack = local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| NamespaceMappings.java | 31 * prefix/uri/depth triplets are pushed on a stack pushed on a stack. The depth
47 * "def" is pushed on the stack with depth 1.
52 * stack. Of course popNamespaces(2) would pop anything with depth 2 or
55 * So prefix/uri pairs are pushed and poped off the stack as elements are
57 * are on the stack and a prefix can be found given a uri, or a uri can be found
73 * Each entry (prefix) in this hashtable points to a Stack of URIs
74 * This table maps a prefix (String) to a Stack of NamespaceNodes.
75 * All Namespace nodes in that retrieved stack have the same prefix,
76 * though possibly different URI's or depths. Such a stack must hav
119 Stack stack; local
141 final Stack stack = getPrefixStack(prefix); local
152 final Stack stack = (Stack) m_namespaces.get(prefix); local
210 Stack stack; local
233 Stack stack; local
[all...] |
| /external/compiler-rt/lib/asan/tests/ |
| asan_noinst_test.cc | 136 BufferedStackTrace stack; local
137 stack.trace_buffer[0] = 0x890;
138 stack.size = 1;
141 void *p = __asan::asan_malloc(size, &stack);
142 __asan::asan_free(p, &stack, __asan::FROM_MALLOC);
146 void *p1 = __asan::asan_malloc(size, &stack);
147 __asan::asan_free(p1, &stack, __asan::FROM_MALLOC);
157 BufferedStackTrace stack; local
158 stack.trace_buffer[0] = 0x890;
159 stack.size = 1
184 BufferedStackTrace stack; local
237 BufferedStackTrace stack; local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| TreeTraverser.java | 85 private final Deque<Iterator<T>> stack;
88 this.stack = new ArrayDeque<Iterator<T>>();
89 stack.addLast(Iterators.singletonIterator(checkNotNull(root)));
94 return !stack.isEmpty();
99 Iterator<T> itr = stack.getLast(); // throws NSEE if empty
102 stack.removeLast();
106 stack.addLast(childItr);
145 private final ArrayDeque<PostOrderNode<T>> stack;
148 this.stack = new ArrayDeque<PostOrderNode<T>>();
149 stack.addLast(expand(root))
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeTraverser.java | 77 private final LinkedList<Iterator<T>> stack;
80 this.stack = Lists.newLinkedList();
81 stack.addLast(Iterators.singletonIterator(checkNotNull(root)));
86 return !stack.isEmpty();
91 Iterator<T> itr = stack.getLast(); // throws NSEE if empty
94 stack.removeLast();
98 stack.addLast(childItr);
137 private final LinkedList<PostOrderNode<T>> stack;
140 this.stack = Lists.newLinkedList();
141 stack.addLast(expand(root))
[all...] |
| BinaryTreeTraverser.java | 106 private final LinkedList<InOrderNode<T>> stack;
109 this.stack = Lists.newLinkedList();
110 stack.addLast(new InOrderNode<T>(root));
115 while (!stack.isEmpty()) {
116 InOrderNode<T> inOrderNode = stack.getLast();
118 stack.removeLast();
131 stack.addLast(new InOrderNode<T>(node.get()));
|
| /external/strace/m4/ |
| st_stacktrace.m4 | 32 [whether to enable stack tracing support, default is check])],
42 dnl Whether to enable stack tracing support?
55 [AC_MSG_ERROR([stack tracing support requires an unwinder])]
60 AC_MSG_CHECKING([whether to enable stack tracing support])
68 [Define to enable stack tracing support])
70 [The unwinder to use for stack tracing support])
72 dnl As stack tracing support is enabled, check for a demangler.
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/pgen2/ |
| parse.py | 104 # Each stack entry is a tuple: (dfa, state, node).
109 self.stack = [stackentry]
119 dfa, state, node = self.stack[-1]
134 if not self.stack:
137 dfa, state, node = self.stack[-1]
153 if not self.stack:
177 dfa, state, node = self.stack[-1]
182 self.stack[-1] = (dfa, newstate, node)
186 dfa, state, node = self.stack[-1]
188 self.stack[-1] = (dfa, newstate, node)
[all...] |
