mirror of
https://github.com/RPCS3/llvm.git
synced 2026-01-31 01:25:19 +01:00
801b4cef3c
Summary: This problem stems from the fact that instructions are allocated using new in LLVM, i.e. there is no relationship that can be derived by just looking at the pointer value. This interface dispatches to appropriate dominance check given 2 instructions, i.e. in case the instructions are in the same basic block, ordered basicblock (with instruction numbering and caching) are used. Otherwise, dominator tree is used. This is a preparation patch for https://reviews.llvm.org/D32720 Reviewers: dberlin, hfinkel, davide Subscribers: davide, mgorny, llvm-commits Differential Revision: https://reviews.llvm.org/D33380 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@304764 91177308-0d34-0410-b5e6-96231b3b80d8
66 lines
2.0 KiB
C++
66 lines
2.0 KiB
C++
//===- OrderedInstructions.cpp - Unit tests for OrderedInstructions ------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Transforms/Utils/OrderedInstructions.h"
|
|
#include "llvm/IR/BasicBlock.h"
|
|
#include "llvm/IR/Dominators.h"
|
|
#include "llvm/IR/IRBuilder.h"
|
|
#include "llvm/IR/Instructions.h"
|
|
#include "llvm/IR/LLVMContext.h"
|
|
#include "llvm/IR/Module.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
using namespace llvm;
|
|
|
|
/// Check intra-basicblock and inter-basicblock dominance using
|
|
/// OrderedInstruction.
|
|
TEST(OrderedInstructionsTest, DominanceTest) {
|
|
LLVMContext Ctx;
|
|
Module M("test", Ctx);
|
|
IRBuilder<> B(Ctx);
|
|
FunctionType *FTy =
|
|
FunctionType::get(Type::getVoidTy(Ctx), {B.getInt8PtrTy()}, false);
|
|
Function *F = cast<Function>(M.getOrInsertFunction("f", FTy));
|
|
|
|
// Create the function as follow and check for dominance relation.
|
|
//
|
|
// test():
|
|
// bbx:
|
|
// loadx;
|
|
// loady;
|
|
// bby:
|
|
// loadz;
|
|
// return;
|
|
//
|
|
// More specifically, check for loadx -> (dominates) loady,
|
|
// loady -> loadx and loady -> loadz.
|
|
//
|
|
// Create BBX with 2 loads.
|
|
BasicBlock *BBX = BasicBlock::Create(Ctx, "bbx", F);
|
|
B.SetInsertPoint(BBX);
|
|
Argument *PointerArg = &*F->arg_begin();
|
|
LoadInst *LoadInstX = B.CreateLoad(PointerArg);
|
|
LoadInst *LoadInstY = B.CreateLoad(PointerArg);
|
|
|
|
// Create BBY with 1 load.
|
|
BasicBlock *BBY = BasicBlock::Create(Ctx, "bby", F);
|
|
B.SetInsertPoint(BBY);
|
|
LoadInst *LoadInstZ = B.CreateLoad(PointerArg);
|
|
B.CreateRet(LoadInstZ);
|
|
std::unique_ptr<DominatorTree> DT(new DominatorTree(*F));
|
|
OrderedInstructions OI(&*DT);
|
|
|
|
// Intra-BB dominance test.
|
|
EXPECT_TRUE(OI.dominates(LoadInstX, LoadInstY));
|
|
EXPECT_FALSE(OI.dominates(LoadInstY, LoadInstX));
|
|
|
|
// Inter-BB dominance test.
|
|
EXPECT_TRUE(OI.dominates(LoadInstY, LoadInstZ));
|
|
}
|