HomeSort by relevance Sort by last modified time
    Searched refs:stack_ (Results 1 - 25 of 35) sorted by null

1 2

  /external/bison/examples/calc++/
stack.hh 112 : stack_ (stack)
121 return stack_[range_ - i];
125 const S& stack_; member in class:yy::slice
  /external/icu/icu4c/source/common/
bytestrieiterator.cpp 28 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
32 // str_ and stack_ are pointers so that it's easy to turn bytestrie.h into
39 stack_=new UVector32(errorCode);
40 if(U_SUCCESS(errorCode) && (str_==NULL || stack_==NULL)) {
50 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
55 stack_=new UVector32(errorCode);
59 if(str_==NULL || stack_==NULL) {
78 delete stack_;
92 stack_->setSize(0);
97 BytesTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty();
    [all...]
ucharstrieiterator.cpp 28 maxLength_(maxStringLength), value_(0), stack_(NULL) {
32 // stack_ is a pointer so that it's easy to turn ucharstrie.h into
38 stack_=new UVector32(errorCode);
39 if(stack_==NULL) {
50 maxLength_(maxStringLength), value_(0), stack_(NULL) {
54 stack_=new UVector32(errorCode);
58 if(stack_==NULL) {
76 delete stack_;
91 stack_->setSize(0);
96 UCharsTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty();
    [all...]
  /external/regex-re2/re2/
walker-inl.h 89 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_->top()
    [all...]
  /external/google-breakpad/src/processor/
postfix_evaluator-inl.h 61 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_.back()
    [all...]
postfix_evaluator.h 99 : dictionary_(dictionary), memory_(memory), stack_() {}
173 vector<string> stack_; member in class:google_breakpad::PostfixEvaluator
  /art/runtime/
thread_pool.h 56 DCHECK(stack_.get() != nullptr);
57 return stack_->Size();
69 std::unique_ptr<MemMap> stack_; member in class:art::ThreadPoolWorker
thread_pool.cc 34 stack_.reset(MemMap::MapAnonymous(name.c_str(), nullptr, stack_size, PROT_READ | PROT_WRITE,
36 CHECK(stack_.get() != nullptr) << error_msg;
40 CHECK_PTHREAD_CALL(pthread_attr_setstack, (&attr, stack_->Begin(), stack_->Size()), reason);
profiler.cc 64 stack_(stack),
74 stack_->push_back(std::make_pair(m, dex_pc_));
84 std::vector<std::pair<ArtMethod*, uint32_t>>* stack_; member in class:art::BoundedStackVisitor
  /external/bison/data/
stack.hh 100 : stack_ (stack)
109 return stack_[range_ - i];
113 const S& stack_;
  /external/openfst/src/include/fst/extensions/pdt/
expand.h 90 stack_(opts.stack ? opts.stack: new PdtStack<StateId, Label>(parens)),
107 stack_(new PdtStack<StateId, Label>(*impl.stack_)),
120 delete stack_;
181 StackId stack_id = stack_->Find(tuple.stack_id, arc.ilabel);
197 const PdtStack<StackId, Label> &GetStack() const { return *stack_; }
206 PdtStack<StackId, Label> *stack_; member in class:fst::ExpandFstImpl
356 stack_(parens),
358 ExpandFstOptions<Arc>(opts, true, &stack_, &state_table_)),
359 queue_(state_table_, stack_, stack_length_, distance_, fdistance_)
424 const Stack &stack_; member in class:fst::PrunedExpand::StackCompare
468 Stack stack_; \/\/ Stack trie member in class:fst::PrunedExpand
    [all...]
compose.h 303 stack_(parens_),
325 stack_(filter.parens_),
338 ssize_t paren_id = stack_.Top(f.GetState2().GetState());
398 StackId stack_id = stack_.Find(f2.GetState(), label);
411 mutable ParenStack stack_; member in class:fst::ParenFilter
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
BytesTrie.java 557 stack_.clear();
565 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); }
581 if(stack_.isEmpty()) {
586 long top=stack_.remove(stack_.size()-1);
661 stack_.add(((long)skipDelta(bytes_, pos)<<32)|((length-(length>>1))<<16)|entry_.length);
673 stack_.add(((long)pos<<32)|((length-1)<<16)|entry_.length);
700 private ArrayList<Long> stack_=new ArrayList<Long>(); local
    [all...]
CharsTrie.java 473 stack_.clear();
481 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); }
497 if(stack_.isEmpty()) {
502 long top=stack_.remove(stack_.size()-1);
596 stack_.add(((long)skipDelta(chars_, pos)<<32)|((length-(length>>1))<<16)|str_.length());
608 stack_.add(((long)pos<<32)|((length-1)<<16)|str_.length());
638 private ArrayList<Long> stack_=new ArrayList<Long>(); field in class:CharsTrie.Iterator
    [all...]
  /external/v8/src/x87/
lithium-codegen-x87.h 387 stack_[i] = other.stack_[i];
393 if (!stack_[i].is(other.stack_[i])) return false;
400 stack_[i] = other.stack_[i];
421 stack_[stack_depth_] = reg;
432 X87Register stack_[X87Register::kMaxNumAllocatableRegisters]; member in class:v8::internal::LCodeGen::X87Stack
lithium-codegen-x87.cc 526 layout |= (stack_[stack_depth_ - 1 - i].code() << ((i + 1) * 3));
540 X87Register other = stack_[other_i];
541 stack_[other_i] = reg;
542 stack_[i] = other;
563 if (stack_[i].is(reg)) return i;
572 if (stack_[i].is(reg)) return true;
586 stack_[i] = stack_[tos_i];
663 stack_[stack_depth_] = reg;
670 DCHECK(!Contains(reg) && stack_[stack_depth_].is(reg) &
    [all...]
  /external/v8/src/
json-stringifier.h 159 Handle<JSArray> stack_; member in class:v8::internal::BASE_EMBEDDED
250 stack_ = factory_->NewJSArray(8);
367 int length = Smi::cast(stack_->length())->value();
370 FixedArray* elements = FixedArray::cast(stack_->elements());
382 JSArray::EnsureSize(stack_, length + 1);
383 FixedArray::cast(stack_->elements())->set(length, *object);
384 stack_->set_length(Smi::FromInt(length + 1));
390 int length = Smi::cast(stack_->length())->value();
391 stack_->set_length(Smi::FromInt(length - 1));
  /external/v8/test/mjsunit/tools/
profile.js 62 this.stack_ = [];
90 this.stack_.unshift(this.funcAddrs_[funcName]);
91 this.profile.recordTick(this.stack_);
96 this.profile.recordTick(this.stack_);
101 this.stack_.shift();
  /external/icu/icu4c/source/common/unicode/
bytestrie.h 339 UVector32 *stack_; member in class:BytesTrie::Iterator
ucharstrie.h 357 UVector32 *stack_; member in class:UCharsTrie::Iterator
  /external/v8/src/mips/
simulator-mips.h 354 char* stack_; member in class:v8::internal::Simulator
simulator-mips.cc     [all...]
  /external/v8/src/arm/
simulator-arm.h 387 char* stack_;
  /external/v8/src/mips64/
simulator-mips64.h 404 char* stack_; member in class:v8::internal::Simulator
  /external/v8/src/arm64/
simulator-arm64.cc 381 stack_ = reinterpret_cast<uintptr_t>(new byte[stack_size_]);
382 stack_limit_ = stack_ + stack_protection_size_;
383 uintptr_t tos = stack_ + stack_size_ - stack_protection_size_;
421 delete[] reinterpret_cast<byte*>(stack_);
    [all...]

Completed in 926 milliseconds

1 2