HomeSort by relevance Sort by last modified time
    Searched defs:nodes_ (Results 1 - 12 of 12) sorted by null

  /external/webrtc/webrtc/modules/audio_processing/transient/
wpd_tree.h 86 rtc::scoped_ptr<rtc::scoped_ptr<WPDNode>[]> nodes_; member in class:webrtc::WPDTree
  /external/v8/src/
fast-accessor-assembler.h 109 std::vector<compiler::Node*> nodes_; member in class:v8::internal::FastAccessorAssembler
  /external/v8/src/compiler/
load-elimination.h 45 for (size_t i = 0; i < arraysize(nodes_); ++i) {
46 nodes_[i] = nullptr;
50 nodes_[next_index_++] = node;
55 that->nodes_[that->next_index_] = node;
56 that->next_index_ = (that->next_index_ + 1) % arraysize(nodes_);
66 Node* nodes_[kMaxTrackedChecks]; member in class:v8::internal::compiler::final::final
instruction-scheduler.h 104 nodes_(scheduler->zone()) {
110 return nodes_.empty();
115 ZoneLinkedList<ScheduleGraphNode*> nodes_; member in class:v8::internal::compiler::final::SchedulingQueueBase
schedule.h 82 bool empty() const { return nodes_.empty(); }
83 size_t size() const { return nodes_.size(); }
84 Node* NodeAt(size_t index) { return nodes_[index]; }
85 size_t NodeCount() const { return nodes_.size(); }
87 value_type& front() { return nodes_.front(); }
88 value_type const& front() const { return nodes_.front(); }
91 iterator begin() { return nodes_.begin(); }
92 iterator end() { return nodes_.end(); }
95 const_iterator begin() const { return nodes_.begin(); }
96 const_iterator end() const { return nodes_.end();
166 NodeVector nodes_; \/\/ nodes of this block in forward order. member in class:v8::internal::compiler::final
    [all...]
simplified-lowering.cc 296 nodes_(zone),
583 // Process nodes from the collected {nodes_} vector.
584 for (NodeVector::iterator i = nodes_.begin(); i != nodes_.end(); ++i) {
612 nodes_.push_back(node);
617 // for that input node. Add the input to {nodes_} if this is the first time
632 nodes_.push_back(node);
2795 NodeVector nodes_; \/\/ collected nodes member in class:v8::internal::compiler::RepresentationSelector
    [all...]
  /external/jsoncpp/include/json/
reader.h 231 Nodes nodes_; member in class:Json::Reader
  /external/v8/src/profiler/
sampling-heap-profiler.h 28 AllocationProfile() : nodes_() {}
31 return nodes_.size() == 0 ? nullptr : &nodes_.front();
34 std::deque<v8::AllocationProfile::Node>& nodes() { return nodes_; }
37 std::deque<v8::AllocationProfile::Node> nodes_; member in class:v8::internal::AllocationProfile
  /build/kati/
ninja.cc 199 for (NinjaNode* nn : nodes_)
250 nodes_.push_back(nn);
609 int num_nodes_per_task = nodes_.size() / (g_flags.num_jobs * 10) + 1;
610 int num_tasks = nodes_.size() / num_nodes_per_task + 1;
615 static_cast<int>(nodes_.size()));
617 EmitNode(nodes_[j], &bufs[i]);
793 vector<NinjaNode*> nodes_; member in class:NinjaGenerator
  /external/v8/src/regexp/
regexp-ast.h 254 ZoneList<RegExpTree*>* nodes() { return nodes_; }
257 ZoneList<RegExpTree*>* nodes_; member in class:v8::internal::final
  /external/protobuf/conformance/third_party/jsoncpp/
json.h 1480 Nodes nodes_; member in class:Json::Reader
    [all...]
  /prebuilts/tools/common/m2/repository/net/sourceforge/htmlunit/htmlunit/2.14/
htmlunit-2.14.jar 

Completed in 2025 milliseconds