void assembleTree(Assembler a, ETTree t) {
int i;
int bc = getBranchCount(t);
if( bc > 0 ) {
for(i = 0; i < bc; i++ ) {
assembleTree(a, getBranch(t, i));
}
}
assembleElement(a, getElement(t));
}
void SHAMapTreeNode::addRaw (Serializer& s, SHANodeFormat format)
{
assert ((format == snfPREFIX) || (format == snfWIRE) || (format == snfHASH));
if (mType == tnERROR)
throw std::runtime_error ("invalid I node type");
if (format == snfHASH)
{
s.add256 (getNodeHash ());
}
else if (mType == tnINNER)
{
assert (!isEmpty ());
if (format == snfPREFIX)
{
s.add32 (HashPrefix::innerNode);
for (int i = 0; i < 16; ++i)
s.add256 (mHashes[i]);
}
else
{
if (getBranchCount () < 12)
{
// compressed node
for (int i = 0; i < 16; ++i)
if (!isEmptyBranch (i))
{
s.add256 (mHashes[i]);
s.add8 (i);
}
s.add8 (3);
}
else
{
for (int i = 0; i < 16; ++i)
s.add256 (mHashes[i]);
s.add8 (2);
}
}
}
else if (mType == tnACCOUNT_STATE)
{
if (format == snfPREFIX)
{
s.add32 (HashPrefix::leafNode);
s.addRaw (mItem->peekData ());
s.add256 (mItem->getTag ());
}
else
{
s.addRaw (mItem->peekData ());
s.add256 (mItem->getTag ());
s.add8 (1);
}
}
else if (mType == tnTRANSACTION_NM)
{
if (format == snfPREFIX)
{
s.add32 (HashPrefix::transactionID);
s.addRaw (mItem->peekData ());
}
else
{
s.addRaw (mItem->peekData ());
s.add8 (0);
}
}
else if (mType == tnTRANSACTION_MD)
{
if (format == snfPREFIX)
{
s.add32 (HashPrefix::txNode);
s.addRaw (mItem->peekData ());
s.add256 (mItem->getTag ());
}
else
{
s.addRaw (mItem->peekData ());
s.add256 (mItem->getTag ());
s.add8 (4);
}
}
else
assert (false);
}
int32_t MethodProfile::getLoopIterationCount(int branch_pc, int target_pc) {
int loop_count = getBranchCount(branch_pc, target_pc);
AvmAssert(loop_count != 0);
return loop_count;
}
