Lines Matching full:codesize

65     "funcspec-max-codesize-growth", cl::init(3), cl::Hidden, cl::desc(
66     "Maximum codesize growth allowed per function"));
69     "funcspec-min-codesize-savings", cl::init(20), cl::Hidden,
70     cl::desc("Reject specializations whose codesize savings are less than this "
102 // Estimates the codesize savings due to dead code after constant propagation.
110   Cost CodeSize = 0;
111   // Accumulate the codesize savings of each basic block.
129       LLVM_DEBUG(dbgs() << "FnSpecialization:     CodeSize " << C
131       CodeSize += C;
140   return CodeSize;
152   Cost CodeSize;
157       CodeSize += getCodeSizeSavingsForUser(Phi);
159   return CodeSize;
162 /// Compute the codesize savings for replacing argument \p A with constant \p C.
166   Cost CodeSize;
170         CodeSize += getCodeSizeSavingsForUser(UI, A, C);
172   LLVM_DEBUG(dbgs() << "FnSpecialization:   Accumulated bonus {CodeSize = "
173                     << CodeSize << "} for argument " << *A << "\n");
174   return CodeSize;
223   Cost CodeSize = 0;
225     CodeSize = estimateSwitchInst(*I);
227     CodeSize = estimateBranchInst(*I);
239   CodeSize += TTI.getInstructionCost(User, TargetTransformInfo::TCK_CodeSize);
241   LLVM_DEBUG(dbgs() << "FnSpecialization:     {CodeSize = " << CodeSize
247         CodeSize += getCodeSizeSavingsForUser(UI, User, C);
249   return CodeSize;
667   assert(Value >= 0 && "CodeSize and Latency cannot be negative");
717     assert(Sz > 0 && "CodeSize should be positive");
788     // Accumulate the codesize growth for the function, now we are creating the
790     FunctionGrowth[S.F] += S.CodeSize;
936       Cost CodeSize;
940         CodeSize += Visitor.getCodeSizeSavingsForArg(A.Formal, A.Actual);
943       CodeSize += Visitor.getCodeSizeSavingsFromPendingPHIs();
945       unsigned CodeSizeSavings = getCostValue(CodeSize);
962             dbgs() << "FnSpecialization: Specialization bonus {CodeSize = "
966         // Minimum codesize savings.
982         // Maximum codesize growth.