unified indentation

df_datalink_sp/src/util/circ_queue.c

@@ -28,22 +28,22 @@
 
 inline bool isCircQueueFull(CIRC_QUEUE *queue)
 {
-  ASSERT(queue != NULL);
-  return ((queue)->nelts == (queue)->bounds);
+	ASSERT(queue != NULL);
+	return ((queue)->nelts == (queue)->bounds);
 }
 
 inline bool isCircQueueEmpty(CIRC_QUEUE *queue)
 {
-  ASSERT(queue != NULL);
-  return ((queue)->nelts == 0);
+	ASSERT(queue != NULL);
+	return ((queue)->nelts == 0);
 }
 
 void CircQueueFree(CIRC_QUEUE *queue)
 {
-  ASSERT(queue != NULL);
-  if (queue->data)
-    free(queue->data);
-  free(queue);
+	ASSERT(queue != NULL);
+	if (queue->data)
+		free(queue->data);
+	free(queue);
 }
 
 /**
@@ -51,30 +51,30 @@ void CircQueueFree(CIRC_QUEUE *queue)
  */
 bool CircQueueCreate(CIRC_QUEUE **q, uint32_t queueCapacity)
 {
-  ASSERT(q != NULL);
-  CIRC_QUEUE *queue;
-  queue = malloc(sizeof(CIRC_QUEUE));
-  if (!queue)
-  {
-    return false;
-  }
-  *q = queue;
-  memset(queue, 0, sizeof(CIRC_QUEUE));
+	ASSERT(q != NULL);
+	CIRC_QUEUE *queue;
+	queue = malloc(sizeof(CIRC_QUEUE));
+	if (!queue)
+	{
+		return false;
+	}
+	*q = queue;
+	memset(queue, 0, sizeof(CIRC_QUEUE));
 
-  /* Set all the data in the queue to NULL */
-  queue->data = malloc(queueCapacity * sizeof(void *));
-  if (queue->data == NULL)
-  {
-    goto error;
-  }
-  queue->bounds = queueCapacity;
-  queue->nelts = 0;
-  queue->in = 0;
-  queue->out = 0;
-  return true;
+	/* Set all the data in the queue to NULL */
+	queue->data = malloc(queueCapacity * sizeof(void *));
+	if (queue->data == NULL)
+	{
+		goto error;
+	}
+	queue->bounds = queueCapacity;
+	queue->nelts = 0;
+	queue->in = 0;
+	queue->out = 0;
+	return true;
 error:
-  free(queue);
-  return false;
+	free(queue);
+	return false;
 }
 
 /**
@@ -82,22 +82,22 @@ error:
  */
 bool CircQueuePush(CIRC_QUEUE *queue, void *data)
 {
-  ASSERT(queue != NULL);
+	ASSERT(queue != NULL);
 
-  if (isCircQueueFull(queue))
-  {
-    return false;
-  }
+	if (isCircQueueFull(queue))
+	{
+		return false;
+	}
 
-  queue->data[queue->in] = data;
-  queue->in++;
-  if (queue->in >= queue->bounds)
-  {
-    queue->in -= queue->bounds;
-  }
-  queue->nelts++;
+	queue->data[queue->in] = data;
+	queue->in++;
+	if (queue->in >= queue->bounds)
+	{
+		queue->in -= queue->bounds;
+	}
+	queue->nelts++;
 
-  return true;
+	return true;
 }
 
 /**
@@ -105,7 +105,7 @@ bool CircQueuePush(CIRC_QUEUE *queue, void *data)
  */
 inline uint32_t CircQueueSize(CIRC_QUEUE *queue)
 {
-  return queue->nelts;
+	return queue->nelts;
 }
 
 /**
@@ -113,22 +113,22 @@ inline uint32_t CircQueueSize(CIRC_QUEUE *queue)
  */
 bool CircQueuePop(CIRC_QUEUE *queue, void **data)
 {
-  ASSERT(queue != NULL);
+	ASSERT(queue != NULL);
 
-  if (isCircQueueEmpty(queue))
-  {
-    return false;
-  }
+	if (isCircQueueEmpty(queue))
+	{
+		return false;
+	}
 
-  *data = queue->data[queue->out];
-  queue->nelts--;
+	*data = queue->data[queue->out];
+	queue->nelts--;
 
-  queue->out++;
-  if (queue->out >= queue->bounds)
-  {
-    queue->out -= queue->bounds;
-  }
-  return true;
+	queue->out++;
+	if (queue->out >= queue->bounds)
+	{
+		queue->out -= queue->bounds;
+	}
+	return true;
 }
 /** @} CircularQueue*/
 /** @} Utility*/