Lines Matching refs:NewClauses
2327 SmallVector<Constant *, 16> NewClauses; // - Clauses for the new instruction; in visitLandingPadInst() local
2342 NewClauses.push_back(CatchClause); in visitLandingPadInst()
2373 NewClauses.push_back(FilterClause); in visitLandingPadInst()
2443 NewClauses.push_back(FilterClause); in visitLandingPadInst()
2462 for (unsigned i = 0, e = NewClauses.size(); i + 1 < e; ) { in visitLandingPadInst()
2466 if (!isa<ArrayType>(NewClauses[j]->getType())) in visitLandingPadInst()
2473 if (shorter_filter(NewClauses[k+1], NewClauses[k])) { in visitLandingPadInst()
2476 std::stable_sort(NewClauses.begin() + i, NewClauses.begin() + j, in visitLandingPadInst()
2497 for (unsigned i = 0; i + 1 < NewClauses.size(); ++i) { in visitLandingPadInst()
2499 Value *Filter = NewClauses[i]; in visitLandingPadInst()
2507 for (unsigned j = NewClauses.size() - 1; j != i; --j) { in visitLandingPadInst()
2508 Value *LFilter = NewClauses[j]; in visitLandingPadInst()
2515 SmallVectorImpl<Constant *>::iterator J = NewClauses.begin() + j; in visitLandingPadInst()
2519 NewClauses.erase(J); in visitLandingPadInst()
2536 NewClauses.erase(J); in visitLandingPadInst()
2550 NewClauses.erase(J); in visitLandingPadInst()
2578 NewClauses.erase(J); in visitLandingPadInst()
2590 NewClauses.size()); in visitLandingPadInst()
2591 for (unsigned i = 0, e = NewClauses.size(); i != e; ++i) in visitLandingPadInst()
2592 NLI->addClause(NewClauses[i]); in visitLandingPadInst()
2596 if (NewClauses.empty()) in visitLandingPadInst()