| /external/icu/icu4c/source/common/ |
| D | ucharstrieiterator.cpp | 30 maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
40 stack_=new UVector32(errorCode); in Iterator()
41 if(stack_==NULL) { in Iterator()
52 maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
56 stack_=new UVector32(errorCode); in Iterator()
60 if(stack_==NULL) { in Iterator()
78 delete stack_; in ~Iterator()
93 stack_->setSize(0); in reset()
98 UCharsTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty(); } in hasNext()
107 if(stack_->isEmpty()) { in next()
[all …]
|
| D | bytestrieiterator.cpp | 30 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
41 stack_=new UVector32(errorCode); in Iterator()
42 if(U_SUCCESS(errorCode) && (str_==NULL || stack_==NULL)) { in Iterator()
52 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) { in Iterator()
57 stack_=new UVector32(errorCode); in Iterator()
61 if(str_==NULL || stack_==NULL) { in Iterator()
80 delete stack_; in ~Iterator()
94 stack_->setSize(0); in reset()
99 BytesTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty(); } in hasNext()
108 if(stack_->isEmpty()) { in next()
[all …]
|
| /external/regex-re2/re2/ |
| D | walker-inl.h | 89 stack<WalkState<T> >* stack_;
133 stack_ = new stack<WalkState<T> >; in Walker()
139 delete stack_; in ~Walker() local
146 if (stack_ && stack_->size() > 0) { in Reset()
148 while (stack_->size() > 0) { in Reset()
149 delete stack_->top().child_args; in Reset()
150 stack_->pop(); in Reset()
164 stack_->push(WalkState<T>(re, top_arg)); in WalkInternal()
169 s = &stack_->top(); in WalkInternal()
200 stack_->push(WalkState<T>(sub[s->n], s->pre_arg)); in WalkInternal()
[all …]
|
| /external/google-breakpad/src/processor/ |
| D | postfix_evaluator-inl.h | 61 explicit AutoStackClearer(vector<string> *stack) : stack_(stack) {} in AutoStackClearer()
62 ~AutoStackClearer() { stack_->clear(); } in ~AutoStackClearer()
65 vector<string> *stack_;
199 stack_.push_back(token); in EvaluateToken()
237 AutoStackClearer clearer(&stack_); in Evaluate()
245 if (stack_.empty()) in Evaluate()
256 AutoStackClearer clearer(&stack_); in EvaluateForValue()
262 if (stack_.size() != 1) { in EvaluateForValue()
276 if (!stack_.size()) in PopValueOrIdentifier()
279 string token = stack_.back(); in PopValueOrIdentifier()
[all …]
|
| D | postfix_evaluator.h | 99 : dictionary_(dictionary), memory_(memory), stack_() {} in PostfixEvaluator()
173 vector<string> stack_; variable
|
| /external/protobuf/src/google/protobuf/util/internal/ |
| D | json_stream_parser.cc | 99 stack_(), in JsonStreamParser()
112 stack_.push(VALUE); in JsonStreamParser()
150 if (stack_.empty() && leftover_.empty()) { in FinishParse()
197 if (stack_.empty()) { in ParseChunk()
208 while (!stack_.empty()) { in RunParser()
209 ParseType type = stack_.top(); in RunParser()
211 stack_.pop(); in RunParser()
246 stack_.push(type); in RunParser()
569 stack_.push(ENTRY); in HandleBeginObject()
587 stack_.push(ENTRY); in ParseObjectMid()
[all …]
|
| D | default_value_objectwriter.cc | 491 stack_.push(current_); in StartObject()
497 if (stack_.empty()) { in EndObject()
502 current_ = stack_.top(); in EndObject()
503 stack_.pop(); in EndObject()
528 stack_.push(current_); in StartList()
540 if (stack_.empty()) { in EndList()
544 current_ = stack_.top(); in EndList()
545 stack_.pop(); in EndList()
|
| /external/flatbuffers/include/flatbuffers/ |
| D | flexbuffers.h | 747 void Null() { stack_.push_back(Value()); } in Null()
750 void Int(int64_t i) { stack_.push_back(Value(i, TYPE_INT, WidthI(i))); } in Int()
753 void UInt(uint64_t u) { stack_.push_back(Value(u, TYPE_UINT, WidthU(u))); } in UInt()
756 void Float(float f) { stack_.push_back(Value(f)); } in Float()
759 void Double(double f) { stack_.push_back(Value(f)); } in Double()
811 stack_.push_back(Value(static_cast<uint64_t>(sloc), TYPE_KEY, BIT_WIDTH_8)); in Key()
829 stack_.back().u_ = sloc; in String()
870 size_t StartVector() { return stack_.size(); } in StartVector()
871 size_t StartVector(const char *key) { Key(key); return stack_.size(); } in StartVector()
872 size_t StartMap() { return stack_.size(); } in StartMap()
[all …]
|
| /external/v8/src/compiler/ |
| D | graph-reducer.cc | 35 stack_(zone) {} in GraphReducer()
47 DCHECK(stack_.empty()); in ReduceNode()
51 if (!stack_.empty()) { in ReduceNode()
72 DCHECK(stack_.empty()); in ReduceNode()
110 NodeState& entry = stack_.top(); in ReduceTop()
249 Node* node = stack_.top().node; in Pop()
251 stack_.pop(); in Pop()
258 stack_.push({node, 0}); in Push()
|
| D | state-values-utils.cc | 206 stack_[current_depth_].node = node; in iterator()
207 stack_[current_depth_].index = -1; in iterator()
215 return &(stack_[current_depth_]); in Top()
222 stack_[current_depth_].node = node; in Push()
223 stack_[current_depth_].index = 0; in Push()
|
| D | simd-scalar-lowering.cc | 27 stack_(zone), in SimdScalarLowering()
40 stack_.push_back({graph()->end(), 0}); in LowerGraph()
44 while (!stack_.empty()) { in LowerGraph()
45 NodeState& top = stack_.back(); in LowerGraph()
48 stack_.pop_back(); in LowerGraph()
60 stack_.push_front({input, 0}); in LowerGraph()
62 stack_.push_back({input, 0}); in LowerGraph()
|
| D | int64-lowering.cc | 30 stack_(zone), in Int64Lowering()
45 stack_.push_back({graph()->end(), 0}); in LowerGraph()
48 while (!stack_.empty()) { in LowerGraph()
49 NodeState& top = stack_.back(); in LowerGraph()
52 stack_.pop_back(); in LowerGraph()
63 stack_.push_front({input, 0}); in LowerGraph()
65 stack_.push_front({input, 0}); in LowerGraph()
67 stack_.push_back({input, 0}); in LowerGraph()
|
| D | scheduler.cc | 617 stack_(zone), in SpecialRPONumberer()
746 stack_.resize(schedule_->BasicBlockCount() - previous_block_count_); in ComputeAndInsertSpecialRPO()
748 int stack_depth = Push(stack_, 0, entry, kBlockUnvisited1); in ComputeAndInsertSpecialRPO()
753 SpecialRPOStackFrame* frame = &stack_[current]; in ComputeAndInsertSpecialRPO()
770 stack_depth = Push(stack_, stack_depth, succ, kBlockUnvisited1); in ComputeAndInsertSpecialRPO()
784 ComputeLoopInfo(stack_, num_loops, &backedges_); in ComputeAndInsertSpecialRPO()
795 stack_depth = Push(stack_, 0, entry, kBlockUnvisited2); in ComputeAndInsertSpecialRPO()
797 SpecialRPOStackFrame* frame = &stack_[stack_depth - 1]; in ComputeAndInsertSpecialRPO()
842 stack_depth = Push(stack_, stack_depth, succ, kBlockUnvisited2); in ComputeAndInsertSpecialRPO()
1085 ZoneVector<SpecialRPOStackFrame> stack_; member in v8::internal::compiler::SpecialRPONumberer
|
| /external/bison/examples/calc++/ |
| D | stack.hh | 112 : stack_ (stack) in slice()
121 return stack_[range_ - i]; in operator []()
125 const S& stack_; member in yy::slice
|
| /external/v8/src/wasm/ |
| D | wasm-interpreter.cc | 972 stack_(zone), in ThreadImpl()
991 frames_.push_back({code, 0, 0, stack_.size()}); in PushFrame()
993 stack_.push_back(args[i]); in PushFrame()
997 {0, stack_.size(), frames_.size(), in PushFrame()
1029 stack_.clear(); in Reset()
1051 CHECK_LT(static_cast<size_t>(index), stack_.size()); in GetReturnValue()
1052 return stack_[index]; in GetReturnValue()
1087 ZoneVector<WasmVal> stack_; member in v8::internal::wasm::ThreadImpl
1112 DCHECK_GE(stack_.size(), arity); in PushFrame()
1114 frames_.push_back({code, 0, 0, stack_.size() - arity}); in PushFrame()
[all …]
|
| D | ast-decoder.cc | 376 stack_(zone), in WasmFullDecoder()
388 stack_.clear(); in Decode()
419 stack_.resize(c->stack_depth); in Decode()
421 stack_.push_back(c->merge.vals.first); in Decode()
424 stack_.push_back(c->merge.vals.array[i]); in Decode()
501 ZoneVector<Value> stack_; // stack of values. member in v8::internal::wasm::WasmFullDecoder
569 if (stack_.size() < kMaxIndent / 2) { in indentation()
570 bytes[stack_.size() * 2] = 0; in indentation()
716 stack_.resize(c->stack_depth); in DecodeFunctionBody()
780 stack_.resize(c->stack_depth); in DecodeFunctionBody()
[all …]
|
| /external/libchrome/base/ |
| D | at_exit.cc | 61 g_top_manager->stack_.push(std::move(task)); in RegisterTask()
77 tasks.swap(g_top_manager->stack_); in ProcessCallbacksNow()
88 DCHECK(g_top_manager->stack_.empty()); in ProcessCallbacksNow()
|
| D | at_exit.h | 61 std::stack<base::Closure> stack_; variable
|
| /external/v8/src/crankshaft/x87/ |
| D | lithium-codegen-x87.h | 361 stack_[i] = other.stack_[i]; in X87Stack()
367 if (!stack_[i].is(other.stack_[i])) return false;
374 stack_[i] = other.stack_[i];
396 stack_[stack_depth_] = reg; in push()
407 X87Register stack_[X87Register::kMaxNumAllocatableRegisters]; variable
|
| /external/bison/data/ |
| D | stack.hh | 100 : stack_ (stack)
109 return stack_[range_ - i];
113 const S& stack_;
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| D | BytesTrie.java | 528 stack_.clear(); in reset()
536 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } in hasNext()
552 if(stack_.isEmpty()) { in next()
557 long top=stack_.remove(stack_.size()-1); in next()
632 … stack_.add(((long)skipDelta(bytes_, pos)<<32)|((length-(length>>1))<<16)|entry_.length); in branchNext()
644 stack_.add(((long)pos<<32)|((length-1)<<16)|entry_.length); in branchNext()
671 private ArrayList<Long> stack_=new ArrayList<Long>(); local
|
| D | CharsTrie.java | 453 stack_.clear(); in reset()
461 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } in hasNext()
477 if(stack_.isEmpty()) { in next()
482 long top=stack_.remove(stack_.size()-1); in next()
576 … stack_.add(((long)skipDelta(chars_, pos)<<32)|((length-(length>>1))<<16)|str_.length()); in branchNext()
588 stack_.add(((long)pos<<32)|((length-1)<<16)|str_.length()); in branchNext()
618 private ArrayList<Long> stack_=new ArrayList<Long>(); field in CharsTrie.Iterator
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| D | BytesTrie.java | 560 stack_.clear(); in reset()
569 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } in hasNext()
586 if(stack_.isEmpty()) { in next()
591 long top=stack_.remove(stack_.size()-1); in next()
667 … stack_.add(((long)skipDelta(bytes_, pos)<<32)|((length-(length>>1))<<16)|entry_.length); in branchNext()
679 stack_.add(((long)pos<<32)|((length-1)<<16)|entry_.length); in branchNext()
706 private ArrayList<Long> stack_=new ArrayList<Long>(); local
|
| D | CharsTrie.java | 476 stack_.clear(); in reset()
485 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } in hasNext()
502 if(stack_.isEmpty()) { in next()
507 long top=stack_.remove(stack_.size()-1); in next()
602 … stack_.add(((long)skipDelta(chars_, pos)<<32)|((length-(length>>1))<<16)|str_.length()); in branchNext()
614 stack_.add(((long)pos<<32)|((length-1)<<16)|str_.length()); in branchNext()
644 private ArrayList<Long> stack_=new ArrayList<Long>(); field in CharsTrie.Iterator
|
| /external/v8/src/ |
| D | json-stringifier.cc | 87 stack_ = factory()->NewJSArray(8); in JsonStringifier()
228 int length = Smi::cast(stack_->length())->value(); in CurrentHolder()
236 FixedArray* elements = FixedArray::cast(stack_->elements()); in CurrentHolder()
249 int length = Smi::cast(stack_->length())->value(); in StackPush()
252 FixedArray* elements = FixedArray::cast(stack_->elements()); in StackPush()
263 JSArray::SetLength(stack_, length + 1); in StackPush()
264 FixedArray::cast(stack_->elements())->set(length, *object); in StackPush()
269 int length = Smi::cast(stack_->length())->value(); in StackPop()
270 stack_->set_length(Smi::FromInt(length - 1)); in StackPop()
|