/system/core/libmemunreachable/ |
PtracerThread.h | 44 std::unique_ptr<Stack> stack_; member in class:PtracerThread
|
Tarjan.h | 66 stack_(allocator), components_(allocator) {} 74 allocator::vector<Node<T>*> stack_; member in class:TarjanAlgorithm 80 stack_.clear(); 102 stack_.push_back(vertex); 108 } else if (std::find(stack_.begin(), stack_.end(), vertex_next) != stack_.end()) { 116 other_vertex = stack_.back(); 117 stack_.pop_back(); 119 } while (other_vertex != vertex && !stack_.empty()) [all...] |
/system/update_engine/payload_generator/ |
tarjan.h | 46 std::vector<Vertex::Index> stack_; member in class:chromeos_update_engine::TarjanAlgorithm
|
cycle_breaker.h | 58 std::vector<Vertex::Index> stack_; // the stack variable in the paper member in class:chromeos_update_engine::CycleBreaker
|
/external/libchrome/base/ |
at_exit.h | 61 std::stack<base::Closure> stack_; member in class:base::AtExitManager
|
/external/bison/examples/calc++/ |
stack.hh | 112 : stack_ (stack) 121 return stack_[range_ - i]; 125 const S& stack_; member in class:yy::slice
|
/external/google-breakpad/src/processor/ |
postfix_evaluator.h | 99 : dictionary_(dictionary), memory_(memory), stack_() {} 173 vector<string> stack_; member in class:google_breakpad::PostfixEvaluator
|
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...] |
/packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/ |
memorybuffer.h | 40 GenericMemoryBuffer(Allocator* allocator = 0, size_t capacity = kDefaultCapacity) : stack_(allocator, capacity) {} 42 void Put(Ch c) { *stack_.template Push<Ch>() = c; } 45 void Clear() { stack_.Clear(); } 46 void ShrinkToFit() { stack_.ShrinkToFit(); } 47 Ch* Push(size_t count) { return stack_.template Push<Ch>(count); } 48 void Pop(size_t count) { stack_.template Pop<Ch>(count); } 51 return stack_.template Bottom<Ch>(); 54 size_t GetSize() const { return stack_.GetSize(); } 57 mutable internal::Stack<Allocator> stack_; member in struct:GenericMemoryBuffer 65 std::memset(memoryBuffer.stack_.Push<char>(n), c, n * sizeof(c)) [all...] |
stringbuffer.h | 39 GenericStringBuffer(Allocator* allocator = 0, size_t capacity = kDefaultCapacity) : stack_(allocator, capacity) {}
42 GenericStringBuffer(GenericStringBuffer&& rhs) : stack_(std::move(rhs.stack_)) {}
45 stack_ = std::move(rhs.stack_);
50 void Put(Ch c) { *stack_.template Push<Ch>() = c; }
53 void Clear() { stack_.Clear(); }
56 *stack_.template Push<Ch>() = '\0';
57 stack_.ShrinkToFit();
58 stack_.template Pop<Ch>(1); 74 mutable internal::Stack<Allocator> stack_; member in class:GenericStringBuffer [all...] |
/art/runtime/ |
thread_pool.h | 56 DCHECK(stack_.get() != nullptr); 57 return stack_->Size(); 72 std::unique_ptr<MemMap> stack_; member in class:art::ThreadPoolWorker
|
/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/icu/android_icu4j/src/main/java/android/icu/util/ |
BytesTrie.java | 525 stack_.clear(); 532 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } 547 if(stack_.isEmpty()) { 552 long top=stack_.remove(stack_.size()-1); 626 stack_.add(((long)skipDelta(bytes_, pos)<<32)|((length-(length>>1))<<16)|entry_.length); 638 stack_.add(((long)pos<<32)|((length-1)<<16)|entry_.length); 665 private ArrayList<Long> stack_=new ArrayList<Long>(); local [all...] |
CharsTrie.java | 450 stack_.clear(); 457 public boolean hasNext() /*const*/ { return pos_>=0 || !stack_.isEmpty(); } 472 if(stack_.isEmpty()) { 477 long top=stack_.remove(stack_.size()-1); 570 stack_.add(((long)skipDelta(chars_, pos)<<32)|((length-(length>>1))<<16)|str_.length()); 582 stack_.add(((long)pos<<32)|((length-1)<<16)|str_.length()); 612 private ArrayList<Long> stack_=new ArrayList<Long>(); field in class:CharsTrie.Iterator [all...] |
/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/compiler/ |
graph-reducer.h | 176 ZoneStack<NodeState> stack_; member in class:v8::internal::compiler::GraphReducer
|
state-values-utils.h | 102 StatePos stack_[kMaxInlineDepth]; member in class:v8::internal::compiler::StateValuesAccess::iterator
|
/packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/internal/ |
stack.h | 33 // Optimization note: Do not allocate memory for stack_ in constructor.
35 Stack(Allocator* allocator, size_t stackCapacity) : allocator_(allocator), ownAllocator_(0), stack_(0), stackTop_(0), stackEnd_(0), initialCapacity_(stackCapacity) {
43 stack_(rhs.stack_),
50 rhs.stack_ = 0;
69 stack_ = rhs.stack_;
76 rhs.stack_ = 0;
88 internal::Swap(stack_, rhs.stack_);
187 char *stack_; member in class:internal::Stack [all...] |
/art/compiler/optimizing/ |
induction_var_analysis.h | 221 ArenaVector<HInstruction*> stack_; member in class:art::HInductionVarAnalysis
|
/art/runtime/gc/ |
allocation_record.h | 81 stack_(std::move(r.stack_)) {} 85 stack_(r.stack_) {} 96 return stack_.size(); 101 return stack_[index]; 105 stack_.push_back(element); 109 DCHECK_LT(index, stack_.size()); 110 stack_[index].SetMethod(m); 111 stack_[index].SetDexPc(dex_pc) 121 std::vector<AllocRecordStackTraceElement> stack_; member in class:art::gc::AllocRecordStackTrace [all...] |
/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/crankshaft/x87/ |
lithium-codegen-x87.h | 364 stack_[i] = other.stack_[i]; 370 if (!stack_[i].is(other.stack_[i])) return false; 377 stack_[i] = other.stack_[i]; 399 stack_[stack_depth_] = reg; 410 X87Register stack_[X87Register::kMaxNumAllocatableRegisters]; member in class:v8::internal::LCodeGen::X87Stack
|
/external/v8/src/ |
json-stringifier.h | 109 Handle<JSArray> stack_; member in class:v8::internal::BASE_EMBEDDED 188 stack_ = factory()->NewJSArray(8); 270 int length = Smi::cast(stack_->length())->value(); 273 FixedArray* elements = FixedArray::cast(stack_->elements()); 284 JSArray::SetLength(stack_, length + 1); 285 FixedArray::cast(stack_->elements())->set(length, *object); 291 int length = Smi::cast(stack_->length())->value(); 292 stack_->set_length(Smi::FromInt(length - 1));
|