42   BuildResult<Node> Interval;  in buildInterval()  local
43   Interval.Nodes.push_back(Header);  in buildInterval()
79       return llvm::is_contained(Interval.Nodes, P);  in buildInterval()
82       Interval.Nodes.push_back(B);  in buildInterval()
98     if (!llvm::is_contained(Interval.Nodes, B))  in buildInterval()
99       Interval.Successors.insert(B);  in buildInterval()
101   return Interval;  in buildInterval()
113   CFGIntervalNode &Interval = Graph.emplace_back(Graph.size());  in fillIntervalNode()  local
122     Index[getID(*N)] = &Interval;  in fillIntervalNode()
126     Interval.Nodes = std::move(Result.Nodes);  in fillIntervalNode()
136     Interval.Nodes = std::move(Nodes);  in fillIntervalNode()