| /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/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/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| D | graphcycles.cc | 73 Vec<int32> stack_; // Emulates recursion stack when doing depth first search member
201 r->stack_.clear(); in ForwardDFS()
202 r->stack_.push_back(n); in ForwardDFS()
203 while (!r->stack_.empty()) { in ForwardDFS()
204 n = r->stack_.back(); in ForwardDFS()
205 r->stack_.pop_back(); in ForwardDFS()
218 r->stack_.push_back(w); in ForwardDFS()
227 r->stack_.clear(); in BackwardDFS()
228 r->stack_.push_back(n); in BackwardDFS()
229 while (!r->stack_.empty()) { in BackwardDFS()
[all …]
|
| /external/pdfium/core/fpdfapi/parser/ |
| D | cpdf_object_walker.cpp | 132 while (!stack_.empty() || next_object_) { in GetNext()
137 stack_.push(std::move(new_iterator)); in GetNext()
144 SubobjectIterator* it = stack_.top().get(); in GetNext()
146 stack_.pop(); in GetNext()
153 current_depth_ = stack_.size(); in GetNext()
162 if (stack_.empty() || stack_.top()->IsStarted()) in SkipWalkIntoCurrentObject()
164 stack_.pop(); in SkipWalkIntoCurrentObject()
|
| /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 | 869 stack_.clear(); in Clear()
881 void Null() { stack_.push_back(Value()); } in Null()
887 void Int(int64_t i) { stack_.push_back(Value(i, FBT_INT, WidthI(i))); } in Int()
893 void UInt(uint64_t u) { stack_.push_back(Value(u, FBT_UINT, WidthU(u))); } in UInt()
899 void Float(float f) { stack_.push_back(Value(f)); } in Float()
905 void Double(double f) { stack_.push_back(Value(f)); } in Double()
911 void Bool(bool b) { stack_.push_back(Value(b)); } in Bool()
961 stack_.push_back(Value(static_cast<uint64_t>(sloc), FBT_KEY, BIT_WIDTH_8)); in Key()
979 stack_.back().u_ = sloc; in String()
1018 size_t StartVector() { return stack_.size(); } in StartVector()
[all …]
|
| /external/boringssl/src/include/openssl/ |
| D | stack.h | 282 typedef void (*stack_##name##_free_func)(ptrtype); \
283 typedef ptrtype (*stack_##name##_copy_func)(ptrtype); \
284 typedef int (*stack_##name##_cmp_func)(constptrtype *a, constptrtype *b); \
288 ((stack_##name##_free_func)free_func)((ptrtype)ptr); \
293 return (void *)((stack_##name##_copy_func)copy_func)((ptrtype)ptr); \
300 return ((stack_##name##_cmp_func)cmp_func)(&a_ptr, &b_ptr); \
304 sk_##name##_new(stack_##name##_cmp_func comp) { \
335 STACK_OF(name) * sk, stack_##name##_free_func free_func) { \
385 OPENSSL_INLINE stack_##name##_cmp_func sk_##name##_set_cmp_func( \
386 STACK_OF(name) *sk, stack_##name##_cmp_func comp) { \
[all …]
|
| /external/v8/src/compiler/ |
| D | graph-reducer.cc | 34 stack_(zone) { in GraphReducer()
49 DCHECK(stack_.empty()); in ReduceNode()
53 if (!stack_.empty()) { in ReduceNode()
74 DCHECK(stack_.empty()); in ReduceNode()
121 NodeState& entry = stack_.top(); in ReduceTop()
263 Node* node = stack_.top().node; in Pop()
265 stack_.pop(); in Pop()
272 stack_.push({node, 0}); in Push()
|
| D | escape-analysis.cc | 284 stack_(zone), in EffectGraphReducer()
291 DCHECK(stack_.empty()); in ReduceFrom()
292 stack_.push({node, 0}); in ReduceFrom()
293 while (!stack_.empty()) { in ReduceFrom()
294 Node* current = stack_.top().node; in ReduceFrom()
295 int& input_index = stack_.top().input_index; in ReduceFrom()
310 stack_.push({input, 0}); in ReduceFrom()
315 stack_.pop(); in ReduceFrom()
335 stack_.push({revisit, 0}); in ReduceFrom()
|
| D | escape-analysis.h | 57 bool Complete() { return stack_.empty() && revisit_.empty(); } in Complete()
70 ZoneStack<NodeState> stack_; variable
|
| D | state-values-utils.cc | 308 stack_[current_depth_] = in iterator()
316 return &(stack_[current_depth_]); in Top()
322 stack_[current_depth_] = in Push()
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | stack.cc | 60 if (max_size_ >= 0 && stack_.size() >= max_size_) { in Push()
64 stack_.push_back(value); in Push()
71 if (stack_.empty()) { in Pop()
75 *value = stack_.back(); in Pop()
76 stack_.pop_back(); in Pop()
84 if (stack_.empty()) { in IsUsefulToSwap()
87 const Tensor& first = stack_.front().tensor; in IsUsefulToSwap()
93 stack_.clear(); in Close()
116 std::vector<TensorAndAllocation> stack_ GUARDED_BY(mu_);
|
| /external/libchrome/base/ |
| D | at_exit.cc | 64 g_top_manager->stack_.push(std::move(task)); in RegisterTask()
80 tasks.swap(g_top_manager->stack_); in ProcessCallbacksNow()
95 DCHECK(g_top_manager->stack_.empty()); in ProcessCallbacksNow()
|
| /external/v8/src/wasm/ |
| D | function-body-decoder-impl.h | 1238 stack_(zone), in WasmFullDecoder()
1248 DCHECK(stack_.empty()); in Decode()
1335 DCHECK_GE(kMaxUInt32, stack_.size()); in stack_size()
1336 return static_cast<uint32_t>(stack_.size()); in stack_size()
1340 DCHECK_GT(stack_.size(), depth); in stack_value()
1341 return &stack_[stack_.size() - depth - 1]; in stack_value()
1348 DCHECK_GE(stack_.size(), c->stack_depth + merge->arity); in GetMergeValueFromStack()
1349 return stack_[stack_.size() - merge->arity + i]; in GetMergeValueFromStack()
1360 ZoneVector<Value> stack_; // stack of values. variable
1515 stack_.resize(c->stack_depth); in DecodeFunctionBody()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| D | BytesTrie.java | 532 stack_.clear(); in reset()
540 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } in hasNext()
556 if(stack_.isEmpty()) { in next()
561 long top=stack_.remove(stack_.size()-1); in next()
636 … stack_.add(((long)skipDelta(bytes_, pos)<<32)|((length-(length>>1))<<16)|entry_.length); in branchNext()
648 stack_.add(((long)pos<<32)|((length-1)<<16)|entry_.length); in branchNext()
675 private ArrayList<Long> stack_=new ArrayList<Long>(); local
|
| D | CharsTrie.java | 456 stack_.clear(); in reset()
464 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } in hasNext()
480 if(stack_.isEmpty()) { in next()
485 long top=stack_.remove(stack_.size()-1); in next()
579 … stack_.add(((long)skipDelta(chars_, pos)<<32)|((length-(length>>1))<<16)|str_.length()); in branchNext()
591 stack_.add(((long)pos<<32)|((length-1)<<16)|str_.length()); in branchNext()
621 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/tensorflow/tensorflow/core/platform/default/ |
| D | stacktrace.h | 91 void* const* stack() const { return stack_; } in stack()
94 void* stack_[32];
|
| /external/v8/src/ |
| D | json-stringifier.cc | 114 Handle<JSArray> stack_; member in v8::internal::BASE_EMBEDDED
201 stack_ = factory()->NewJSArray(8); in JsonStringifier()
346 int length = Smi::ToInt(stack_->length()); in CurrentHolder()
354 FixedArray* elements = FixedArray::cast(stack_->elements()); in CurrentHolder()
367 int length = Smi::ToInt(stack_->length()); in StackPush()
370 FixedArray* elements = FixedArray::cast(stack_->elements()); in StackPush()
381 JSArray::SetLength(stack_, length + 1); in StackPush()
382 FixedArray::cast(stack_->elements())->set(length, *object); in StackPush()
387 int length = Smi::ToInt(stack_->length()); in StackPop()
388 stack_->set_length(Smi::FromInt(length - 1)); in StackPop()
|
| /external/libchrome/base/debug/ |
| D | activity_tracker.cc | 688 stack_(reinterpret_cast<Activity*>(reinterpret_cast<char*>(base) + in ThreadActivityTracker()
732 DCHECK_EQ(0, stack_[0].time_internal); in ThreadActivityTracker()
733 DCHECK_EQ(0U, stack_[0].origin_address); in ThreadActivityTracker()
734 DCHECK_EQ(0U, stack_[0].call_stack[0]); in ThreadActivityTracker()
735 DCHECK_EQ(0U, stack_[0].data.task.sequence_id); in ThreadActivityTracker()
790 Activity::FillFrom(&stack_[depth], program_counter, origin, type, data); in PushActivity()
811 Activity* activity = &stack_[id]; in ChangeActivity()
839 DCHECK(stack_[depth].activity_type == Activity::ACT_LOCK_ACQUIRE || in PopActivity()
854 if (stack_[id].activity_type == Activity::ACT_LOCK_ACQUIRE) { in GetUserData()
864 return CreateUserDataForActivity(&stack_[id], allocator); in GetUserData()
[all …]
|
| /external/v8/src/snapshot/ |
| D | serializer.h | 233 void PushStack(HeapObject* o) { stack_.push_back(o); } in PushStack()
234 void PopStack() { stack_.pop_back(); } in PopStack()
262 std::vector<HeapObject*> stack_; variable
|