1 files changed, 44 insertions, 42 deletions

diff --git a/src/stack.h b/src/stack.h
index 01f69de6..053255d3 100644
--- a/src/stack.h
+++ b/src/stack.h
@@ -28,9 +28,9 @@
 
 /** A dynamic stack in memory. */
 typedef struct {
-	uint8_t* buf;       ///< Stack memory
-	size_t   buf_size;  ///< Allocated size of buf (>= size)
-	size_t   size;      ///< Conceptual size of stack in buf
+  uint8_t* buf;      ///< Stack memory
+  size_t   buf_size; ///< Allocated size of buf (>= size)
+  size_t   size;     ///< Conceptual size of stack in buf
 } SerdStack;
 
 /** An offset to start the stack at. Note 0 is reserved for NULL. */
@@ -39,79 +39,81 @@ typedef struct {
 static inline SerdStack
 serd_stack_new(size_t size)
 {
-	SerdStack stack;
-	stack.buf       = (uint8_t*)calloc(size, 1);
-	stack.buf_size  = size;
-	stack.size      = SERD_STACK_BOTTOM;
-	return stack;
+  SerdStack stack;
+  stack.buf      = (uint8_t*)calloc(size, 1);
+  stack.buf_size = size;
+  stack.size     = SERD_STACK_BOTTOM;
+  return stack;
 }
 
 static inline bool
 serd_stack_is_empty(SerdStack* stack)
 {
-	return stack->size <= SERD_STACK_BOTTOM;
+  return stack->size <= SERD_STACK_BOTTOM;
 }
 
 static inline void
 serd_stack_free(SerdStack* stack)
 {
-	free(stack->buf);
-	stack->buf      = NULL;
-	stack->buf_size = 0;
-	stack->size     = 0;
+  free(stack->buf);
+  stack->buf      = NULL;
+  stack->buf_size = 0;
+  stack->size     = 0;
 }
 
 static inline void*
 serd_stack_push(SerdStack* stack, size_t n_bytes)
 {
-	const size_t new_size = stack->size + n_bytes;
-	if (stack->buf_size < new_size) {
-		stack->buf_size += (stack->buf_size >> 1); // *= 1.5
-		stack->buf = (uint8_t*)realloc(stack->buf, stack->buf_size);
-	}
-	uint8_t* const ret = (stack->buf + stack->size);
-	stack->size = new_size;
-	return ret;
+  const size_t new_size = stack->size + n_bytes;
+  if (stack->buf_size < new_size) {
+    stack->buf_size += (stack->buf_size >> 1); // *= 1.5
+    stack->buf = (uint8_t*)realloc(stack->buf, stack->buf_size);
+  }
+
+  uint8_t* const ret = (stack->buf + stack->size);
+
+  stack->size = new_size;
+  return ret;
 }
 
 static inline void
 serd_stack_pop(SerdStack* stack, size_t n_bytes)
 {
-	assert(stack->size >= n_bytes);
-	stack->size -= n_bytes;
+  assert(stack->size >= n_bytes);
+  stack->size -= n_bytes;
 }
 
 static inline void*
 serd_stack_push_aligned(SerdStack* stack, size_t n_bytes, size_t align)
 {
-	// Push one byte to ensure space for a pad count
-	serd_stack_push(stack, 1);
+  // Push one byte to ensure space for a pad count
+  serd_stack_push(stack, 1);
 
-	// Push padding if necessary
-	const size_t pad = align - stack->size % align;
-	if (pad > 0) {
-		serd_stack_push(stack, pad);
-	}
+  // Push padding if necessary
+  const size_t pad = align - stack->size % align;
+  if (pad > 0) {
+    serd_stack_push(stack, pad);
+  }
 
-	// Set top of stack to pad count so we can properly pop later
-	assert(pad < UINT8_MAX);
-	stack->buf[stack->size - 1] = (uint8_t)pad;
+  // Set top of stack to pad count so we can properly pop later
+  assert(pad < UINT8_MAX);
+  stack->buf[stack->size - 1] = (uint8_t)pad;
 
-	// Push requested space at aligned location
-	return serd_stack_push(stack, n_bytes);
+  // Push requested space at aligned location
+  return serd_stack_push(stack, n_bytes);
 }
 
 static inline void
 serd_stack_pop_aligned(SerdStack* stack, size_t n_bytes)
 {
-	// Pop requested space down to aligned location
-	serd_stack_pop(stack, n_bytes);
+  // Pop requested space down to aligned location
+  serd_stack_pop(stack, n_bytes);
 
-	// Get amount of padding from top of stack
-	const uint8_t pad = stack->buf[stack->size - 1];
+  // Get amount of padding from top of stack
+  const uint8_t pad = stack->buf[stack->size - 1];
 
-	// Pop padding and pad count
-	serd_stack_pop(stack, pad + 1u);
+  // Pop padding and pad count
+  serd_stack_pop(stack, pad + 1u);
 }
 
-#endif  // SERD_STACK_H
+#endif // SERD_STACK_H