From 6c196ec8a41d6ed506c133c8b33dba9684f9a7a6 Mon Sep 17 00:00:00 2001 From: xleroy Date: Wed, 3 Mar 2010 12:34:43 +0000 Subject: Updated raytracer test. Added SPASS test. git-svn-id: https://yquem.inria.fr/compcert/svn/compcert/trunk@1271 fca1b0fc-160b-0410-b1d3-a4f43f01ea2e --- test/spass/hasharray.c | 138 +++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 138 insertions(+) create mode 100644 test/spass/hasharray.c (limited to 'test/spass/hasharray.c') diff --git a/test/spass/hasharray.c b/test/spass/hasharray.c new file mode 100644 index 00000000..9822b71c --- /dev/null +++ b/test/spass/hasharray.c @@ -0,0 +1,138 @@ +/**************************************************************/ +/* ********************************************************** */ +/* * * */ +/* * HASHING * */ +/* * * */ +/* * $Module: HASHARRAY * */ +/* * * */ +/* * Copyright (C) 1997, 1998, 2000, 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$ */ + +#include "hasharray.h" + + +/**************************************************************/ +/* Functions */ +/**************************************************************/ + +HASH hsh_Create(void) +/************************************************************** + RETURNS: A new, empty hasharray +***************************************************************/ +{ + HASH h; + NAT l; + h = (LIST*) memory_Malloc(sizeof(LIST) * hsh__SIZE); + for (l=0; l < hsh__SIZE; l++) + h[l] = list_Nil(); + return h; +} + +void hsh_Reset(HASH H) +/************************************************************** + INPUT: A hasharray + EFFECT: Deletes all information stored in the array but keeps + the array itself. + Keys and data items are not deleted ! +***************************************************************/ +{ + int i; + LIST Scan, Pair; + for (i = 0; i < hsh__SIZE; i++) { + for (Scan = H[i]; !list_Empty(Scan); Scan = list_Cdr(Scan)) { + Pair = list_Car(Scan); + list_Delete(list_PairSecond(Pair)); + list_PairFree(Pair); + } + list_Delete(H[i]); + H[i] = list_Nil(); + } +} + +void hsh_Delete(HASH H) +/************************************************************** + INPUT: A hasharray + EFFECT: Deletes all information stored in the array and + the array itself. + Keys and data items are not deleted ! +***************************************************************/ +{ + hsh_Reset(H); + memory_Free(H, sizeof(LIST) * hsh__SIZE); +} + +LIST hsh_GetAllEntries(HASH H) +/************************************************************** + INPUT: A hasharray + RETURNS: A new list of all data items stored in the hasharray +***************************************************************/ +{ + LIST Scan, Result; + NAT i; + Result = list_Nil(); + for (i = 0; i < hsh__SIZE; i++) { + for (Scan = H[i]; !list_Empty(Scan); Scan = list_Cdr(Scan)) + Result = list_Nconc(Result, list_Copy(list_PairSecond(list_Car(Scan)))); + } + return Result; +} + +void hsh_Check(HASH H) +/************************************************************** + INPUT: A hasharray + EFFECT: Traverses the whole array and the lists to find dangling pointers. +***************************************************************/ +{ + LIST Scan, Scan2, Pair; + NAT i; + unsigned long Key; + for (i = 0; i < hsh__SIZE; i++) { + for (Scan = H[i]; !list_Empty(Scan); Scan = list_Cdr(Scan)) { + Pair = list_Car(Scan); + Key = (unsigned long)list_PairFirst(Pair); + for (Scan2 = list_PairSecond(Pair); !list_Empty(Scan2); Scan2 = list_Cdr(Scan2)) { + POINTER Value; + char Z; + Value = list_Car(Scan2); + Z = * ((char*) Value); + } + } + } +} -- cgit