summaryrefslogtreecommitdiff
path: root/test/spass/stack.h
diff options
context:
space:
mode:
authorGravatar xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e>2010-03-03 12:34:43 +0000
committerGravatar xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e>2010-03-03 12:34:43 +0000
commit6c196ec8a41d6ed506c133c8b33dba9684f9a7a6 (patch)
tree4e1422ea2a810520d0d9b0fbb78c0014ba9f8443 /test/spass/stack.h
parent93d89c2b5e8497365be152fb53cb6cd4c5764d34 (diff)
Updated raytracer test. Added SPASS test.
git-svn-id: https://yquem.inria.fr/compcert/svn/compcert/trunk@1271 fca1b0fc-160b-0410-b1d3-a4f43f01ea2e
Diffstat (limited to 'test/spass/stack.h')
-rw-r--r--test/spass/stack.h155
1 files changed, 155 insertions, 0 deletions
diff --git a/test/spass/stack.h b/test/spass/stack.h
new file mode 100644
index 0000000..4572b34
--- /dev/null
+++ b/test/spass/stack.h
@@ -0,0 +1,155 @@
+/**************************************************************/
+/* ********************************************************** */
+/* * * */
+/* * GLOBAL SYSTEM STACK * */
+/* * * */
+/* * $Module: STACK * */
+/* * * */
+/* * Copyright (C) 1996, 1998, 1999, 2001 * */
+/* * MPI fuer Informatik * */
+/* * * */
+/* * This program 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 of the License, * */
+/* * or (at your option) any later version. * */
+/* * * */
+/* * This program 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 this program; if not, write * */
+/* * to the Free Software Foundation, Inc., 59 Temple * */
+/* * Place, Suite 330, Boston, MA 02111-1307 USA * */
+/* * * */
+/* * * */
+/* $Revision: 21527 $ * */
+/* $State$ * */
+/* $Date: 2005-04-24 21:10:28 -0700 (Sun, 24 Apr 2005) $ * */
+/* $Author: duraid $ * */
+/* * * */
+/* * Contact: * */
+/* * Christoph Weidenbach * */
+/* * MPI fuer Informatik * */
+/* * Stuhlsatzenhausweg 85 * */
+/* * 66123 Saarbruecken * */
+/* * Email: weidenb@mpi-sb.mpg.de * */
+/* * Germany * */
+/* * * */
+/* ********************************************************** */
+/**************************************************************/
+
+
+/* $RCSfile$ */
+
+#ifndef _STACK_
+#define _STACK_
+
+/**************************************************************/
+/* Includes */
+/**************************************************************/
+
+#include "misc.h"
+
+/**************************************************************/
+/* More basic types and macros */
+/**************************************************************/
+
+
+#define stack_SIZE 10000
+
+typedef POINTER STACK[stack_SIZE];
+
+
+/**************************************************************/
+/* Global Variables */
+/**************************************************************/
+
+extern STACK stack_STACK;
+extern NAT stack_POINTER;
+
+
+/**************************************************************/
+/* Inline Functions */
+/**************************************************************/
+
+static __inline__ void stack_Init(void)
+{
+ stack_POINTER = 0;
+}
+
+static __inline__ void stack_Push(POINTER Entry)
+{
+#ifdef CHECK
+ if (stack_POINTER >= stack_SIZE) {
+ misc_StartErrorReport();
+ misc_ErrorReport("\n In stack_Push: Stack Overflow.");
+ misc_FinishErrorReport();
+ }
+#endif
+
+ stack_STACK[stack_POINTER++]= Entry;
+}
+
+static __inline__ int stack_Pop(void)
+{
+ return --stack_POINTER;
+}
+
+static __inline__ POINTER stack_PopResult(void)
+{
+ return stack_STACK[--stack_POINTER];
+}
+
+static __inline__ void stack_NPop(NAT N)
+{
+ stack_POINTER -= N;
+}
+
+static __inline__ POINTER stack_Top(void)
+{
+ return stack_STACK[stack_POINTER-1];
+}
+
+static __inline__ POINTER stack_NthTop(NAT N)
+{
+ return stack_STACK[stack_POINTER-(1+N)];
+}
+
+static __inline__ void stack_RplacTop(POINTER Entry)
+{
+ stack_STACK[stack_POINTER-1] = Entry;
+}
+
+static __inline__ void stack_RplacNthTop(NAT N, POINTER Entry)
+{
+ stack_STACK[stack_POINTER-(1+N)] = Entry;
+}
+
+static __inline__ void stack_RplacNth(NAT N, POINTER Entry)
+{
+ stack_STACK[N] = Entry;
+}
+
+static __inline__ NAT stack_Bottom(void)
+{
+ return stack_POINTER;
+}
+
+static __inline__ void stack_SetBottom(NAT Ptr)
+{
+ stack_POINTER = Ptr;
+}
+
+static __inline__ BOOL stack_Empty(NAT Ptr)
+{
+ return stack_POINTER == Ptr;
+}
+
+
+#endif
+
+