Hashset<int64_t> *arbitratorTriedAndFailed = new Hashset<int64_t>();
uint size = pendingTransactionQueue->size();
uint oldindex = 0;
- for (int iter = 0; iter < size; iter++) {
+ for (uint iter = 0; iter < size; iter++) {
Transaction *transaction = pendingTransactionQueue->get(iter);
pendingTransactionQueue->set(oldindex++, pendingTransactionQueue->get(iter));
s->addEntry(rm);
} else {
int64_t prev_seqn = -1;
- int i = 0;
+ uint i = 0;
/* Go through list of missing messages */
for (; i < rejectedSlotVector->size(); i++) {
int64_t curr_seqn = rejectedSlotVector->get(i);
bool hadCommit = (lastRound->getCommit() == NULL);
bool gotNewCommit = false;
- int numberToDelete = 1;
+ uint numberToDelete = 1;
while (numberToDelete < pendingSendArbitrationRounds->size()) {
ArbitrationRound *round = pendingSendArbitrationRounds->get(pendingSendArbitrationRounds->size() - numberToDelete - 1);
if (numberToDelete == pendingSendArbitrationRounds->size()) {
pendingSendArbitrationRounds->clear();
} else {
- for (int i = 0; i < numberToDelete; i++) {
+ for (uint i = 0; i < numberToDelete; i++) {
pendingSendArbitrationRounds->removeIndex(pendingSendArbitrationRounds->size() - 1);
}
}
}
// Go through each new commit one by one
- for (int i = 0; i < commitSequenceNumbers->size(); i++) {
+ for (uint i = 0; i < commitSequenceNumbers->size(); i++) {
int64_t commitSequenceNumber = commitSequenceNumbers->get(i);
Commit *commit = commitForClientTable->get(commitSequenceNumber);
oldestTransactionSequenceNumberSpeculatedOn = transactionSequenceNumbersSorted->get(0);
// Find where to start arbitration from
- int startIndex = 0;
+ uint startIndex = 0;
for (; startIndex < transactionSequenceNumbersSorted->size(); startIndex++)
if (transactionSequenceNumbersSorted->get(startIndex) == lastTransactionSequenceNumberSpeculatedOn)
Hashset<int64_t> *incompleteTransactionArbitrator = new Hashset<int64_t>();
bool didSkip = true;
- for (int i = startIndex; i < transactionSequenceNumbersSorted->size(); i++) {
+ for (uint i = startIndex; i < transactionSequenceNumbersSorted->size(); i++) {
int64_t transactionSequenceNumber = transactionSequenceNumbersSorted->get(i);
Transaction *transaction = liveTransactionBySequenceNumberTable->get(transactionSequenceNumber);
}
// Find where to start arbitration from
- int startIndex = 0;
+ uint startIndex = 0;
for (; startIndex < pendingTransactionQueue->size(); startIndex++)
if (pendingTransactionQueue->get(startIndex) == firstPendingTransaction)
return;
}
- for (int i = startIndex; i < pendingTransactionQueue->size(); i++) {
+ for (uint i = startIndex; i < pendingTransactionQueue->size(); i++) {
Transaction *transaction = pendingTransactionQueue->get(i);
lastPendingTransactionSpeculatedOn = transaction;
* Check if the HMAC chain is not violated
*/
void Table::checkHMACChain(SlotIndexer *indexer, Array<Slot *> *newSlots) {
- for (int i = 0; i < newSlots->length(); i++) {
+ for (uint i = 0; i < newSlots->length(); i++) {
Slot *currSlot = newSlots->get(i);
Slot *prevSlot = indexer->getSlot(currSlot->getSequenceNumber() - 1);
if (prevSlot != NULL &&