From ea3e5e56fdc56e5c2ddafb36eab26676e137dfa0 Mon Sep 17 00:00:00 2001
From: Jeff Cohen <jeffc@jolt-lang.org>
Date: Fri, 22 Apr 2005 04:13:13 +0000
Subject: Eliminate tabs and trailing spaces

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21441 91177308-0d34-0410-b5e6-96231b3b80d8
---
 utils/Burg/item.c | 158 +++++++++++++++++++++++++++---------------------------
 1 file changed, 79 insertions(+), 79 deletions(-)

(limited to 'utils/Burg/item.c')

diff --git a/utils/Burg/item.c b/utils/Burg/item.c
index 4a9f4a3..85750f8 100644
--- a/utils/Burg/item.c
+++ b/utils/Burg/item.c
@@ -10,124 +10,124 @@ static Item_Set fptr;
 ItemArray
 newItemArray()
 {
-	ItemArray ia;
-	ia = (ItemArray) zalloc(max_nonterminal *sizeof(*ia));
-	return ia;
+  ItemArray ia;
+  ia = (ItemArray) zalloc(max_nonterminal *sizeof(*ia));
+  return ia;
 }
 
 ItemArray
 itemArrayCopy(src) ItemArray src;
 {
-	ItemArray dst;
+  ItemArray dst;
 
-	dst = newItemArray();
-	memcpy(dst, src, max_nonterminal * sizeof(*dst));
-	return dst;
+  dst = newItemArray();
+  memcpy(dst, src, max_nonterminal * sizeof(*dst));
+  return dst;
 }
 
 Item_Set
 newItem_Set(relevant) Relevant relevant;
 {
-	Item_Set ts;
-	
-	if (fptr) {
-		ts = fptr;
-		fptr = 0;
-		memset(ts->virgin, 0, max_nonterminal * sizeof(struct item));
-		if (ts->closed) {
-			zfree(ts->closed);
-			ts->closed = 0;
-		}
-		ts->num = 0;
-		ts->op = 0;
-	} else {
-		ts = (Item_Set) zalloc(sizeof(struct item_set));
-		ts->virgin = newItemArray();
-	}
-	ts->relevant = relevant;
-	return ts;
+  Item_Set ts;
+
+  if (fptr) {
+    ts = fptr;
+    fptr = 0;
+    memset(ts->virgin, 0, max_nonterminal * sizeof(struct item));
+    if (ts->closed) {
+      zfree(ts->closed);
+      ts->closed = 0;
+    }
+    ts->num = 0;
+    ts->op = 0;
+  } else {
+    ts = (Item_Set) zalloc(sizeof(struct item_set));
+    ts->virgin = newItemArray();
+  }
+  ts->relevant = relevant;
+  return ts;
 }
 
 void
 freeItem_Set(ts) Item_Set ts;
 {
-	assert(!fptr);
-	fptr = ts;
+  assert(!fptr);
+  fptr = ts;
 }
 
 int
 equivSet(a, b) Item_Set a; Item_Set b;
 {
-	register Relevant r;
-	register int nt;
-	register Item *aa = a->virgin;
-	register Item *ba = b->virgin;
-
-	/*
-	return !bcmp(a->virgin, b->virgin, max_nonterminal * sizeof(Item));
-	*/
-
-	r = a->relevant ? a->relevant : b->relevant;
-	assert(r);
-
-	if (a->op && b->op && a->op != b->op) {
-		return 0;
-	}
-	for (; (nt = *r) != 0; r++) {
-		if (aa[nt].rule != ba[nt].rule || !EQUALCOST(aa[nt].delta, ba[nt].delta)) {
-			return 0;
-		}
-	}
-	return 1;
+  register Relevant r;
+  register int nt;
+  register Item *aa = a->virgin;
+  register Item *ba = b->virgin;
+
+  /*
+  return !bcmp(a->virgin, b->virgin, max_nonterminal * sizeof(Item));
+  */
+
+  r = a->relevant ? a->relevant : b->relevant;
+  assert(r);
+
+  if (a->op && b->op && a->op != b->op) {
+    return 0;
+  }
+  for (; (nt = *r) != 0; r++) {
+    if (aa[nt].rule != ba[nt].rule || !EQUALCOST(aa[nt].delta, ba[nt].delta)) {
+      return 0;
+    }
+  }
+  return 1;
 }
 
 void
 printRepresentative(f, s) FILE *f; Item_Set s;
 {
-	if (!s) {
-		return;
-	}
-	fprintf(f, "%s", s->op->name);
-	switch (s->op->arity) {
-	case 1:
-		fprintf(f, "(");
-		printRepresentative(f, s->kids[0]);
-		fprintf(f, ")");
-		break;
-	case 2:
-		fprintf(f, "(");
-		printRepresentative(f, s->kids[0]);
-		fprintf(f, ", ");
-		printRepresentative(f, s->kids[1]);
-		fprintf(f, ")");
-		break;
-	}
+  if (!s) {
+    return;
+  }
+  fprintf(f, "%s", s->op->name);
+  switch (s->op->arity) {
+  case 1:
+    fprintf(f, "(");
+    printRepresentative(f, s->kids[0]);
+    fprintf(f, ")");
+    break;
+  case 2:
+    fprintf(f, "(");
+    printRepresentative(f, s->kids[0]);
+    fprintf(f, ", ");
+    printRepresentative(f, s->kids[1]);
+    fprintf(f, ")");
+    break;
+  }
 }
 
 void
 dumpItem(t) Item *t;
 {
-	printf("[%s #%d]", t->rule->lhs->name, t->rule->num);
-	dumpCost(t->delta);
+  printf("[%s #%d]", t->rule->lhs->name, t->rule->num);
+  dumpCost(t->delta);
 }
 
 void
 dumpItem_Set(ts) Item_Set ts;
 {
-	int i;
-
-	printf("Item_Set #%d: [", ts->num);
-	for (i = 1; i < max_nonterminal; i++) {
-		if (ts->virgin[i].rule) {
-			printf(" %d", i);
-			dumpCost(ts->virgin[i].delta);
-		}
-	}
-	printf(" ]\n");
+  int i;
+
+  printf("Item_Set #%d: [", ts->num);
+  for (i = 1; i < max_nonterminal; i++) {
+    if (ts->virgin[i].rule) {
+      printf(" %d", i);
+      dumpCost(ts->virgin[i].delta);
+    }
+  }
+  printf(" ]\n");
 }
 
 void
 dumpCost(dc) DeltaCost dc;
 {
-	printf("(%ld)", (long) dc);
+  printf("(%ld)", (long) dc);
 }
-- 
cgit v1.1