mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 19:12:56 +02:00
f2e8848268
CFG sorting was already an independent algorithm from block/loop insertion; this change makes it more convenient to debug. llvm-svn: 296399
44 lines
1.3 KiB
C++
44 lines
1.3 KiB
C++
//===-- WebAssemblyUtilities - WebAssembly Utility Functions ---*- C++ -*-====//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
///
|
|
/// \file
|
|
/// \brief This file contains the declaration of the WebAssembly-specific
|
|
/// utility functions.
|
|
///
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_LIB_TARGET_WEBASSEMBLY_WEBASSEMBLYUTILITIES_H
|
|
#define LLVM_LIB_TARGET_WEBASSEMBLY_WEBASSEMBLYUTILITIES_H
|
|
|
|
namespace llvm {
|
|
|
|
class MachineBasicBlock;
|
|
class MachineInstr;
|
|
class MachineLoop;
|
|
class WebAssemblyFunctionInfo;
|
|
|
|
namespace WebAssembly {
|
|
|
|
bool isArgument(const MachineInstr &MI);
|
|
bool isCopy(const MachineInstr &MI);
|
|
bool isTee(const MachineInstr &MI);
|
|
bool isChild(const MachineInstr &MI, const WebAssemblyFunctionInfo &MFI);
|
|
bool isCallIndirect(const MachineInstr &MI);
|
|
|
|
} // end namespace WebAssembly
|
|
|
|
/// Return the "bottom" block of a loop. This differs from
|
|
/// MachineLoop::getBottomBlock in that it works even if the loop is
|
|
/// discontiguous.
|
|
MachineBasicBlock *LoopBottom(const MachineLoop *Loop);
|
|
|
|
} // end namespace llvm
|
|
|
|
#endif
|