From 02edde747c8dc06a6b34829405d5e017c95fdbdf Mon Sep 17 00:00:00 2001
From: Razvan Deaconescu <razvan.deaconescu@upb.ro>
Date: Fri, 24 Nov 2023 16:14:46 +0200
Subject: [PATCH] asg/parallel-graph: Remove unused os_list.c file
The list implementation is now fully contained in os_list.h.
Signed-off-by: Razvan Deaconescu <razvan.deaconescu@upb.ro>
---
src/os_list.c | 59 ---------------------------------------------------
1 file changed, 59 deletions(-)
delete mode 100644 src/os_list.c
diff --git a/src/os_list.c b/src/os_list.c
deleted file mode 100644
index e920bc5..0000000
--- a/src/os_list.c
+++ /dev/null
@@ -1,59 +0,0 @@
-// SPDX-License-Identifier: BSD-3-Clause
-
-#include "os_list.h"
-#include <stdlib.h>
-#include <unistd.h>
-#include <stdio.h>
-
-os_queue_t *queue_create(void)
-{
- os_queue_t *queue;
-
- queue = malloc(sizeof(*queue));
- if (queue == NULL) {
- perror("malloc");
- return NULL;
- }
- pthread_mutex_init(&queue->lock, NULL);
- queue->first = NULL;
- queue->last = NULL;
-
- return queue;
-}
-
-void queue_add(os_queue_t *queue, void *info)
-{
- os_list_node_t *node;
-
- node = malloc(sizeof(*node));
- if (node == NULL) {
- fprintf(stderr, "[ERROR] %s: Not enough memory\n", __func__);
- return;
- }
-
- node->next = NULL;
- node->info = info;
-
- if (queue->last == NULL && queue->first == NULL) {
- queue->first = node;
- queue->last = node;
- } else {
- queue->last->next = node;
- queue->last = node;
- }
-}
-
-os_list_node_t *queue_get(os_queue_t *queue)
-{
- os_list_node_t *target;
-
- if (queue == NULL)
- return NULL;
- if (queue->first == NULL && queue->last == NULL)
- return NULL;
-
- target = queue->first;
- queue->first = queue->first->next;
-
- return target;
-}
--
GitLab