48 lines
1.8 KiB
C++
48 lines
1.8 KiB
C++
//===- ArgumentPromotion.h - Promote by-reference arguments -----*- C++ -*-===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_TRANSFORMS_IPO_ARGUMENTPROMOTION_H
|
|
#define LLVM_TRANSFORMS_IPO_ARGUMENTPROMOTION_H
|
|
|
|
#include "llvm/Analysis/CGSCCPassManager.h"
|
|
#include "llvm/Analysis/LazyCallGraph.h"
|
|
#include "llvm/IR/PassManager.h"
|
|
|
|
namespace llvm {
|
|
class TargetTransformInfo;
|
|
|
|
/// Argument promotion pass.
|
|
///
|
|
/// This pass walks the functions in each SCC and for each one tries to
|
|
/// transform it and all of its callers to replace indirect arguments with
|
|
/// direct (by-value) arguments.
|
|
class ArgumentPromotionPass : public PassInfoMixin<ArgumentPromotionPass> {
|
|
unsigned MaxElements;
|
|
|
|
public:
|
|
ArgumentPromotionPass(unsigned MaxElements = 3u) : MaxElements(MaxElements) {}
|
|
|
|
/// Check if callers and the callee \p F agree how promoted arguments would be
|
|
/// passed. The ones that they do not agree on are eliminated from the sets but
|
|
/// the return value has to be observed as well.
|
|
static bool areFunctionArgsABICompatible(
|
|
const Function &F, const TargetTransformInfo &TTI,
|
|
SmallPtrSetImpl<Argument *> &ArgsToPromote,
|
|
SmallPtrSetImpl<Argument *> &ByValArgsToTransform);
|
|
|
|
/// Checks if a type could have padding bytes.
|
|
static bool isDenselyPacked(Type *type, const DataLayout &DL);
|
|
|
|
PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
|
|
LazyCallGraph &CG, CGSCCUpdateResult &UR);
|
|
};
|
|
|
|
} // end namespace llvm
|
|
|
|
#endif // LLVM_TRANSFORMS_IPO_ARGUMENTPROMOTION_H
|