| /external/llvm/lib/Target/X86/ |
| X86FloatingPoint.cpp | 1 //===-- X86FloatingPoint.cpp - Floating point Reg -> Stack converter ------===//
11 // pseudo registers into register stack instructions. This pass uses live
15 // The x87 hardware tracks liveness of the stack registers, so it is necessary
18 // identical stack positions. Instructions are inserted at the end of each basic
59 memset(Stack, 0, sizeof(Stack));
80 // LiveBundle. It represents a set of CFG edges where the live FP stack
81 // registers must be allocated identically in the x87 stack.
88 // but the exact mapping of FP registers to stack slots is fixed later.
94 // stack order has not yet been fixed
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| XPathContext.java | 24 import java.util.Stack;
67 * Stack of cached "reusable" DTMs for Result Tree Fragments.
71 * %REVIEW% I'm using a Vector rather than Stack so we can reuse
81 * Most recent "reusable" DTM for Global Result Tree Fragments. No stack is
419 * Push a slot on the locations stack so that setSAXLocator can be
471 * The stack of Variable stacks. A VariableStack will be
472 * pushed onto this stack for each template invocation.
477 * Get the variable stack, which is in charge of variables and
480 * @return the variable stack, which should not be null.
488 * Get the variable stack, which is in charge of variables an
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| Interpreter.java | 40 import java.util.Stack;
145 Stack ruleInvocationStack = new Stack();
182 Stack ruleInvocationStack = new Stack();
215 Stack ruleInvocationStack,
287 //System.out.println("stack empty in stop state for "+s.getEnclosingRule());
290 // pop invoking state off the stack to know where to return to
|
| RandomPhrase.java | 43 import java.util.Stack;
73 Stack ruleInvocationStack = new Stack();
101 //System.out.println("stack depth="+ruleInvocationStack.size());
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| CommonTreeNodeStream.cs | 58 /** <summary>Stack of indexes used for push/pop calls</summary> */
59 Stack<int> _calls;
173 _calls = new Stack<int>();
180 * Return top of stack (return index).
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| CommonTreeNodeStream.cs | 60 /** <summary>Stack of indexes used for push/pop calls</summary> */
61 Stack<int> _calls;
201 _calls = new Stack<int>();
208 * Return top of stack (return index).
|
| /external/chromium_org/chrome/browser/resources/ntp4/ |
| logging.js | 10 /* Stack of events that has been logged. */
18 * stack.
|
| /development/samples/Wiktionary/src/com/example/android/wiktionary/ |
| LookupActivity.java | 45 import java.util.Stack;
64 * History stack of previous words browsed in this session. This is
68 private Stack<String> mHistory = new Stack<String>();
115 * stack. If we don't have any remaining history, the key behaves normally
120 // Handle back key as long we have a history stack
131 // Pop last entry off stack and start loading
144 * history stack if requested. The navigation happens on a background thread
148 * @param pushHistory If true, push the current word onto history stack.
151 // Push any current word onto the history stack
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/ingest/data/ |
| MtpDeviceIndexRunnable.java | 15 import java.util.Stack;
162 Stack<Integer> pendingDirectories = new Stack<Integer>();
|
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/ |
| BinaryDictIOUtils.java | 28 import java.util.Stack;
93 Stack<Position> stack = new Stack<>(); local
97 stack.push(initPos);
99 while (!stack.empty()) {
100 Position p = stack.peek();
116 stack.pop();
134 stack.pop();
142 stack.push(childrenPos)
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/scene/ |
| ViewHierarchyLoader.java | 34 import java.util.Stack;
64 Stack<ViewNode> stack = new Stack<ViewNode>(); local
77 stack.push(lastNode);
78 } else if (!stack.isEmpty()) {
81 stack.pop();
102 if (!stack.isEmpty()) {
103 final ViewNode parent = stack.peek();
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| pmu-bison.c | 277 /* The OS might guarantee only one guard page at the bottom of the stack,
280 to allow for a few compiler-allocated temporary stack slots. */
319 /* A type that is properly aligned for any stack member. */
326 /* The size of the maximum gap between one aligned stack and the next. */
337 /* Relocate STACK from its old location to the new one. The
339 elements in the stack, and YYPTR gives the new location of the
340 stack. Advance YYPTR to a properly aligned location for the next
341 stack. */
342 # define YYSTACK_RELOCATE(Stack_alloc, Stack) \
346 YYCOPY (&yyptr->Stack_alloc, Stack, yysize);
[all...] |
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlTree.java | 31 import java.util.Stack;
105 private final Stack<Integer> begins = new Stack<Integer>();
106 private final Stack<Integer> ends = new Stack<Integer>();
268 int stack = 0; local
279 stack++;
285 if (stack == 0) {
288 stack--;
293 if (stack == 0 && sb.length() >= chunkSize)
979 private Stack<Integer> stack; typedefs
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
| Delphi.stg | 748 <ruleDescriptor.useScopes:{<it>Stack.Push(T<it>Scope.Create);}; separator="\n">
749 <ruleDescriptor.ruleScope:{<it.name>Stack.Push(T<it.name>Scope.Create);}; separator="\n">
753 <ruleDescriptor.useScopes:{<it>Stack.Pop();}; separator="\n">
754 <ruleDescriptor.ruleScope:{<it.name>Stack.Pop;}; separator="\n">
[all...] |
| /external/clang/lib/AST/ |
| CXXInheritance.cpp | 574 SmallVector<OverriddenMethods, 4> Stack;
575 Stack.push_back(std::make_pair(CanonM->begin_overridden_methods(),
577 while (!Stack.empty()) {
578 OverriddenMethods OverMethods = Stack.back();
579 Stack.pop_back();
604 Stack.push_back(std::make_pair(CanonOM->begin_overridden_methods(),
|
| /external/e2fsprogs/intl/ |
| plural.c | 374 /* A type that is properly aligned for any stack member. */
384 /* The size of the maximum gap between one aligned stack and the next. */
417 /* Relocate STACK from its old location to the new one. The
419 elements in the stack, and YYPTR gives the new location of the
420 stack. Advance YYPTR to a properly aligned location for the next
421 stack. */
422 # define YYSTACK_RELOCATE(Stack) \
426 YYCOPY (&yyptr->Stack, Stack, yysize); \
427 Stack = &yyptr->Stack;
[all...] |
| /development/samples/XmlAdapters/src/com/example/android/xmladapters/ |
| XmlDocumentProvider.java | 46 import java.util.Stack;
381 Stack<Integer> pathLengthStack = new Stack<Integer>();
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| DOMBuilder.java | 23 import java.util.Stack;
66 protected Stack m_elemStack = new Stack();
|
| QName.java | 23 import java.util.Stack;
226 * using the given namespace stack. The default namespace is
230 * @param namespaces Namespace stack to use to resolve namespace
232 public QName(String qname, Stack namespaces)
239 * using the given namespace stack. The default namespace is
243 * @param namespaces Namespace stack to use to resolve namespace
247 public QName(String qname, Stack namespaces, boolean validate)
406 * using the given namespace stack. The default namespace is
419 * using the given namespace stack. The default namespace is
|
| /external/doclava/src/com/google/doclava/apicheck/ |
| XmlApiFile.java | 38 import java.util.Stack;
46 private Stack<ClassInfo> mClassScope = new Stack<ClassInfo>();
|
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| FilterGraph.java | 26 import java.util.Stack;
192 Stack<Filter> filterStack = new Stack<Filter>();
208 // Push connected filters onto stack
|
| /packages/apps/Gallery2/src/com/android/gallery3d/app/ |
| StateManager.java | 31 import java.util.Stack;
44 private Stack<StateEntry> mStack = new Stack<StateEntry>();
199 + " is not at the top of the stack: " + state + ", "
230 + " is not at the top of the stack: " + oldState + ", "
|
| /cts/tools/dasm/src/java_cup/runtime/ |
| lr_parser.java | 4 import java.util.Stack;
8 * parsers act by shifting input onto a parse stack until the symbols
10 * stack. Once this occurs, a reduce is performed. This involves removing
18 * on top of the parse stack (stored as part of a symbol object representing
23 * onto the stack. When the parser reduces, it pops the handle (right hand
24 * side of a production) off the stack. This leaves the parser in the state
29 * (also containing the new state) onto the stack.<p>
68 * pushed onto the stack for the reduce.
158 * is on top of the stack) and the given terminal is next on the input.
180 * the stack. The new top of stack indicates a state. This table is
242 protected Stack stack = new Stack(); field in class:lr_parser
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| misc.py | 31 class Stack:
33 self.stack = []
34 self.pop = self.stack.pop
36 return len(self.stack)
38 self.stack.append(elt)
40 return self.stack[-1]
42 return self.stack[index]
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| misc.py | 31 class Stack:
33 self.stack = []
34 self.pop = self.stack.pop
36 return len(self.stack)
38 self.stack.append(elt)
40 return self.stack[-1]
42 return self.stack[index]
|
