Searched refs:stack_ (Results 1 - 25 of 52) sorted by relevance

123

/external/bison/examples/calc++/
H A Dstack.hh112 : stack_ (stack)
121 return stack_[range_ - i];
125 const S& stack_; member in class:yy::slice
/external/icu/icu4c/source/common/
H A Dbytestrieiterator.cpp30 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
34 // str_ and stack_ are pointers so that it's easy to turn bytestrie.h into
41 stack_=new UVector32(errorCode);
42 if(U_SUCCESS(errorCode) && (str_==NULL || stack_==NULL)) {
52 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
57 stack_=new UVector32(errorCode);
61 if(str_==NULL || stack_==NULL) {
80 delete stack_;
94 stack_->setSize(0);
99 BytesTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_
[all...]
H A Ducharstrieiterator.cpp30 maxLength_(maxStringLength), value_(0), stack_(NULL) {
34 // stack_ is a pointer so that it's easy to turn ucharstrie.h into
40 stack_=new UVector32(errorCode);
41 if(stack_==NULL) {
52 maxLength_(maxStringLength), value_(0), stack_(NULL) {
56 stack_=new UVector32(errorCode);
60 if(stack_==NULL) {
78 delete stack_;
93 stack_->setSize(0);
98 UCharsTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_
[all...]
/external/regex-re2/re2/
H A Dwalker-inl.h89 stack<WalkState<T> >* stack_; member in class:re2::Regexp::Walker
133 stack_ = new stack<WalkState<T> >;
139 delete stack_;
146 if (stack_ && stack_->size() > 0) {
148 while (stack_->size() > 0) {
149 delete stack_->top().child_args;
150 stack_->pop();
164 stack_->push(WalkState<T>(re, top_arg));
169 s = &stack_
[all...]
/external/google-breakpad/src/processor/
H A Dpostfix_evaluator-inl.h61 explicit AutoStackClearer(vector<string> *stack) : stack_(stack) {}
62 ~AutoStackClearer() { stack_->clear(); }
65 vector<string> *stack_; member in class:google_breakpad::AutoStackClearer
199 stack_.push_back(token);
237 AutoStackClearer clearer(&stack_);
245 if (stack_.empty())
256 AutoStackClearer clearer(&stack_);
262 if (stack_.size() != 1) {
276 if (!stack_.size())
279 string token = stack_
[all...]
H A Dpostfix_evaluator.h99 : dictionary_(dictionary), memory_(memory), stack_() {}
173 vector<string> stack_; member in class:google_breakpad::PostfixEvaluator
/external/libchrome/base/
H A Dat_exit.cc61 g_top_manager->stack_.push(std::move(task));
77 tasks.swap(g_top_manager->stack_);
88 DCHECK(g_top_manager->stack_.empty());
H A Dat_exit.h61 std::stack<base::Closure> stack_; member in class:base::AtExitManager
/external/v8/src/compiler/
H A Dgraph-reducer.cc35 stack_(zone) {}
47 DCHECK(stack_.empty());
51 if (!stack_.empty()) {
72 DCHECK(stack_.empty());
110 NodeState& entry = stack_.top();
249 Node* node = stack_.top().node;
251 stack_.pop();
258 stack_.push({node, 0});
H A Dsimd-scalar-lowering.h67 ZoneDeque<NodeState> stack_; member in class:v8::internal::compiler::SimdScalarLowering
H A Dsimd-scalar-lowering.cc27 stack_(zone),
40 stack_.push_back({graph()->end(), 0});
44 while (!stack_.empty()) {
45 NodeState& top = stack_.back();
48 stack_.pop_back();
60 stack_.push_front({input, 0});
62 stack_.push_back({input, 0});
H A Dstate-values-utils.cc206 stack_[current_depth_].node = node;
207 stack_[current_depth_].index = -1;
215 return &(stack_[current_depth_]);
222 stack_[current_depth_].node = node;
223 stack_[current_depth_].index = 0;
H A Dint64-lowering.h73 ZoneDeque<NodeState> stack_; member in class:v8::internal::compiler::Int64Lowering
/external/protobuf/src/google/protobuf/util/internal/
H A Djson_stream_parser.cc99 stack_(),
112 stack_.push(VALUE);
150 if (stack_.empty() && leftover_.empty()) {
197 if (stack_.empty()) {
208 while (!stack_.empty()) {
209 ParseType type = stack_.top();
211 stack_.pop();
246 stack_.push(type);
569 stack_.push(ENTRY);
587 stack_
[all...]
H A Ddefault_value_objectwriter.cc491 stack_.push(current_);
497 if (stack_.empty()) {
502 current_ = stack_.top();
503 stack_.pop();
528 stack_.push(current_);
540 if (stack_.empty()) {
544 current_ = stack_.top();
545 stack_.pop();
H A Djson_stream_parser.h126 // Runs the parser based on stack_ and p_, until the stack is empty or p_ runs
208 std::stack<ParseType> stack_; member in class:google::protobuf::util::converter::JsonStreamParser
/external/bison/data/
H A Dstack.hh100 : stack_ (stack)
109 return stack_[range_ - i];
113 const S& stack_;
/external/flatbuffers/include/flatbuffers/
H A Dflexbuffers.h747 void Null() { stack_.push_back(Value()); }
750 void Int(int64_t i) { stack_.push_back(Value(i, TYPE_INT, WidthI(i))); }
753 void UInt(uint64_t u) { stack_.push_back(Value(u, TYPE_UINT, WidthU(u))); }
756 void Float(float f) { stack_.push_back(Value(f)); }
759 void Double(double f) { stack_.push_back(Value(f)); }
811 stack_.push_back(Value(static_cast<uint64_t>(sloc), TYPE_KEY, BIT_WIDTH_8));
829 stack_.back().u_ = sloc;
870 size_t StartVector() { return stack_.size(); }
871 size_t StartVector(const char *key) { Key(key); return stack_.size(); }
872 size_t StartMap() { return stack_
[all...]
/external/v8/src/wasm/
H A Dwasm-interpreter.cc972 stack_(zone),
991 frames_.push_back({code, 0, 0, stack_.size()});
993 stack_.push_back(args[i]);
997 {0, stack_.size(), frames_.size(),
1029 stack_.clear();
1051 CHECK_LT(static_cast<size_t>(index), stack_.size());
1052 return stack_[index];
1087 ZoneVector<WasmVal> stack_; member in class:v8::internal::wasm::ThreadImpl
1112 DCHECK_GE(stack_.size(), arity);
1114 frames_.push_back({code, 0, 0, stack_
[all...]
H A Dast-decoder.cc376 stack_(zone),
388 stack_.clear();
419 stack_.resize(c->stack_depth);
421 stack_.push_back(c->merge.vals.first);
424 stack_.push_back(c->merge.vals.array[i]);
501 ZoneVector<Value> stack_; // stack of values. member in class:v8::internal::wasm::WasmFullDecoder
569 if (stack_.size() < kMaxIndent / 2) {
570 bytes[stack_.size() * 2] = 0;
716 stack_.resize(c->stack_depth);
780 stack_
[all...]
/external/icu/android_icu4j/src/main/java/android/icu/util/
H A DBytesTrie.java528 stack_.clear();
536 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); }
552 if(stack_.isEmpty()) {
557 long top=stack_.remove(stack_.size()-1);
632 stack_.add(((long)skipDelta(bytes_, pos)<<32)|((length-(length>>1))<<16)|entry_.length);
644 stack_.add(((long)pos<<32)|((length-1)<<16)|entry_.length);
671 private ArrayList<Long> stack_=new ArrayList<Long>(); field in class:BytesTrie.Iterator
H A DCharsTrie.java453 stack_.clear();
461 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); }
477 if(stack_.isEmpty()) {
482 long top=stack_.remove(stack_.size()-1);
576 stack_.add(((long)skipDelta(chars_, pos)<<32)|((length-(length>>1))<<16)|str_.length());
588 stack_.add(((long)pos<<32)|((length-1)<<16)|str_.length());
618 private ArrayList<Long> stack_=new ArrayList<Long>(); field in class:CharsTrie.Iterator
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DBytesTrie.java560 stack_.clear();
569 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); }
586 if(stack_.isEmpty()) {
591 long top=stack_.remove(stack_.size()-1);
667 stack_.add(((long)skipDelta(bytes_, pos)<<32)|((length-(length>>1))<<16)|entry_.length);
679 stack_.add(((long)pos<<32)|((length-1)<<16)|entry_.length);
706 private ArrayList<Long> stack_=new ArrayList<Long>(); field in class:BytesTrie.Iterator
H A DCharsTrie.java476 stack_.clear();
485 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); }
502 if(stack_.isEmpty()) {
507 long top=stack_.remove(stack_.size()-1);
602 stack_.add(((long)skipDelta(chars_, pos)<<32)|((length-(length>>1))<<16)|str_.length());
614 stack_.add(((long)pos<<32)|((length-1)<<16)|str_.length());
644 private ArrayList<Long> stack_=new ArrayList<Long>(); field in class:CharsTrie.Iterator
/external/v8/src/crankshaft/x87/
H A Dlithium-codegen-x87.h361 stack_[i] = other.stack_[i];
367 if (!stack_[i].is(other.stack_[i])) return false;
374 stack_[i] = other.stack_[i];
396 stack_[stack_depth_] = reg;
407 X87Register stack_[X87Register::kMaxNumAllocatableRegisters]; member in class:v8::internal::LCodeGen::X87Stack

Completed in 515 milliseconds

123