| /system/core/libmemunreachable/ |
| PtracerThread.h | 47 std::unique_ptr<Stack> stack_; member in class:android::PtracerThread
|
| Tarjan.h | 70 : index_(0), stack_(allocator), components_(allocator) {}
79 allocator::vector<Node<T>*> stack_; member in class:android::TarjanAlgorithm
85 stack_.clear();
107 stack_.push_back(vertex);
113 } else if (std::find(stack_.begin(), stack_.end(), vertex_next) != stack_.end()) {
121 other_vertex = stack_.back();
122 stack_.pop_back();
124 } 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 | 65 std::stack<base::Closure> stack_; member in class:base::AtExitManager
|
| /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 explicit 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...] |
| /external/pdfium/core/fpdfapi/parser/ |
| cpdf_object_walker.h | 56 std::stack<std::unique_ptr<SubobjectIterator>> stack_; member in class:CPDF_ObjectWalker
|
| /external/tensorflow/tensorflow/core/platform/default/ |
| stacktrace.h | 91 void* const* stack() const { return stack_; }
94 void* stack_[32]; member in class:tensorflow::SavedStackTrace
|
| /external/v8/src/ |
| json-stringifier.h | 113 Handle<JSArray> stack_; member in class:v8::internal::BASE_EMBEDDED
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| BytesTrie.java | 528 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>(); local
[all...] |
| CharsTrie.java | 453 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
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| BytesTrie.java | 560 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>(); local
[all...] |
| CharsTrie.java | 476 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
[all...] |
| /art/runtime/ |
| thread_pool.h | 56 DCHECK(stack_.get() != nullptr);
57 return stack_->Size();
74 std::unique_ptr<MemMap> stack_; member in class:art::ThreadPoolWorker
|
| /external/v8/src/compiler/ |
| graph-reducer.h | 178 ZoneStack<NodeState> stack_; member in class:v8::internal::compiler::GraphReducer
|
| int64-lowering.h | 73 ZoneDeque<NodeState> stack_; member in class:v8::internal::compiler::Int64Lowering
|
| simd-scalar-lowering.h | 74 ZoneDeque<NodeState> stack_; member in class:v8::internal::compiler::SimdScalarLowering
|
| state-values-utils.h | 116 SparseInputMask::InputIterator 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...] |
| /system/core/libunwindstack/ |
| DwarfOp.h | 64 AddressType StackAt(size_t index) { return stack_[index]; }
65 size_t StackSize() { return stack_.size(); }
86 AddressType value = stack_.front();
87 stack_.pop_front();
101 std::deque<AddressType> stack_; member in class:unwindstack::DwarfOp
|
| /art/compiler/optimizing/ |
| induction_var_analysis.h | 262 ArenaVector<HInstruction*> stack_; member in class:art::HInductionVarAnalysis
|
| /art/runtime/gc/ |
| allocation_record.h | 82 stack_(std::move(r.stack_)) {}
86 stack_(r.stack_) {}
97 return stack_.size();
102 return stack_[index];
106 stack_.push_back(element);
110 DCHECK_LT(index, stack_.size());
111 stack_[index].SetMethod(m);
112 stack_[index].SetDexPc(dex_pc)
122 std::vector<AllocRecordStackTraceElement> stack_; member in class:art::gc::AllocRecordStackTrace
[all...] |
