/external/clang/lib/Format/ |
D | ContinuationIndenter.cpp | 78 State.Stack.push_back(ParenState(FirstIndent, Line->Level, FirstIndent, in getInitialState() 97 !(State.Stack.back().BreakBeforeClosingBrace && in canBreak() 116 if (Current.isMemberAccess() && State.Stack.back().ContainsUnwrappedBuilder) in canBreak() 121 if (Previous.is(tok::l_brace) && State.Stack.size() > 1 && in canBreak() 122 State.Stack[State.Stack.size() - 2].NestedBlockInlined && in canBreak() 123 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks) in canBreak() 133 return !State.Stack.back().NoLineBreak; in canBreak() 141 if (State.Stack.back().BreakBeforeClosingBrace && in mustBreak() 152 State.Stack.back().BreakBeforeParameter && !Current.isTrailingComment() && in mustBreak() 164 State.Stack.back().BreakBeforeParameter) && in mustBreak() [all …]
|
/external/v8/test/mjsunit/es6/ |
D | classes-subclass-arrays.js | 8 class Stack extends Array { } class in TestDefaultConstructor 10 let s1 = new Stack(); 11 assertSame(Stack.prototype, s1.__proto__); 24 let s2 = new Stack(10); 25 assertSame(Stack.prototype, s2.__proto__); 33 let s3 = new Stack(a); 34 assertSame(Stack.prototype, s3.__proto__); 41 let s4 = new Stack(1, 2, 3); 42 assertSame(Stack.prototype, s4.__proto__); 51 let s5 = new Stack(undefined, undefined, undefined); [all …]
|
/external/easymock/src/org/easymock/internal/ |
D | LastControl.java | 21 import java.util.Stack; 31 …private static final ThreadLocal<Stack<Invocation>> threadToCurrentInvocation = new ThreadLocal<St… 33 …private static final ThreadLocal<Stack<IArgumentMatcher>> threadToArgumentMatcherStack = new Threa… 48 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in reportMatcher() 50 stack = new Stack<IArgumentMatcher>(); in reportMatcher() 57 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in pullMatchers() 66 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in reportAnd() 72 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in reportNot() 78 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in popLastArgumentMatchers() 98 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in reportOr() [all …]
|
/external/clang/lib/Sema/ |
D | SemaAttr.cpp | 48 stack_ty Stack; member in __anond6aaba570111::PragmaPackStack 60 Stack.push_back(PSE); in push() 75 if (Stack.empty()) { in pop() 87 Alignment = Stack.back().Alignment; in pop() 88 Stack.pop_back(); in pop() 95 for (unsigned i = Stack.size(); i != 0; ) { in pop() 97 if (Stack[i].Name == Name) { in pop() 99 Alignment = Stack[i].Alignment; in pop() 100 Stack.erase(Stack.begin() + i, Stack.end()); in pop() 120 PragmaPackStack *Stack = static_cast<PragmaPackStack*>(PackContext); in AddAlignmentAttributesForRecord() local [all …]
|
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
D | NamespaceMappings.java | 95 private Stack m_nodeStack = new Stack(); 119 Stack stack; in initNamespaces() 141 final Stack stack = getPrefixStack(prefix); in lookupNamespace() 152 final Stack stack = (Stack) m_namespaces.get(prefix); in getMappingFromPrefix() 210 Stack stack; in popNamespace() 233 Stack stack; in pushNamespace() 235 if ((stack = (Stack) m_namespaces.get(prefix)) == null) in pushNamespace() 237 m_namespaces.put(prefix, stack = new Stack()); in pushNamespace() 283 Stack prefixStack = getPrefixStack(prefix); in popNamespaces() 333 clone.m_nodeStack = (NamespaceMappings.Stack) m_nodeStack.clone(); in clone() [all …]
|
/external/llvm/lib/Target/WebAssembly/ |
D | WebAssemblyCFGStackify.cpp | 179 SmallVector<POStackEntry, 16> Stack; in SortBlocks() local 183 Stack.push_back(POStackEntry(EntryBlock, MF, MLI)); in SortBlocks() 186 POStackEntry &Entry = Stack.back(); in SortBlocks() 191 Stack.push_back(POStackEntry(Succ, MF, MLI)); in SortBlocks() 208 Stack.pop_back(); in SortBlocks() 209 if (Stack.empty()) in SortBlocks() 401 IsOnStack(const SmallVectorImpl<std::pair<MachineBasicBlock *, bool>> &Stack, in IsOnStack() argument 403 for (const auto &Pair : Stack) in IsOnStack() 432 SmallVector<std::pair<MachineBasicBlock *, bool>, 0> Stack; in runOnMachineFunction() local 434 while (!Stack.empty() && Stack.back().first == &MBB) in runOnMachineFunction() [all …]
|
/external/valgrind/coregrind/ |
D | m_stacks.c | 94 } Stack; typedef 96 static Stack *stacks; 104 static Stack *current_stack; 109 static void move_Stack_one_step_forward ( Stack* st ) in move_Stack_one_step_forward() 111 Stack *st0, *st1, *st2; in move_Stack_one_step_forward() 126 Stack* tmp; in move_Stack_one_step_forward() 149 static Stack* find_stack_by_addr(Addr sp) in find_stack_by_addr() 154 Stack *i = stacks; in find_stack_by_addr() 184 Stack *i; in VG_() 195 i = VG_(malloc)("stacks.rs.1", sizeof(Stack)); in VG_() [all …]
|
D | m_addrinfo.c | 149 VG_(initThreadInfo)(&ai->Addr.Stack.tinfo); in VG_() 150 ai->Addr.Stack.tinfo.tid = tid; in VG_() 151 ai->Addr.Stack.IP = 0; in VG_() 152 ai->Addr.Stack.frameNo = -1; in VG_() 153 ai->Addr.Stack.stackPos = StackPos_stacked; in VG_() 154 ai->Addr.Stack.spoffset = 0; // Unused. in VG_() 173 ai->Addr.Stack.frameNo = f; in VG_() 174 ai->Addr.Stack.IP = ips[f]; in VG_() 249 VG_(initThreadInfo)(&ai->Addr.Stack.tinfo); in VG_() 250 ai->Addr.Stack.tinfo.tid = tid; in VG_() [all …]
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
D | StackExtensions.cs | 45 public static T elementAt<T>( this Stack<T> stack, int index ) in elementAt() 51 public static T peek<T>( this Stack<T> stack ) in peek() 57 public static T pop<T>( this Stack<T> stack ) in pop() 63 public static void push<T>( this Stack<T> stack, T obj ) in push() 69 public static int size<T>( this Stack<T> stack ) in size() 75 public static void setSize<T>( this Stack<T> stack, int size ) in setSize()
|
/external/compiler-rt/lib/ubsan/ |
D | ubsan_diag.h | 23 SymbolizedStack *Stack; variable 26 if (Stack) in clear() 27 Stack->ClearAll(); in clear() 31 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr) 32 : Stack(Stack) {} in Stack() argument 35 if (Stack != S) in reset() 37 Stack = S; in reset() 39 const SymbolizedStack *get() const { return Stack; } in get() 73 Location(const SymbolizedStackHolder &Stack) : in Location() argument 74 Kind(LK_Symbolized), SymbolizedLoc(Stack.get()) {} in Location()
|
/external/llvm/include/llvm/Support/ |
D | FileSystem.h | 800 std::stack<directory_iterator, std::vector<directory_iterator> > Stack; member 815 State->Stack.push(directory_iterator(path, ec)); in recursive_directory_iterator() 816 if (State->Stack.top() == directory_iterator()) in recursive_directory_iterator() 827 if ((ec = State->Stack.top()->status(st))) return *this; in increment() 829 State->Stack.push(directory_iterator(*State->Stack.top(), ec)); in increment() 831 if (State->Stack.top() != end_itr) { in increment() 835 State->Stack.pop(); in increment() 839 while (!State->Stack.empty() in increment() 840 && State->Stack.top().increment(ec) == end_itr) { in increment() 841 State->Stack.pop(); in increment() [all …]
|
/external/llvm/lib/Bitcode/Writer/ |
D | ValueEnumerator.cpp | 137 UseListOrderStack &Stack) { in predictValueUseListOrderImpl() argument 198 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl() 199 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size"); in predictValueUseListOrderImpl() 201 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl() 205 OrderMap &OM, UseListOrderStack &Stack) { in predictValueUseListOrder() argument 215 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack); in predictValueUseListOrder() 222 predictValueUseListOrder(Op, F, OM, Stack); in predictValueUseListOrder() 233 UseListOrderStack Stack; in predictUseListOrder() local 243 predictValueUseListOrder(&BB, &F, OM, Stack); in predictUseListOrder() 245 predictValueUseListOrder(&A, &F, OM, Stack); in predictUseListOrder() [all …]
|
/external/proguard/src/proguard/evaluation/ |
D | TracedStack.java | 37 public class TracedStack extends Stack 40 private Stack producerStack; 41 private Stack actualProducerStack; 51 producerStack = new Stack(maxSize); in TracedStack() 52 actualProducerStack = new Stack(maxSize); in TracedStack() 63 producerStack = new Stack(tracedStack.producerStack); in TracedStack() 64 actualProducerStack = new Stack(tracedStack.actualProducerStack); in TracedStack()
|
D | Stack.java | 33 public class Stack class 47 public Stack(int maxSize) in Stack() method in Stack 56 public Stack(Stack stack) in Stack() method in Stack 98 public void copy(Stack other) in copy() 121 public boolean generalize(Stack other) in generalize() 507 Stack other = (Stack)object; in equals()
|
/external/apache-xml/src/main/java/org/apache/xalan/processor/ |
D | StylesheetHandler.java | 23 import java.util.Stack; 226 private boolean stackContains(Stack stack, String url) in stackContains() 1166 private Stack m_stylesheets = new Stack(); 1253 private Stack m_processors = new Stack(); 1307 private Stack m_elems = new Stack(); 1369 Stack m_baseIdentifiers = new Stack(); 1438 private Stack m_stylesheetLocatorStack = new Stack(); 1466 private Stack m_importStack = new Stack(); 1473 private Stack m_importSourceStack = new Stack(); 1545 Stack m_nsSupportStack = new Stack();
|
/external/clang/lib/StaticAnalyzer/Core/ |
D | CoreEngine.cpp | 45 SmallVector<WorkListUnit,20> Stack; member in __anonc6354d350111::DFS 48 return !Stack.empty(); in hasWork() 52 Stack.push_back(U); in enqueue() 56 assert (!Stack.empty()); in dequeue() 57 const WorkListUnit& U = Stack.back(); in dequeue() 58 Stack.pop_back(); // This technically "invalidates" U, but we are fine. in dequeue() 64 I = Stack.begin(), E = Stack.end(); I != E; ++I) { in visitItemsInWorkList() 111 SmallVector<WorkListUnit,20> Stack; member in __anonc6354d350211::BFSBlockDFSContents 114 return !Queue.empty() || !Stack.empty(); in hasWork() 121 Stack.push_back(U); in enqueue() [all …]
|
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/tests/unit/cloudformation/ |
D | test_stack.py | 141 ('member', boto.cloudformation.stack.Stack) 155 ('member', boto.cloudformation.stack.Stack) 223 rs = boto.resultset.ResultSet([('member', boto.cloudformation.stack.Stack)]) 231 rs = boto.resultset.ResultSet([('member', boto.cloudformation.stack.Stack)]) 239 rs = boto.resultset.ResultSet([('member', boto.cloudformation.stack.Stack)]) 247 rs = boto.resultset.ResultSet([('member', boto.cloudformation.stack.Stack)])
|
/external/llvm/test/CodeGen/ARM/ |
D | 2013-04-16-AAPCS-C5-vs-VFP.ll | 31 double %p8, ; --> Stack 33 %struct_t* byval %p10) ; --> Stack+8 56 double 23.8, ; --> Stack 57 i32 43, ; --> R0, not Stack+8 58 %struct_t* byval @static_val) ; --> Stack+8, not R1
|
/external/mesa3d/src/mesa/main/ |
D | matrix.c | 263 _math_matrix_copy( &stack->Stack[stack->Depth + 1], in _mesa_PushMatrix() 264 &stack->Stack[stack->Depth] ); in _mesa_PushMatrix() 266 stack->Top = &(stack->Stack[stack->Depth]); in _mesa_PushMatrix() 304 stack->Top = &(stack->Stack[stack->Depth]); in _mesa_PopMatrix() 674 stack->Stack = (GLmatrix *) CALLOC(maxDepth * sizeof(GLmatrix)); in init_matrix_stack() 676 _math_matrix_ctr(&stack->Stack[i]); in init_matrix_stack() 678 stack->Top = stack->Stack; in init_matrix_stack() 694 _math_matrix_dtr(&stack->Stack[i]); in free_matrix_stack() 696 FREE(stack->Stack); in free_matrix_stack() 697 stack->Stack = stack->Top = NULL; in free_matrix_stack()
|
/external/slf4j/log4j-over-slf4j/src/main/java/org/apache/log4j/ |
D | NDC.java | 21 import java.util.Stack; 42 public static Stack cloneStack() { in cloneStack() 47 public static void inherit(Stack stack) { in inherit()
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
D | Profiler.cs | 75 protected Stack<string> currentGrammarFileName = new Stack<string>(); 76 protected Stack<string> currentRuleName = new Stack<string>(); 77 protected Stack<int> currentLine = new Stack<int>(); 78 protected Stack<int> currentPos = new Stack<int>(); 86 protected Stack<DecisionEvent> decisionStack = new Stack<DecisionEvent>();
|
/external/clang/lib/Basic/ |
D | Module.cpp | 205 SmallVector<Module *, 2> Stack; in markUnavailable() local 206 Stack.push_back(this); in markUnavailable() 207 while (!Stack.empty()) { in markUnavailable() 208 Module *Current = Stack.back(); in markUnavailable() 209 Stack.pop_back(); in markUnavailable() 220 Stack.push_back(*Sub); in markUnavailable() 311 SmallVector<Module *, 16> Stack(Imports.begin(), Imports.end()); in buildVisibleModulesCache() local 312 while (!Stack.empty()) { in buildVisibleModulesCache() 313 Module *CurrModule = Stack.pop_back_val(); in buildVisibleModulesCache() 317 CurrModule->getExportedModules(Stack); in buildVisibleModulesCache()
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
D | Profiler.cs | 75 protected Stack<string> currentGrammarFileName = new Stack<string>(); 76 protected Stack<string> currentRuleName = new Stack<string>(); 77 protected Stack<int> currentLine = new Stack<int>(); 78 protected Stack<int> currentPos = new Stack<int>(); 86 protected Stack<DecisionEvent> decisionStack = new Stack<DecisionEvent>();
|
/external/apache-harmony/support/src/test/java/tests/util/ |
D | CallVerificationStack.java | 20 import java.util.Stack; 25 public class CallVerificationStack extends Stack<Object> { 45 private final Stack<StackTraceElement> callStack = new Stack<StackTraceElement>();
|
/external/testng/src/main/java/org/testng/mustache/ |
D | Model.java | 5 import java.util.Stack; 9 private Stack<SubModel> m_subModels = new Stack<>();
|