1 files changed, 78 insertions, 78 deletions

diff --git a/src/tiblst.c b/src/tiblst.c
index c908c92..c11ab01 100644
--- a/src/tiblst.c
+++ b/src/tiblst.c
@@ -1,6 +1,6 @@
 /*
  *  libtib - Read, write, and evaluate TI BASIC programs
- *  Copyright (C) 2015-2016 Delwink, LLC
+ *  Copyright (C) 2015-2017 Delwink, LLC
  *
  *  This program is free software: you can redistribute it and/or modify
  *  it under the terms of the GNU Affero General Public License as published by
@@ -21,125 +21,125 @@
 #include "tiblst.h"
 
 struct tib_lst *
-tib_new_lst ()
+tib_new_lst()
 {
-  struct tib_lst *out = malloc (sizeof (struct tib_lst));
-  out->beg = NULL;
-  out->end = NULL;
+	struct tib_lst *out = malloc(sizeof(struct tib_lst));
+	out->beg = NULL;
+	out->end = NULL;
 
-  return out;
+	return out;
 }
 
 static struct tib_el *
-el_ref (const struct tib_lst *lst, int index)
+el_ref(const struct tib_lst *lst, int index)
 {
-  for (struct tib_el *el = lst->beg; el != NULL; el = el->next, --index)
-    if (0 == index)
-      return el;
+	for (struct tib_el *el = lst->beg; el != NULL; el = el->next, --index)
+		if (0 == index)
+			return el;
 
-  return NULL;
+	return NULL;
 }
 
 void
-tib_free_lst (struct tib_lst *lst)
+tib_free_lst(struct tib_lst *lst)
 {
-  while (tib_lst_len (lst))
-    tib_lst_remove (lst, 0);
+	while (tib_lst_len(lst))
+		tib_lst_remove(lst, 0);
 
-  free (lst);
+	free(lst);
 }
 
 int
-tib_lst_insert (struct tib_lst *lst, TIB *t, int index)
+tib_lst_insert(struct tib_lst *lst, TIB *t, int index)
 {
-  int len = tib_lst_len (lst);
+	int len = tib_lst_len(lst);
 
-  if (index > len)
-    return TIB_EINDEX;
+	if (index > len)
+		return TIB_EINDEX;
 
-  struct tib_el *new = malloc (sizeof (struct tib_el));
-  if (NULL == new)
-    return TIB_EALLOC;
+	struct tib_el *new = malloc(sizeof(struct tib_el));
+	if (NULL == new)
+		return TIB_EALLOC;
 
-  tib_incref (t);
-  new->val = t;
+	tib_incref(t);
+	new->val = t;
 
-  if (0 == index)
-    new->prev = NULL;
-  else
-    new->prev = el_ref (lst, index - 1);
+	if (0 == index)
+		new->prev = NULL;
+	else
+		new->prev = el_ref(lst, index - 1);
 
-  if (index == len)
-    new->next = NULL;
-  else
-    new->next = el_ref (lst, index);
+	if (index == len)
+		new->next = NULL;
+	else
+		new->next = el_ref(lst, index);
 
-  if (new->next)
-    new->next->prev = new;
-  else
-    lst->end = new;
+	if (new->next)
+		new->next->prev = new;
+	else
+		lst->end = new;
 
-  if (new->prev)
-    new->prev->next = new;
-  else
-    lst->beg = new;
+	if (new->prev)
+		new->prev->next = new;
+	else
+		lst->beg = new;
 
-  return 0;
+	return 0;
 }
 
 int
-tib_lst_push (struct tib_lst *lst, TIB *t)
+tib_lst_push(struct tib_lst *lst, TIB *t)
 {
-  return tib_lst_insert (lst, t, tib_lst_len (lst));
+	return tib_lst_insert(lst, t, tib_lst_len(lst));
 }
 
 void
-tib_lst_remove (struct tib_lst *lst, int index)
+tib_lst_remove(struct tib_lst *lst, int index)
 {
-  struct tib_el *e = el_ref (lst, index);
-  if (!e)
-    return;
-
-  if (e->next)
-    e->next->prev = e->prev;
-  else
-    lst->end = e->prev;
-
-  if (e->prev)
-    e->prev->next = e->next;
-  else
-    lst->beg = e->next;
-
-  tib_decref (e->val);
-  free (e);
+	struct tib_el *e = el_ref(lst, index);
+	if (!e)
+		return;
+
+	if (e->next)
+		e->next->prev = e->prev;
+	else
+		lst->end = e->prev;
+
+	if (e->prev)
+		e->prev->next = e->next;
+	else
+		lst->beg = e->next;
+
+	tib_decref(e->val);
+	free(e);
 }
 
 int
-tib_lst_len (const struct tib_lst *lst)
+tib_lst_len(const struct tib_lst *lst)
 {
-  int i = 0;
-  struct tib_el *e = lst->beg;
+	int i = 0;
+	struct tib_el *e = lst->beg;
 
-  while (e != NULL)
-    {
-      ++i;
-      e = e->next;
-    }
+	while (e != NULL)
+	{
+		++i;
+		e = e->next;
+	}
 
-  return i;
+	return i;
 }
 
 TIB *
-tib_lst_ref (const struct tib_lst *lst, int index)
+tib_lst_ref(const struct tib_lst *lst, int index)
 {
-  struct tib_el *i;
-  int looped = 0;
+	struct tib_el *i;
+	int looped = 0;
 
-  for (i = lst->beg; i != NULL; i = i->next)
-    {
-      if (looped++ == index)
-        return i->val;
-    }
+	for (i = lst->beg; i != NULL; i = i->next)
+	{
+		if (looped++ == index)
+			return i->val;
+	}
 
-  return NULL;
+	return NULL;
 }