Write whole solution to shared memory and -1 if acyclic

This commit is contained in:
zenon 2018-06-07 10:22:30 +02:00
parent db393a0b43
commit 3af17e0d84

View File

@ -170,10 +170,24 @@ void printGraph()
}
}
void putSolution(sem_t sUsedSpace, sem_t sFreeSpace, int *solution)
void putSolution(sem_t sUsedSpace, sem_t sFreeSpace, sem_t sWriteEnd, int *solution)
{
shared->data[shared->tail] = itemValue;
sem_wait(&sWriteEnd);
sem_wait(&sFreeSpace);
if (solution[0] == -1) {
shared->data[shared->tail] = -1;
shared->tail = (shared->tail + 1) % MAX_ITEMS;
}
int i = 0;
while (solution[i] != -1) {
shared->data[shared->tail] = solution[i];
shared->tail = (shared->tail + 1) % MAX_ITEMS;
}
sem_post(&sUsedSpace);
sem_post(&sWriteEnd);
}
void cleanup()