Searched refs:RetOrArg (Results 1 - 2 of 2) sorted by relevance

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DDeadArgumentElimination.h44 struct RetOrArg { struct in class:llvm::DeadArgumentEliminationPass
49 RetOrArg(const Function *F, unsigned Idx, bool IsArg) function in struct:llvm::DeadArgumentEliminationPass::RetOrArg
52 /// Make RetOrArg comparable, so we can put it into a map.
53 bool operator<(const RetOrArg &O) const {
57 /// Make RetOrArg comparable, so we can easily iterate the multimap.
58 bool operator==(const RetOrArg &O) const {
82 RetOrArg CreateRet(const Function *F, unsigned Idx) {
83 return RetOrArg(F, Idx, false);
87 RetOrArg CreateArg(const Function *F, unsigned Idx) {
88 return RetOrArg(
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DDeadArgumentElimination.cpp359 DeadArgumentEliminationPass::MarkIfNotLive(RetOrArg Use,
389 RetOrArg Use = CreateRet(F, RetValNum);
395 RetOrArg Use = CreateRet(F, i);
452 RetOrArg Use = CreateArg(F, ArgNo);
662 void DeadArgumentEliminationPass::MarkValue(const RetOrArg &RA, Liveness L,
697 void DeadArgumentEliminationPass::MarkLive(const RetOrArg &RA) {
711 void DeadArgumentEliminationPass::PropagateLiveness(const RetOrArg &RA) {
755 RetOrArg Arg = CreateArg(F, i);
802 RetOrArg Ret = CreateRet(F, i);

Completed in 48 milliseconds