219   bool HasDataDependency(const SchedulingNode* node) const {  in HasDataDependency()  argument
220     return ContainsElement(data_predecessors_, node);  in HasDataDependency()
223   bool HasOtherDependency(const SchedulingNode* node) const {  in HasOtherDependency()  argument
224     return ContainsElement(other_predecessors_, node);  in HasOtherDependency()
331     std::unique_ptr<SchedulingNode> node(
333     SchedulingNode* result = node.get();
334     nodes_map_.insert(std::make_pair(instr, std::move(node)));
359   void AddDependency(SchedulingNode* node, SchedulingNode* dependency, bool is_data_dependency);
360   void AddDataDependency(SchedulingNode* node, SchedulingNode* dependency) {  in AddDataDependency()  argument
361     AddDependency(node, dependency, /*is_data_dependency*/true);  in AddDataDependency()
363   void AddOtherDependency(SchedulingNode* node, SchedulingNode* dependency) {  in AddOtherDependency()  argument
364     AddDependency(node, dependency, /*is_data_dependency*/false);  in AddOtherDependency()
384   void AddCrossIterationDependencies(SchedulingNode* node);
387   void AddDependencies(SchedulingNode* node, bool is_scheduling_barrier = false);
420   void CalculateLatency(SchedulingNode* node) {  in CalculateLatency()  argument
423     Visit(node->GetInstruction());  in CalculateLatency()
531   void CalculateLatency(SchedulingNode* node) {  in CalculateLatency()  argument
532     latency_visitor_->CalculateLatency(node);  in CalculateLatency()
533     node->SetLatency(latency_visitor_->GetLastVisitedLatency());  in CalculateLatency()
534     node->SetInternalLatency(latency_visitor_->GetLastVisitedInternalLatency());  in CalculateLatency()