Node *insertPass2(int Num, int NumBlanks, int NumFAI)
{
Node** new_nodes = (Node**) malloc (NumFAI*sizeof(Node*));
Node* list_iter = InsertAfter->Next;
for (int i=0; i < NumFAI; i++)
{
new_nodes[i] = createSingleNode(Num + i, NumBlanks);
if (list_iter != NULL)
{
NVM_STR2(new_nodes[i]->Next, list_iter, sizeof(list_iter)*8);
}
else
break;
list_iter = list_iter->Next;
}
NVM_BEGIN_DURABLE();
for (int i=0; i < NumFAI; i++)
{
NVM_STR2(InsertAfter->Next, new_nodes[i], sizeof(InsertAfter->Next)*8);
if (new_nodes[i]->Next != NULL)
InsertAfter = new_nodes[i]->Next;
else
{
InsertAfter = new_nodes[i];
break;
}
}
NVM_END_DURABLE();
return InsertAfter;
}
Node *insertPass1(int Num, int NumBlanks, int NumFAI)
{
Node *node = createSingleNode(Num, NumBlanks);
// In pass 1, the new node is the last node in the list
node->Next = NULL;
NVM_BEGIN_DURABLE();
#ifdef _FORCE_FAIL
if (Num == randval){
// printf ("num exiting is %i\n", Num);
exit(0);
}
#endif
if (!SLL)
{
SLL = node;
InsertAfter = node;
}
else
{
InsertAfter->Next = node;
InsertAfter = node;
}
NVM_END_DURABLE();
return node;
}
Node *insertPass1(int Num, int NumBlanks, int NumFAI) {
Node *node = createSingleNode(Num, NumBlanks);
// In pass 1, the new node is the last node in the list
NVM_STR2(node->Next, NULL, sizeof(node->Next) * 8);
NVM_BEGIN_DURABLE();
if (!SLL) {
NVM_STR2(SLL, node, sizeof(SLL) * 8); // write-once
InsertAfter = node;
} else {
NVM_STR2(InsertAfter->Next, node, sizeof(InsertAfter->Next) * 8);
InsertAfter = node;
}
NVM_END_DURABLE();
return node;
}
Node *insertPass2(int Num, int NumBlanks, int NumFAI)
{
Node** new_nodes = (Node**) malloc (NumFAI*sizeof(Node*));
Node* list_iter = InsertAfter->Next;
for (int i=0; i < NumFAI; i++)
{
#ifdef _FORCE_FAIL
if (Num == randval){
// printf ("num exiting is %i\n", Num);
exit(0);
}
#endif
new_nodes[i] = createSingleNode(Num + i, NumBlanks);
if (list_iter != NULL)
{
new_nodes[i]->Next = list_iter;
}
else
break;
list_iter = list_iter->Next;
}
// Atlas failure-atomic region
NVM_BEGIN_DURABLE();
for (int i=0; i < NumFAI; i++)
{
InsertAfter->Next = new_nodes[i];
if (new_nodes[i]->Next != NULL)
InsertAfter = new_nodes[i]->Next;
else
{
InsertAfter = new_nodes[i];
break;
}
}
NVM_END_DURABLE();
return InsertAfter;
}
