mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-10-31 09:11:13 +00:00
fe8041ae39
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3065 91177308-0d34-0410-b5e6-96231b3b80d8
151 lines
5.2 KiB
C++
151 lines
5.2 KiB
C++
//===-- iMemory.cpp - Implement Memory instructions --------------*- C++ -*--=//
|
|
//
|
|
// This file implements the various memory related classes defined in iMemory.h
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/iMemory.h"
|
|
#include "llvm/Constants.h"
|
|
#include "llvm/DerivedTypes.h"
|
|
|
|
static inline const Type *checkType(const Type *Ty) {
|
|
assert(Ty && "Invalid indices for type!");
|
|
return Ty;
|
|
}
|
|
|
|
AllocationInst::AllocationInst(const Type *Ty, Value *ArraySize, unsigned iTy,
|
|
const std::string &Name)
|
|
: Instruction(Ty, iTy, Name) {
|
|
assert(isa<PointerType>(Ty) && "Can't allocate a non pointer type!");
|
|
|
|
// ArraySize defaults to 1.
|
|
if (!ArraySize) ArraySize = ConstantUInt::get(Type::UIntTy, 1);
|
|
|
|
Operands.reserve(1);
|
|
assert(ArraySize->getType() == Type::UIntTy &&
|
|
"Malloc/Allocation array size != UIntTy!");
|
|
|
|
Operands.push_back(Use(ArraySize, this));
|
|
}
|
|
|
|
bool AllocationInst::isArrayAllocation() const {
|
|
return getNumOperands() == 1 &&
|
|
getOperand(0) != ConstantUInt::get(Type::UIntTy, 1);
|
|
}
|
|
|
|
const Type *AllocationInst::getAllocatedType() const {
|
|
return getType()->getElementType();
|
|
}
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// MemAccessInst Implementation
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// getIndexedType - Returns the type of the element that would be loaded with
|
|
// a load instruction with the specified parameters.
|
|
//
|
|
// A null type is returned if the indices are invalid for the specified
|
|
// pointer type.
|
|
//
|
|
const Type* MemAccessInst::getIndexedType(const Type *Ptr,
|
|
const std::vector<Value*> &Idx,
|
|
bool AllowCompositeLeaf) {
|
|
if (!isa<PointerType>(Ptr)) return 0; // Type isn't a pointer type!
|
|
|
|
// Handle the special case of the empty set index set...
|
|
if (Idx.empty()) return cast<PointerType>(Ptr)->getElementType();
|
|
|
|
unsigned CurIDX = 0;
|
|
while (const CompositeType *CT = dyn_cast<CompositeType>(Ptr)) {
|
|
if (Idx.size() == CurIDX) {
|
|
if (AllowCompositeLeaf || CT->isFirstClassType()) return Ptr;
|
|
return 0; // Can't load a whole structure or array!?!?
|
|
}
|
|
|
|
Value *Index = Idx[CurIDX++];
|
|
if (!CT->indexValid(Index)) return 0;
|
|
Ptr = CT->getTypeAtIndex(Index);
|
|
}
|
|
return CurIDX == Idx.size() ? Ptr : 0;
|
|
}
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// LoadInst Implementation
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
LoadInst::LoadInst(Value *Ptr, const std::vector<Value*> &Idx,
|
|
const std::string &Name)
|
|
: MemAccessInst(checkType(getIndexedType(Ptr->getType(), Idx)), Load, Name) {
|
|
assert(getIndexedType(Ptr->getType(), Idx) && "Load operands invalid!");
|
|
Operands.reserve(1+Idx.size());
|
|
Operands.push_back(Use(Ptr, this));
|
|
|
|
for (unsigned i = 0, E = Idx.size(); i != E; ++i)
|
|
Operands.push_back(Use(Idx[i], this));
|
|
|
|
}
|
|
|
|
LoadInst::LoadInst(Value *Ptr, const std::string &Name)
|
|
: MemAccessInst(cast<PointerType>(Ptr->getType())->getElementType(),
|
|
Load, Name) {
|
|
Operands.reserve(1);
|
|
Operands.push_back(Use(Ptr, this));
|
|
}
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// StoreInst Implementation
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
StoreInst::StoreInst(Value *Val, Value *Ptr, const std::vector<Value*> &Idx)
|
|
: MemAccessInst(Type::VoidTy, Store, "") {
|
|
assert(getIndexedType(Ptr->getType(), Idx) && "Store operands invalid!");
|
|
|
|
Operands.reserve(2+Idx.size());
|
|
Operands.push_back(Use(Val, this));
|
|
Operands.push_back(Use(Ptr, this));
|
|
|
|
for (unsigned i = 0, E = Idx.size(); i != E; ++i)
|
|
Operands.push_back(Use(Idx[i], this));
|
|
}
|
|
|
|
StoreInst::StoreInst(Value *Val, Value *Ptr)
|
|
: MemAccessInst(Type::VoidTy, Store, "") {
|
|
|
|
Operands.reserve(2);
|
|
Operands.push_back(Use(Val, this));
|
|
Operands.push_back(Use(Ptr, this));
|
|
}
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// GetElementPtrInst Implementation
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
GetElementPtrInst::GetElementPtrInst(Value *Ptr, const std::vector<Value*> &Idx,
|
|
const std::string &Name)
|
|
: MemAccessInst(PointerType::get(checkType(getIndexedType(Ptr->getType(),
|
|
Idx, true))),
|
|
GetElementPtr, Name) {
|
|
assert(getIndexedType(Ptr->getType(), Idx, true) && "gep operands invalid!");
|
|
Operands.reserve(1+Idx.size());
|
|
Operands.push_back(Use(Ptr, this));
|
|
|
|
for (unsigned i = 0, E = Idx.size(); i != E; ++i)
|
|
Operands.push_back(Use(Idx[i], this));
|
|
}
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// FreeInst Implementation
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
FreeInst::FreeInst(Value *Ptr) : Instruction(Type::VoidTy, Free, "") {
|
|
assert(isa<PointerType>(Ptr->getType()) && "Can't free nonpointer!");
|
|
Operands.reserve(1);
|
|
Operands.push_back(Use(Ptr, this));
|
|
}
|
|
|