295       const PBQPRAProblem::AllowedSet &vr2Allowed = p->getAllowedSet(vr2);  in build()  local
301                     PBQP::Matrix(vr1Allowed.size()+1, vr2Allowed.size()+1, 0));  in build()
303         addInterferenceCosts(g.getEdgeCosts(edge), vr1Allowed, vr2Allowed, tri);  in build()
319                                     const PBQPRAProblem::AllowedSet &vr2Allowed,  in addInterferenceCosts()  argument
322   assert(costMat.getCols() == vr2Allowed.size() + 1 && "Matrix width mismatch.");  in addInterferenceCosts()
327     for (unsigned j = 0; j != vr2Allowed.size(); ++j) {  in addInterferenceCosts()
328       unsigned preg2 = vr2Allowed[j];  in addInterferenceCosts()
429                                     const PBQPRAProblem::AllowedSet &vr2Allowed,  in addVirtRegCoalesce()  argument
433   assert(costMat.getCols() == vr2Allowed.size() + 1 && "Size mismatch.");  in addVirtRegCoalesce()
437     for (unsigned j = 0; j != vr2Allowed.size(); ++j) {  in addVirtRegCoalesce()
438       unsigned preg2 = vr2Allowed[j];  in addVirtRegCoalesce()