summaryrefslogtreecommitdiff
path: root/gnu/usr.bin/gcc/bi-reverse.c
diff options
context:
space:
mode:
authorNiklas Hallqvist <niklas@cvs.openbsd.org>1995-12-20 01:06:22 +0000
committerNiklas Hallqvist <niklas@cvs.openbsd.org>1995-12-20 01:06:22 +0000
commitc482518380683ee38d14024c1e362a0d681cf967 (patch)
treee69b4f6d3fee3aced20a41f3fdf543fc1c77fb5d /gnu/usr.bin/gcc/bi-reverse.c
parent76a62188d0db49c65b696d474c855a799fd96dce (diff)
FSF GCC version 2.7.2
Diffstat (limited to 'gnu/usr.bin/gcc/bi-reverse.c')
-rw-r--r--gnu/usr.bin/gcc/bi-reverse.c61
1 files changed, 61 insertions, 0 deletions
diff --git a/gnu/usr.bin/gcc/bi-reverse.c b/gnu/usr.bin/gcc/bi-reverse.c
new file mode 100644
index 00000000000..6a84f827e73
--- /dev/null
+++ b/gnu/usr.bin/gcc/bi-reverse.c
@@ -0,0 +1,61 @@
+/* Reverse order of definitions obtained from bytecode definition file.
+ Copyright (C) 1993 Free Software Foundation, Inc.
+
+This file is part of GNU CC.
+
+GNU CC is free software; you can redistribute it and/or modify
+it under the terms of the GNU General Public License as published by
+the Free Software Foundation; either version 2, or (at your option)
+any later version.
+
+GNU CC is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with GNU CC; see the file COPYING. If not, write to
+the Free Software Foundation, 59 Temple Place - Suite 330,
+Boston, MA 02111-1307, USA. */
+
+
+#include "hconfig.h"
+#include "bi-defs.h"
+
+void
+reverse()
+{
+ struct def *dp, *d, *dn;
+ struct variation *vp, *v, *vn;
+
+ dp = defs;
+ if (dp)
+ {
+ vp = dp->variations;
+ if (vp)
+ {
+ for (v = vp->next, vp->next = 0; v; vp = v, v = vn)
+ {
+ vn = v->next;
+ v->next = vp;
+ }
+ dp->variations = vp;
+ }
+ for (d = dp->next, dp->next = 0; d; dp = d, d = dn)
+ {
+ vp = d->variations;
+ if (vp)
+ {
+ for (v = vp->next, vp->next = 0; v; vp = v, v = vn)
+ {
+ vn = v->next;
+ v->next = vp;
+ }
+ d->variations = vp;
+ }
+ dn = d->next;
+ d->next = dp;
+ }
+ defs = dp;
+ }
+}