nstool/lib/libnx/source/InteruptHandler.cpp

125 lines
2.9 KiB
C++
Raw Normal View History

#include <nx/InteruptHandler.h>
nx::InteruptHandler::InteruptHandler() :
mIsSet(false),
mInterupts()
{}
bool nx::InteruptHandler::operator==(const InteruptHandler & other) const
{
return isEqual(other);
}
bool nx::InteruptHandler::operator!=(const InteruptHandler & other) const
{
return !isEqual(other);
}
void nx::InteruptHandler::operator=(const InteruptHandler & other)
{
copyFrom(other);
}
void nx::InteruptHandler::importKernelCapabilityList(const fnd::List<KernelCapability>& caps)
{
if (caps.getSize() == 0)
return;
// convert to interupts
fnd::List<InteruptEntry> interupts;
for (size_t i = 0; i < caps.getSize(); i++)
{
interupts[i].setKernelCapability(caps[i]);
}
mInterupts.clear();
for (size_t i = 0; i < interupts.getSize(); i++)
{
// weird condition for first interupt
if (interupts[i][1] == 0 && i == 0)
{
mInterupts.addElement(interupts[i][0]);
continue;
}
// we found a stub
if (interupts[i][1] == InteruptEntry::kInteruptMax && interupts[i][1] == InteruptEntry::kInteruptMax)
{
continue;
}
// add interupts
mInterupts.hasElement(interupts[i][0]) == false ? mInterupts.addElement(interupts[i][0]) : throw fnd::Exception(kModuleName, "Interupt already added");
mInterupts.hasElement(interupts[i][1]) == false ? mInterupts.addElement(interupts[i][1]) : throw fnd::Exception(kModuleName, "Interupt already added");
}
mIsSet = true;
}
void nx::InteruptHandler::exportKernelCapabilityList(fnd::List<KernelCapability>& caps) const
{
if (isSet() == false)
return;
size_t i = 0;
if (mInterupts.getSize() % 2)
{
caps.addElement(InteruptEntry(mInterupts[i], 0).getKernelCapability());
i++;
}
for (; i < mInterupts.getSize(); i += 2)
{
if (mInterupts[i] == InteruptEntry::kInteruptMax)
{
caps.addElement(InteruptEntry(InteruptEntry::kInteruptMax, InteruptEntry::kInteruptMax).getKernelCapability());
}
caps.addElement(InteruptEntry(mInterupts[i], mInterupts[i+1]).getKernelCapability());
if (mInterupts[i+1] == InteruptEntry::kInteruptMax)
{
caps.addElement(InteruptEntry(InteruptEntry::kInteruptMax, InteruptEntry::kInteruptMax).getKernelCapability());
}
}
}
void nx::InteruptHandler::clear()
{
mIsSet = false;
mInterupts.clear();
}
bool nx::InteruptHandler::isSet() const
{
return mIsSet;
}
2018-03-22 05:26:22 +00:00
const fnd::List<uint16_t>& nx::InteruptHandler::getInteruptList() const
{
return mInterupts;
}
2018-03-22 05:26:22 +00:00
void nx::InteruptHandler::setInteruptList(const fnd::List<uint16_t>& interupts)
{
mInterupts.clear();
for (size_t i = 0; i < interupts.getSize(); i++)
{
mInterupts.hasElement(interupts[i]) == false ? mInterupts.addElement(interupts[i]) : throw fnd::Exception(kModuleName, "Interupt already added");
}
mIsSet = true;
}
void nx::InteruptHandler::copyFrom(const InteruptHandler & other)
{
mIsSet = other.mIsSet;
mInterupts = other.mInterupts;
}
bool nx::InteruptHandler::isEqual(const InteruptHandler & other) const
{
return (mIsSet == other.mIsSet) \
&& (mInterupts == other.mInterupts);
}