refactor: string extend method

queue/myqueue.c

@@ -1,141 +1,141 @@
-#include "myqueue.h"
-
-#include <stdlib.h>
-#include <string.h>
-
-mcl_queue_s *mcl_queue_new(size_t queue_size, size_t elem_size) {
-	mcl_queue_s *queue = malloc(sizeof(mcl_queue_s));
-	if (queue == NULL) {
-		return NULL;
-	}
-
-	queue->buffer = malloc(queue_size * elem_size);
-	if (queue->buffer == NULL) {
-		free(queue);
-
-		return NULL;
-	}
-
-	int ret = mtx_init(&queue->lock, mtx_plain);
-	if (ret != thrd_success) {
-		free(queue->buffer);
-		free(queue);
-
-		return NULL;
-	}
-
-	queue->front = 0;
-	queue->rear = 0;
-	queue->size = 0;
-	queue->capacity = queue_size;
-	queue->elem_size = elem_size;
-
-	return queue;
-}
-
-int mcl_queue_push(mcl_queue_s *queue, const void *elem) {
-	int ret = mtx_lock(&queue->lock);
-	if (ret != thrd_success) {
-		return -1;
-	}
-
-	if (queue->size == queue->capacity) {
-		/* Queue full */
-		mtx_unlock(&queue->lock);
-
-		return -1;
-	}
-
-	/* Copy the elem in the buffer */
-	void *dest = (char *)queue->buffer + (queue->rear * queue->elem_size);
-	memcpy(dest, elem, queue->elem_size);
-
-	queue->size++;
-	queue->rear = (queue->rear + 1) % queue->capacity;
-
-	mtx_unlock(&queue->lock);
-
-	return 0;
-}
-
-int mcl_queue_pop(mcl_queue_s *queue, void *out_elem) {
-	int ret = mtx_lock(&queue->lock);
-	if (ret != thrd_success) {
-		return -1;
-	}
-
-	if (queue->size == 0) {
-		/* Queue empty */
-		mtx_unlock(&queue->lock);
-
-		return -1;
-	}
-
-	void *src = (char *)queue->buffer + (queue->front * queue->elem_size);
-	memcpy(out_elem, src, queue->elem_size);
-
-	queue->front = (queue->front + 1) % queue->capacity;
-	queue->size--;
-
-	mtx_unlock(&queue->lock);
-
-	return 0;
-}
-
-int mcl_queue_get_front(mcl_queue_s *queue, void *out) {
-	int ret = mtx_lock(&queue->lock);
-	if (ret != thrd_success) {
-		return -1;
-	}
-
-	if (queue->size == 0) {
-		mtx_unlock(&queue->lock);
-
-		return -1;
-	}
-
-	void *front = (char *)queue->buffer + (queue->front * queue->elem_size);
-	memcpy(out, front, queue->elem_size);
-
-	mtx_unlock(&queue->lock);
-
-	return 0;
-}
-
-int mcl_queue_get_rear(mcl_queue_s *queue, void *out) {
-	int ret = mtx_lock(&queue->lock);
-	if (ret != thrd_success) {
-		return -1;
-	}
-
-	if (queue->size == 0) {
-		mtx_unlock(&queue->lock);
-
-		return -1;
-	}
-
-	size_t rear_index;
-	if (queue->rear == 0) {
-		rear_index = queue->capacity - 1;
-	} else {
-		rear_index = queue->rear - 1;
-	}
-
-	void *rear = (char *)queue->buffer + (rear_index * queue->elem_size);
-	memcpy(out, rear, queue->elem_size);
-
-	mtx_unlock(&queue->lock);
-
-	return 0;
-}
-
-void mcl_queue_free(mcl_queue_s *queue) {
-	if (queue == NULL) {
-		return;
-	}
-
-	mtx_destroy(&queue->lock);
-
-	free(queue->buffer);
-	free(queue);
-}
+#include "myqueue.h"
+
+#include <stdlib.h>
+#include <string.h>
+
+mcl_queue_s *mcl_queue_new(size_t queue_size, size_t elem_size) {
+	mcl_queue_s *queue = malloc(sizeof(mcl_queue_s));
+	if (queue == NULL) {
+		return NULL;
+	}
+
+	queue->buffer = malloc(queue_size * elem_size);
+	if (queue->buffer == NULL) {
+		free(queue);
+
+		return NULL;
+	}
+
+	int ret = mtx_init(&queue->lock, mtx_plain);
+	if (ret != thrd_success) {
+		free(queue->buffer);
+		free(queue);
+
+		return NULL;
+	}
+
+	queue->front = 0;
+	queue->rear = 0;
+	queue->size = 0;
+	queue->capacity = queue_size;
+	queue->elem_size = elem_size;
+
+	return queue;
+}
+
+int mcl_queue_push(mcl_queue_s *queue, const void *elem) {
+	int ret = mtx_lock(&queue->lock);
+	if (ret != thrd_success) {
+		return -1;
+	}
+
+	if (queue->size == queue->capacity) {
+		/* Queue full */
+		mtx_unlock(&queue->lock);
+
+		return -1;
+	}
+
+	/* Copy the elem in the buffer */
+	void *dest = (char *)queue->buffer + (queue->rear * queue->elem_size);
+	memcpy(dest, elem, queue->elem_size);
+
+	queue->size++;
+	queue->rear = (queue->rear + 1) % queue->capacity;
+
+	mtx_unlock(&queue->lock);
+
+	return 0;
+}
+
+int mcl_queue_pop(mcl_queue_s *queue, void *out_elem) {
+	int ret = mtx_lock(&queue->lock);
+	if (ret != thrd_success) {
+		return -1;
+	}
+
+	if (queue->size == 0) {
+		/* Queue empty */
+		mtx_unlock(&queue->lock);
+
+		return -1;
+	}
+
+	void *src = (char *)queue->buffer + (queue->front * queue->elem_size);
+	memcpy(out_elem, src, queue->elem_size);
+
+	queue->front = (queue->front + 1) % queue->capacity;
+	queue->size--;
+
+	mtx_unlock(&queue->lock);
+
+	return 0;
+}
+
+int mcl_queue_get_front(mcl_queue_s *queue, void *out) {
+	int ret = mtx_lock(&queue->lock);
+	if (ret != thrd_success) {
+		return -1;
+	}
+
+	if (queue->size == 0) {
+		mtx_unlock(&queue->lock);
+
+		return -1;
+	}
+
+	void *front = (char *)queue->buffer + (queue->front * queue->elem_size);
+	memcpy(out, front, queue->elem_size);
+
+	mtx_unlock(&queue->lock);
+
+	return 0;
+}
+
+int mcl_queue_get_rear(mcl_queue_s *queue, void *out) {
+	int ret = mtx_lock(&queue->lock);
+	if (ret != thrd_success) {
+		return -1;
+	}
+
+	if (queue->size == 0) {
+		mtx_unlock(&queue->lock);
+
+		return -1;
+	}
+
+	size_t rear_index;
+	if (queue->rear == 0) {
+		rear_index = queue->capacity - 1;
+	} else {
+		rear_index = queue->rear - 1;
+	}
+
+	void *rear = (char *)queue->buffer + (rear_index * queue->elem_size);
+	memcpy(out, rear, queue->elem_size);
+
+	mtx_unlock(&queue->lock);
+
+	return 0;
+}
+
+void mcl_queue_free(mcl_queue_s *queue) {
+	if (queue == NULL) {
+		return;
+	}
+
+	mtx_destroy(&queue->lock);
+
+	free(queue->buffer);
+	free(queue);
+}