| /external/webrtc/webrtc/base/ |
| D | taskparent.cc | 41 children_.reset(new ChildSet()); in Initialize()
46 children_->insert(child); in AddChild()
52 return task->parent_ == this && children_->find(task) != children_->end(); in IsChildTask()
57 for (ChildSet::iterator it = children_->begin(); in AllChildrenDone()
58 it != children_->end(); in AllChildrenDone()
71 if (children_->size() > 0) { in AbortAllChildren()
76 ChildSet copy = *children_; in AbortAllChildren()
95 children_->erase(child); in OnChildStopped()
|
| D | taskparent.h | 55 scoped_ptr<ChildSet> children_; variable
|
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| D | vp8_partition_aggregator.cc | 34 children_[kLeftChild] = NULL; in PartitionTreeNode()
35 children_[kRightChild] = NULL; in PartitionTreeNode()
47 delete children_[kLeftChild]; in ~PartitionTreeNode()
48 delete children_[kRightChild]; in ~PartitionTreeNode()
68 assert(!children_[kLeftChild]); in CreateChildren()
69 children_[kLeftChild] = in CreateChildren()
72 children_[kLeftChild]->set_max_parent_size(max_parent_size_); in CreateChildren()
73 children_[kLeftChild]->set_min_parent_size(min_parent_size_); in CreateChildren()
75 children_[kLeftChild]->set_packet_start(false); in CreateChildren()
79 assert(!children_[kRightChild]); in CreateChildren()
[all …]
|
| D | vp8_partition_aggregator.h | 58 PartitionTreeNode* left_child() const { return children_[kLeftChild]; } in left_child()
59 PartitionTreeNode* right_child() const { return children_[kRightChild]; } in right_child()
73 PartitionTreeNode* children_[2]; variable
|
| /external/libweave/src/notification/ |
| D | xml_node.cc | 30 return children_; in children()
67 for (const auto& child : children_) { in FindChildHelper()
98 children_.push_back(std::move(child)); in AddChild()
107 if (text_.empty() && children_.empty()) { in ToString()
114 for (const auto& child : children_) { in ToString()
|
| D | xml_node.h | 115 std::vector<std::unique_ptr<XmlNode>> children_; variable
|
| /external/v8/src/profiler/ |
| D | allocation-tracker.cc | 25 for (int i = 0; i < children_.length(); i++) delete children_[i]; in ~AllocationTraceNode()
31 for (int i = 0; i < children_.length(); i++) { in FindChild()
32 AllocationTraceNode* node = children_[i]; in FindChild()
44 children_.Add(child); in FindOrAddChild()
67 for (int i = 0; i < children_.length(); i++) { in Print()
68 children_[i]->Print(indent, tracker); in Print()
|
| D | sampling-heap-profiler.cc | 126 while (node->allocations_.empty() && node->children_.empty() && in OnWeakCallback()
131 parent->children_.erase(id); in OnWeakCallback()
145 auto it = children_.find(id); in FindOrAddChildNode()
146 if (it != children_.end()) { in FindOrAddChildNode()
151 children_.insert(std::make_pair(id, child)); in FindOrAddChildNode()
252 for (auto it : node->children_) { in TranslateAllocationNode()
|
| D | allocation-tracker.h | 39 Vector<AllocationTraceNode*> children() const { return children_.ToVector(); } in children()
49 List<AllocationTraceNode*> children_; variable
|
| D | sampling-heap-profiler.h | 82 for (auto child : children_) { in ~AllocationNode()
109 std::map<FunctionId, AllocationNode*> children_; variable
|
| D | profile-generator-inl.h | 36 children_(CodeEntriesMatch), in ProfileNode()
|
| D | profile-generator.cc | 209 children_.Lookup(entry, CodeEntryHash(entry)); in FindChild()
217 children_.LookupOrInsert(entry, CodeEntryHash(entry)); in FindOrAddChild()
289 for (base::HashMap::Entry* p = children_.Start(); p != NULL; in Print()
290 p = children_.Next(p)) { in Print()
|
| D | heap-snapshot-generator.h | 165 List<HeapGraphEdge*>& children() { return children_; } in children()
194 List<HeapGraphEdge*> children_; variable
|
| D | profile-generator.h | 223 base::HashMap children_; variable
|
| D | heap-snapshot-generator.cc | 342 GetMemoryUsedByList(children_) + in RawSnapshotSize()
|
| /external/v8/src/compiler/ |
| D | loop-analysis.h | 39 const ZoneVector<Loop*>& children() const { return children_; } in children()
52 children_(zone), in Loop()
58 ZoneVector<Loop*> children_; variable
132 parent->children_.push_back(child); in SetParent()
|
| D | loop-analysis.cc | 407 for (LoopTree::Loop* child : loop->children_) SerializeLoop(child); in SerializeLoop()
445 for (LoopTree::Loop* child : loop->children_) PrintLoop(child); in PrintLoop()
|