/*
* Discard all data with a uso gte mark
*/
void TupleStreamWrapper::rollbackTo(size_t mark)
{
if (mark > m_uso) {
throwFatalException("Truncating the future.");
}
// back up the universal stream counter
m_uso = mark;
// working from newest to oldest block, throw
// away blocks that are fully after mark; truncate
// the block that contains mark.
if (!(m_currBlock->uso() >= mark)) {
m_currBlock->truncateTo(mark);
}
else {
StreamBlock *sb = NULL;
discardBlock(m_currBlock);
m_currBlock = NULL;
while (m_pendingBlocks.empty() != true) {
sb = m_pendingBlocks.back();
m_pendingBlocks.pop_back();
if (sb->uso() >= mark) {
discardBlock(sb);
}
else {
sb->truncateTo(mark);
m_currBlock = sb;
break;
}
}
}
}
/*
* Discard all data with a uso gte mark
*/
void TupleStreamBase::rollbackTo(size_t mark, size_t)
{
if (mark > m_uso) {
throwFatalException("Truncating the future: mark %jd, current USO %jd.",
(intmax_t)mark, (intmax_t)m_uso);
} else if (mark < m_committedUso) {
throwFatalException("Truncating committed tuple data: mark %jd, committed USO %jd, current USO %jd, open spHandle %jd, committed spHandle %jd.",
(intmax_t)mark, (intmax_t)m_committedUso, (intmax_t)m_uso, (intmax_t)m_openSpHandle, (intmax_t)m_committedSpHandle);
}
// back up the universal stream counter
m_uso = mark;
// working from newest to oldest block, throw
// away blocks that are fully after mark; truncate
// the block that contains mark.
if (m_currBlock != NULL && !(m_currBlock->uso() >= mark)) {
m_currBlock->truncateTo(mark);
}
else {
StreamBlock *sb = NULL;
discardBlock(m_currBlock);
m_currBlock = NULL;
while (m_pendingBlocks.empty() != true) {
sb = m_pendingBlocks.back();
m_pendingBlocks.pop_back();
if (sb->uso() >= mark) {
discardBlock(sb);
}
else {
sb->truncateTo(mark);
m_currBlock = sb;
break;
}
}
if (m_currBlock == NULL) {
extendBufferChain(m_defaultCapacity);
}
}
if (m_uso == m_committedUso) {
m_openSpHandle = m_committedSpHandle;
m_openUniqueId = m_committedUniqueId;
}
}