From bc5ecd6da7f068a12b9ee5397178723481c7a3ea Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Andreas=20Lindh=C3=A9?= <andreas@lindhe.io>
Date: Tue, 31 Oct 2017 08:33:46 +0100
Subject: Move all files one level down

---
 broccoli/src/fifoqueue.c | 132 -----------------------------------------------
 1 file changed, 132 deletions(-)
 delete mode 100644 broccoli/src/fifoqueue.c

(limited to 'broccoli/src/fifoqueue.c')

diff --git a/broccoli/src/fifoqueue.c b/broccoli/src/fifoqueue.c
deleted file mode 100644
index e7ed8f6..0000000
--- a/broccoli/src/fifoqueue.c
+++ /dev/null
@@ -1,132 +0,0 @@
-#include <pthread.h>
-#include <stdlib.h>
-#include <stdio.h>
-#include <semaphore.h>
-#include "types.h"
-#include "fifoqueue.h"
-
-    Fifo_q * 
-init_queue(int size)
-{
-    Fifo_q * q = (Fifo_q *) malloc(sizeof(Fifo_q));
-    q->head = NULL;
-    q->tail = NULL;
-    q->maxSize = size;
-    q->currentSize = 0;
-    q->droppedValues = 0;
-    q->largestBufferSize = 0;
-    q->valuesReceived = 0;
-    q->valuesReleased = 0;
-    /*Queue empty from the beginning (block)*/
-    sem_init(&q->bufferEmptyBlock, 0, 0);
-    sem_init(&q->bufferFullBlock, 0, size);
-    sem_init(&q->lock, 0, 1);
-    return q;
-}
-
-    boolean
-is_full(Fifo_q * q)
-{
-    if(q->currentSize < q->maxSize)
-        return false;
-    else
-        return true;
-}  
-
-    boolean
-is_empty(Fifo_q * q)
-{
-    if(q->head==NULL)
-        return true;
-    else
-        return false; 
-}
-
-    int
-add_to_queue(Fifo_q * q, Sensor_t * sensor)
-{
-
-    if(q == NULL){
-        printf("Error: Queue not initialized\n");
-        free(sensor); //free if not appended
-        return -1;    
-    } 
-    /* Drop Least Recently or Drop Most Recently */
-    #ifdef DLR
-    if(is_full(q)){
-        pop_from_queue(q);
-        q->droppedValues++;
-        return 0;
-    }
-    #else
-    sem_wait(&q->bufferFullBlock);
-    #endif
-    sem_wait(&q->lock);
-    Queue_t * new_elem = (Queue_t *) malloc(sizeof(Queue_t));
-    new_elem->next = NULL;
-    new_elem->sensor = sensor;
-    if(is_empty(q)){
-        q->head = new_elem;
-    }else
-        q->tail->next = new_elem;
-    q->tail = new_elem;
-    q->currentSize++;
-    q->valuesReceived++;
-    if(q->currentSize > q->largestBufferSize)
-        q->largestBufferSize = q->currentSize;
-    sem_post(&q->lock);
-    sem_post(&q->bufferEmptyBlock);
-    return 1;
-}
-
-    Sensor_t *
-pop_from_queue(Fifo_q * q)
-{
-    int semStat;
-    sem_wait(&q->bufferEmptyBlock);
-    sem_wait(&q->lock);
-    Queue_t * head = q->head;
-    Sensor_t * sensor = head->sensor;
-    /* If dequeue the last element */
-    if(q->currentSize == 1){
-        q->head = NULL;
-        q->tail = NULL;
-    }else{
-        q->head = head->next;
-    }
-    free(head);
-    q->currentSize--;
-    q->valuesReleased++;
-    sem_post(&q->lock);
-    #ifndef DLR
-    sem_post(&q->bufferFullBlock);
-    #endif
-    return sensor;
-} 
-
-    Sensor_t *
-create_sensor_object(int value, int uid)
-{
-    Sensor_t * sensor = (Sensor_t *) malloc(sizeof(Sensor_t));
-    sensor->value = value;
-    sensor->uid = uid;
-    return sensor;
-}
-    void
-print_queue(Fifo_q * q)
-{
-    sem_wait(&q->lock);
-    Queue_t * current = q->head;
-    printf("\nContent of the queue with size=%d\n",q->currentSize);
-    if(current == NULL){
-        printf("The queue is empty!\n");
-        sem_post(&q->lock);
-        return;
-    }
-    while(current != NULL){
-        printf("sensor value=%d, sensor uid=%d\n",
-                current->sensor->value, current->sensor->uid);
-        current = current->next;
-    }
-    sem_post(&q->lock);
-}
-- 
cgit v1.2.1