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

1 2

  /external/chromium_org/cc/test/
test_occlusion_tracker.h 22 return OcclusionTracker<LayerType>::stack_.back()
26 return OcclusionTracker<LayerType>::stack_.back()
32 size_t stack_size = OcclusionTracker<LayerType>::stack_.size();
35 return OcclusionTracker<LayerType>::stack_[stack_size - 2]
40 size_t stack_size = OcclusionTracker<LayerType>::stack_.size();
43 return OcclusionTracker<LayerType>::stack_[stack_size - 2]
48 OcclusionTracker<LayerType>::stack_.back().occlusion_from_outside_target =
52 OcclusionTracker<LayerType>::stack_.back().occlusion_from_inside_target =
58 size_t stack_size = OcclusionTracker<LayerType>::stack_.size();
60 OcclusionTracker<LayerType>::stack_[stack_size - 2
    [all...]
mock_occlusion_tracker.h 22 OcclusionTracker<LayerType>::stack_.push_back(stack_obj);
23 OcclusionTracker<LayerType>::stack_.push_back(stack_obj);
29 OcclusionTracker<LayerType>::stack_.push_back(stack_obj);
30 OcclusionTracker<LayerType>::stack_.push_back(stack_obj);
34 OcclusionTracker<LayerType>::stack_.back().occlusion_from_inside_target =
41 LayerType>::stack_[OcclusionTracker<LayerType>::stack_.size() - 2]
  /external/chromium_org/base/debug/
trace_event_argument.cc 14 stack_.push_back(root_.get());
18 DCHECK_EQ(1u, stack_.size());
44 stack_.push_back(dictionary);
50 stack_.push_back(array);
54 DCHECK_GT(stack_.size(), 1u);
56 stack_.pop_back();
78 stack_.push_back(array);
84 stack_.push_back(dictionary);
88 DCHECK_GT(stack_.size(), 1u);
90 stack_.pop_back()
    [all...]
trace_event_argument.h 52 std::vector<Value*> stack_; member in class:base::debug::TracedValue
  /external/bison/examples/calc++/
stack.hh 112 : stack_ (stack)
121 return stack_[range_ - i];
125 const S& stack_; member in class:yy::slice
  /external/chromium_org/third_party/icu/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/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/chromium_org/cc/trees/
occlusion_tracker.cc 33 DCHECK(!stack_.empty());
34 const StackObject& back = stack_.back();
155 if (!stack_.empty() && stack_.back().target == new_target)
161 if (!stack_.empty()) {
162 old_target = stack_.back().target;
169 stack_.push_back(StackObject(new_target));
194 stack_.size() > 1 &&
201 int last_index = stack_.size() - 1;
205 stack_[last_index].occlusion_from_outside_target
    [all...]
occlusion_tracker.h 99 std::vector<StackObject> stack_; member in class:cc::OcclusionTracker
  /external/chromium_org/base/
at_exit.cc 58 g_top_manager->stack_.push(task);
70 while (!g_top_manager->stack_.empty()) {
71 base::Closure task = g_top_manager->stack_.top();
73 g_top_manager->stack_.pop();
at_exit.h 61 std::stack<base::Closure> stack_; member in class:base::AtExitManager
  /external/chromium_org/third_party/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/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...]
  /art/runtime/
thread_pool.h 43 DCHECK(stack_.get() != nullptr);
44 return stack_->Size();
56 std::unique_ptr<MemMap> stack_; member in class:art::ThreadPoolWorker
thread_pool.cc 33 stack_.reset(MemMap::MapAnonymous(name.c_str(), nullptr, stack_size, PROT_READ | PROT_WRITE,
35 CHECK(stack_.get() != nullptr) << error_msg;
39 CHECK_PTHREAD_CALL(pthread_attr_setstack, (&attr, stack_->Begin(), stack_->Size()), reason);
  /external/bison/data/
stack.hh 100 : stack_ (stack)
109 return stack_[range_ - i];
113 const S& stack_;
  /external/chromium_org/content/browser/indexed_db/
indexed_db_transaction.h 144 bool empty() const { return stack_.empty(); }
145 void push(Operation task) { stack_.push(task); }
150 std::stack<Operation> stack_; member in class:content::IndexedDBTransaction::TaskStack
indexed_db_transaction.cc 42 while (!stack_.empty())
43 stack_.pop();
47 DCHECK(!stack_.empty());
48 Operation task(stack_.top());
49 stack_.pop();
  /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/chromium_org/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
  /external/chromium_org/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/chromium_org/chrome/browser/profile_resetter/
jtl_interpreter.cc 47 stack_.push_back(input);
53 if (error_ || stack_.empty()) {
88 const base::Value* current_node() const { return stack_.back(); }
89 std::vector<const base::Value*>* stack() { return &stack_; }
103 std::vector<const base::Value*> stack_; member in class:__anon9128::ExecutionContext

Completed in 640 milliseconds

1 2