mirror of
https://github.com/jakcron/nstool.git
synced 2024-12-23 19:25:28 +00:00
112 lines
2.8 KiB
C++
112 lines
2.8 KiB
C++
#include <nn/hac/InteruptHandler.h>
|
|
|
|
nn::hac::InteruptHandler::InteruptHandler() :
|
|
mIsSet(false),
|
|
mInterupts()
|
|
{}
|
|
|
|
void nn::hac::InteruptHandler::operator=(const InteruptHandler & other)
|
|
{
|
|
mIsSet = other.mIsSet;
|
|
mInterupts = other.mInterupts;
|
|
}
|
|
|
|
bool nn::hac::InteruptHandler::operator==(const InteruptHandler & other) const
|
|
{
|
|
return (mIsSet == other.mIsSet) \
|
|
&& (mInterupts == other.mInterupts);
|
|
}
|
|
|
|
bool nn::hac::InteruptHandler::operator!=(const InteruptHandler & other) const
|
|
{
|
|
return !(*this == other);
|
|
}
|
|
|
|
void nn::hac::InteruptHandler::importKernelCapabilityList(const fnd::List<KernelCapabilityEntry>& caps)
|
|
{
|
|
if (caps.size() == 0)
|
|
return;
|
|
|
|
// convert to interupts
|
|
fnd::List<InteruptEntry> interupts;
|
|
for (size_t i = 0; i < caps.size(); i++)
|
|
{
|
|
interupts[i].setKernelCapability(caps[i]);
|
|
}
|
|
|
|
mInterupts.clear();
|
|
for (size_t i = 0; i < interupts.size(); 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 nn::hac::InteruptHandler::exportKernelCapabilityList(fnd::List<KernelCapabilityEntry>& caps) const
|
|
{
|
|
if (isSet() == false)
|
|
return;
|
|
|
|
size_t i = 0;
|
|
if (mInterupts.size() % 2)
|
|
{
|
|
caps.addElement(InteruptEntry(mInterupts[i], 0).getKernelCapability());
|
|
i++;
|
|
}
|
|
for (; i < mInterupts.size(); 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 nn::hac::InteruptHandler::clear()
|
|
{
|
|
mIsSet = false;
|
|
mInterupts.clear();
|
|
}
|
|
|
|
bool nn::hac::InteruptHandler::isSet() const
|
|
{
|
|
return mIsSet;
|
|
}
|
|
|
|
const fnd::List<uint16_t>& nn::hac::InteruptHandler::getInteruptList() const
|
|
{
|
|
return mInterupts;
|
|
}
|
|
|
|
void nn::hac::InteruptHandler::setInteruptList(const fnd::List<uint16_t>& interupts)
|
|
{
|
|
mInterupts.clear();
|
|
for (size_t i = 0; i < interupts.size(); i++)
|
|
{
|
|
mInterupts.hasElement(interupts[i]) == false ? mInterupts.addElement(interupts[i]) : throw fnd::Exception(kModuleName, "Interupt already added");
|
|
}
|
|
|
|
mIsSet = true;
|
|
} |