33       : C1(std::min(Ca, Cb)), C2(std::max(Ca, Cb)), Weight(W) {}  in ClusterArc()
36     return Lhs.C1 == Rhs.C1 && Lhs.C2 == Rhs.C2;  in operator ==()
40   Cluster *const C2;  member in llvm::bolt::__anon7e5cf51d0111::ClusterArc
48     return hashCombine(Hasher(int64_t(Arc.C1)), int64_t(Arc.C2));  in operator ()()
54 void orderFuncs(const CallGraph &Cg, Cluster *C1, Cluster *C2) {  in orderFuncs()  argument
57   NodeId C2head = C2->targets().front();  in orderFuncs()
58   NodeId C2tail = C2->targets().back();  in orderFuncs()
89     C2->reverseTargets();  in orderFuncs()
92     C2->reverseTargets();  in orderFuncs()
115   auto insertOrInc = [&](Cluster *C1, Cluster *C2, double Weight) {  in pettisAndHansen()  argument
116     auto Res = Carcs.emplace(C1, C2, Weight);  in pettisAndHansen()
156     Cluster *const C2 = Max.C2;  in pettisAndHansen()  local
158     if (C1->size() + C2->size() > MaxClusterSize)  in pettisAndHansen()
161     if (C1->frozen() || C2->frozen())  in pettisAndHansen()
166     orderFuncs(Cg, C1, C2);  in pettisAndHansen()
169                                 C2->toString().c_str(), C1->toString().c_str(),  in pettisAndHansen()
176       if (Carc.C1 == C2)  in pettisAndHansen()
177         C2arcs.emplace(Carc, Carc.C2);  in pettisAndHansen()
178       if (Carc.C2 == C2)  in pettisAndHansen()
192     for (NodeId F : C2->targets())  in pettisAndHansen()
195     C1->merge(*C2, Max.Weight);  in pettisAndHansen()
196     C2->clear();  in pettisAndHansen()