Removed stalling in producers and added assertion that should halt failing producers as a test

src/consumer.c

@@ -1,3 +1,4 @@
+#include <assert.h>
 #include <stdlib.h>
 #include <stdio.h>
 #include <sys/shm.h>
@@ -67,7 +68,7 @@ int GetNextUsedSlot(SharedStruct* sharedMem)
 // Weird semaphore math that cleans up the stuck forks
 void SemaphoreCleanup(SharedStruct* sharedMem)
 {
-    int semMath = 2*(sharedMem->consumerCount) + (sharedMem->producerCount) - 1;
+    int semMath = (sharedMem->consumerCount) + 9;
     int semCheckEmpty;
     sem_getvalue(&sharedMem->empty, &semCheckEmpty);
     if (semCheckEmpty < semMath)
@@ -94,4 +95,4 @@ int remove_item(SharedStruct* sharedMem)
     int item = sharedMem->buffer[slot];
     sharedMem->buffer[slot] = -1;
     return item;
-}
+}

src/producer.c

@@ -1,3 +1,4 @@
+#include <assert.h>
 #include <stdlib.h>
 #include <stdio.h>
 #include <sys/shm.h>
@@ -74,12 +75,7 @@ int produce_item(void)
 void insert_item(int item, SharedStruct* sharedMem)
 {
     int slot = GetNextFreeSlot(sharedMem);
-    while(slot < 0)
-    {
-        sem_post(&sharedMem->mutex);
-        sem_wait(&sharedMem->mutex);
-        slot = GetNextFreeSlot(sharedMem);
-    }
+    assert(slot > -1);
     sharedMem->buffer[slot] = item;
     return;
 }

src/shared.c

@@ -41,7 +41,7 @@ void SharedStructInit(SharedStruct* sharedMem, int producers, int consumers)
     sharedMem->producerCount = producers;
     sharedMem->consumerCount = consumers;
     sem_init(&sharedMem->mutex, 1, 1);
-    sem_init(&sharedMem->empty, 1, producers+consumers);
+    sem_init(&sharedMem->empty, 1, 10);
     sem_init(&sharedMem->full, 1, 0);
 }