| /external/webrtc/webrtc/base/ |
| taskparent.cc | 41 children_.reset(new ChildSet());
46 children_->insert(child);
52 return task->parent_ == this && children_->find(task) != children_->end();
57 for (ChildSet::iterator it = children_->begin();
58 it != children_->end();
71 if (children_->size() > 0) {
76 ChildSet copy = *children_;
95 children_->erase(child);
|
| taskparent.h | 55 scoped_ptr<ChildSet> children_; member in class:rtc::TaskParent
|
| /frameworks/base/tools/aapt2/ |
| DominatorTree.cpp | 53 for (auto& child : children_) {
56 new_child->children_.push_back(std::move(child));
63 children_.erase(
64 std::remove_if(children_.begin(), children_.end(),
68 children_.end());
71 for (auto& child : children_) {
79 children_.push_back(std::move(new_child));
|
| DominatorTree.h | 65 return children_;
76 std::vector<std::unique_ptr<Node>> children_; member in class:aapt::DominatorTree::Node
|
| /toolchain/binutils/binutils-2.25/gold/ |
| arm-reloc-property.h | 170 : is_leaf_(true), name_(name), children_()
177 : is_leaf_(false), name_(), children_()
180 this->children_.push_back(*p);
185 for(size_t i = 0; i <this->children_.size(); ++i)
186 delete this->children_[i];
207 return this->children_.size();
214 gold_assert(!this->is_leaf_ && i < this->children_.size());
215 return this->children_[i];
233 for(size_t i = 0; i <this->children_.size(); ++i)
234 s = s + " " + this->children_[i]->s_expression()
244 Tree_node_vector children_; member in class:gold::Arm_reloc_property::Tree_node
[all...] |
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator.cc | 34 children_[kLeftChild] = NULL;
35 children_[kRightChild] = NULL;
47 delete children_[kLeftChild];
48 delete children_[kRightChild];
68 assert(!children_[kLeftChild]);
69 children_[kLeftChild] =
72 children_[kLeftChild]->set_max_parent_size(max_parent_size_);
73 children_[kLeftChild]->set_min_parent_size(min_parent_size_);
75 children_[kLeftChild]->set_packet_start(false);
79 assert(!children_[kRightChild])
[all...] |
| vp8_partition_aggregator.h | 58 PartitionTreeNode* left_child() const { return children_[kLeftChild]; }
59 PartitionTreeNode* right_child() const { return children_[kRightChild]; }
73 PartitionTreeNode* children_[2]; member in class:webrtc::PartitionTreeNode
|
| /external/v8/src/compiler/ |
| loop-analysis.h | 40 const ZoneVector<Loop*>& children() const { return children_; }
54 children_(zone),
61 ZoneVector<Loop*> children_; member in class:v8::internal::compiler::LoopTree::Loop
142 parent->children_.push_back(child);
|
| loop-analysis.cc | 454 for (LoopTree::Loop* child : loop->children_) SerializeLoop(child);
502 for (LoopTree::Loop* child : loop->children_) PrintLoop(child);
|
| /external/v8/src/profiler/ |
| allocation-tracker.cc | 25 for (int i = 0; i < children_.length(); i++) delete children_[i];
31 for (int i = 0; i < children_.length(); i++) {
32 AllocationTraceNode* node = children_[i];
44 children_.Add(child);
67 for (int i = 0; i < children_.length(); i++) {
68 children_[i]->Print(indent, tracker);
|
| sampling-heap-profiler.cc | 126 while (node->allocations_.empty() && node->children_.empty() &&
131 parent->children_.erase(id);
145 auto it = children_.find(id);
146 if (it != children_.end()) {
151 children_.insert(std::make_pair(id, child));
252 for (auto it : node->children_) {
|
| allocation-tracker.h | 39 Vector<AllocationTraceNode*> children() const { return children_.ToVector(); }
49 List<AllocationTraceNode*> children_; member in class:v8::internal::AllocationTraceNode
|
| profile-generator-inl.h | 37 children_(CodeEntriesMatch),
|
| sampling-heap-profiler.h | 83 for (auto child : children_) {
110 std::map<FunctionId, AllocationNode*> children_; member in class:v8::internal::SamplingHeapProfiler::AllocationNode
|
| profile-generator.cc | 196 children_.Lookup(entry, CodeEntryHash(entry));
204 children_.LookupOrInsert(entry, CodeEntryHash(entry));
275 for (base::HashMap::Entry* p = children_.Start(); p != NULL;
276 p = children_.Next(p)) {
|
| heap-snapshot-generator.h | 167 List<HeapGraphEdge*>& children() { return children_; }
196 List<HeapGraphEdge*> children_; member in class:v8::internal::HeapSnapshot
|
| profile-generator.h | 214 base::CustomMatcherHashMap children_; member in class:v8::internal::ProfileNode
|
| /external/protobuf/src/google/protobuf/util/internal/ |
| default_value_objectwriter.cc | 207 for (int i = 0; i < children_.size(); ++i) {
208 Node* child = children_[i];
249 for (int i = 0; i < children_.size(); ++i) {
250 Node* child = children_[i];
298 for (int i = 0; i < children_.size(); ++i) {
299 InsertIfNotPresent(&orig_children_map, children_[i]->name_, i);
322 new_children.push_back(children_[found->second]);
323 children_[found->second] = NULL;
372 // Adds all leftover nodes in children_ to the beginning of new_child.
373 for (int i = 0; i < children_.size(); ++i)
[all...] |
| default_value_objectwriter.h | 141 for (int i = 0; i < children_.size(); ++i) {
142 delete children_[i];
147 void AddChild(Node* child) { children_.push_back(child); }
173 int number_of_children() const { return children_.size(); }
191 // Calls WriteTo() on every child in children_.
205 std::vector<Node*> children_; member in class:google::protobuf::util::converter::DefaultValueObjectWriter::Node
|
| /build/kati/ |
| find.cc | 237 for (auto& p : children_) {
247 for (auto& child : children_) {
287 for (const auto& p : children_) {
316 for (const auto& p : children_) {
328 for (const auto& p : children_) {
344 children_.emplace(children_.end(), name, c);
348 vector<pair<string, DirentNode*>> children_; member in class:__anon1405::DirentDirNode
|
| dep.cc | 86 for (auto& p : children_)
96 auto p = children_.emplace(c, nullptr);
112 auto found = children_.find(name[0]);
113 if (found != children_.end()) {
120 for (const auto& c : children_)
127 unordered_map<char, RuleTrie*> children_; member in class:__anon1402::RuleTrie
|
| /frameworks/native/services/vr/performanced/ |
| cpu_set.h | 52 std::vector<std::unique_ptr<CpuSet>> children_; member in class:android::dvr::CpuSet
|
| cpu_set.cpp | 283 children_.push_back(std::move(child));
|
| /bionic/linker/ |
| linker_soinfo.cpp | 442 this->children_.push_back(child);
452 children_.for_each([&] (soinfo* child) {
459 parent->children_.remove_if([&] (const soinfo* child) {
476 children_.clear();
579 return children_;
587 return children_;
|
| linker_soinfo.h | 298 soinfo_list_t children_; member in struct:soinfo
|
