84 class Edge;
240   const std::vector<std::pair<Chain *, Edge *>> &edges() const { return Edges; }  in edges()
242   Edge *getEdge(Chain *Other) const {  in getEdge()
243     for (std::pair<Chain *, Edge *> It : Edges)  in getEdge()
260   void addEdge(Chain *Other, Edge *Edge) { Edges.emplace_back(Other, Edge); }  in addEdge()  argument
291   std::vector<std::pair<Chain *, Edge *>> Edges;
297 class Edge {  class
299   Edge(const Edge &) = delete;
300   Edge(Edge &&) = default;
301   Edge &operator=(const Edge &) = delete;
302   Edge &operator=(Edge &&) = default;
304   explicit Edge(Block *SrcBlock, Block *DstBlock, uint64_t EC)  in Edge()  function in llvm::bolt::Edge
321   void moveJumps(Edge *Other) {  in moveJumps()
370     Edge *const DstEdge = EdgeIt.second;  in mergeEdges()
374     Edge *curEdge = getEdge(TargetChain);  in mergeEdges()
525         Edge *CurEdge = Block.CurChain->getEdge(SuccBlock->CurChain);  in initialize()
559       for (std::pair<class Block *, uint64_t> &Edge : Block.OutJumps) {  in mergeFallthroughs()
560         class Block *const SuccBlock = Edge.first;  in mergeFallthroughs()
562         if (Block.OutWeight == Edge.second &&  in mergeFallthroughs()
563             SuccBlock->InWeight == Edge.second && SuccBlock->Index != 0) {  in mergeFallthroughs()
614           Edge *ChainEdge = EdgeIter.second;  in mergeChainPairs()
697   MergeGainTy mergeGain(Chain *ChainPred, Chain *ChainSucc, Edge *Edge) const {  in mergeGain()
698     if (Edge->hasCachedMergeGain(ChainPred, ChainSucc))  in mergeGain()
699       return Edge->getCachedMergeGain(ChainPred, ChainSucc);  in mergeGain()
702     JumpList Jumps = Edge->jumps();  in mergeGain()
703     class Edge *EdgePP = ChainPred->getEdge(ChainPred);  in mergeGain()
734     Edge->setCachedMergeGain(ChainPred, ChainSucc, Gain);  in mergeGain()
802     Edge *SelfEdge = Into->getEdge(Into);  in mergeChains()
812     for (std::pair<Chain *, Edge *> EdgeIter : Into->edges())  in mergeChains()
864   std::vector<Edge> AllEdges;