| /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
|
| /external/opencv3/3rdparty/libwebp/utils/ |
| huffman.h | 27 int children_; // delta offset to both children (contiguous) or 0 if leaf. member in struct:__anon20474
41 return (node->children_ == 0);
47 return node + node->children_ + right_child;
|
| huffman.c | 27 node->children_ = -1; // means: 'unassigned so far'
31 return (node->children_ < 0);
41 node->children_ = (int)(children - node);
134 node += node->children_ + ((code >> code_length) & 1);
137 node->children_ = 0; // turn newly created node into a leaf.
|
| /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/libweave/src/notification/ |
| xml_node.cc | 30 return children_;
67 for (const auto& child : children_) {
98 children_.push_back(std::move(child));
107 if (text_.empty() && children_.empty()) {
114 for (const auto& child : children_) {
|
| xml_node.h | 115 std::vector<std::unique_ptr<XmlNode>> children_; member in class:weave::final
|
| /external/v8/src/compiler/ |
| loop-analysis.h | 39 const ZoneVector<Loop*>& children() const { return children_; }
52 children_(zone),
58 ZoneVector<Loop*> children_; member in class:v8::internal::compiler::LoopTree::Loop
132 parent->children_.push_back(child);
|
| loop-analysis.cc | 407 for (LoopTree::Loop* child : loop->children_) SerializeLoop(child);
445 for (LoopTree::Loop* child : loop->children_) PrintLoop(child);
|
| /external/v8/src/profiler/ |
| profile-generator-inl.h | 36 children_(CodeEntriesMatch),
|
| 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
|
| sampling-heap-profiler.h | 82 for (auto child : children_) {
109 std::map<FunctionId, AllocationNode*> children_; member in class:v8::internal::SamplingHeapProfiler::AllocationNode
|
| profile-generator.cc | 209 children_.Lookup(entry, CodeEntryHash(entry));
217 children_.LookupOrInsert(entry, CodeEntryHash(entry));
289 for (base::HashMap::Entry* p = children_.Start(); p != NULL;
290 p = children_.Next(p)) {
|
| heap-snapshot-generator.h | 165 List<HeapGraphEdge*>& children() { return children_; }
194 List<HeapGraphEdge*> children_; member in class:v8::internal::HeapSnapshot
|
| profile-generator.h | 223 base::HashMap children_; member in class:v8::internal::ProfileNode
|
| /build/kati/ |
| find.cc | 203 for (auto& p : children_) {
213 for (auto& child : children_) {
254 for (const auto& p : children_) {
270 for (const auto& p : children_) {
282 for (const auto& p : children_) {
298 children_.emplace(children_.end(), name, c);
302 vector<pair<string, DirentNode*>> children_; member in class:__anon1263::DirentDirNode
|
| dep.cc | 85 for (auto& p : children_)
95 auto p = children_.emplace(c, nullptr);
111 auto found = children_.find(name[0]);
112 if (found != children_.end()) {
119 for (const auto& c : children_)
126 unordered_map<char, RuleTrie*> children_; member in class:__anon1260::RuleTrie
|
| /art/runtime/ |
| profiler.h | 64 void AppendChild(StackTrieNode* child) { children_.insert(child); }
87 std::set<StackTrieNode*, StackTrieNodeComparator> children_; member in class:art::StackTrieNode
|
| profiler.cc | 901 if (children_.size() == 0) {
906 std::set<StackTrieNode*, StackTrieNodeComparator>::iterator i = children_.find(node);
908 return (i == children_.end()) ? nullptr : *i;
912 for (auto &child : children_) {
|
| /bionic/linker/ |
| linker.h | 395 soinfo_list_t children_; member in struct:soinfo
|
| linker.cpp | [all...] |
