X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/85bd77ce2235a846db6202fec0dc396d07d6fead..ff021a73f0cd26b2f27ca729783aa486393f9b3a:/testsuite/xbt/multidict_crash.c

diff --git a/testsuite/xbt/multidict_crash.c b/testsuite/xbt/multidict_crash.c
new file mode 100644
index 0000000000..0f7e5f0d11
--- /dev/null
+++ b/testsuite/xbt/multidict_crash.c
@@ -0,0 +1,97 @@
+/* $Id$ */
+
+/* multidict_crash - A crash test for multi-level dictionnaries             */
+
+/* Authors: Martin Quinson                                                  */
+/* Copyright (C) 2003 the OURAGAN project.                                  */
+
+/* This program is free software; you can redistribute it and/or modify it
+   under the terms of the license (GNU LGPL) which comes with this package. */
+
+#include <stdio.h>
+#include <assert.h>
+
+#include <gras.h>
+
+#define NB_ELM 10/*00*/
+#define MULTICACHE_DEPTH 5
+#define KEY_SIZE 12 /*512*/
+#define NB_TEST 20
+int verbose=0;
+
+static gras_error_t test1();
+
+static gras_error_t test1() {
+  gras_error_t errcode;
+  gras_dict_t *head=NULL;
+  int i,j,k,l;
+  char **key = NULL;
+  char **val = NULL;
+  void *data;
+
+  printf("\nGeneric multicache: CRASH test:\n");
+  printf(" Fill the struct and frees it %d times, using %d elements, depth of multicache=%d\n",NB_TEST,NB_ELM,MULTICACHE_DEPTH);
+  printf(" with %d chars long randomized keys. (a point is a test)\n",KEY_SIZE);
+
+  for (i=0;i<NB_TEST;i++) {
+    if (i%10) printf("."); else printf("%d",i/10); fflush(stdout);
+    if (!(key=malloc(sizeof(char*)*MULTICACHE_DEPTH)))
+      RAISE_MALLOC;
+    if (!(val=malloc(sizeof(char*)*MULTICACHE_DEPTH)))
+      RAISE_MALLOC;
+    for (l=0 ; l<MULTICACHE_DEPTH ; l++)
+      if (!(val[l]=malloc(sizeof(char)*KEY_SIZE)))
+	RAISE_MALLOC;
+
+    for (j=0;j<NB_ELM;j++) {
+      if (verbose) printf ("Add ");
+      for (l=0 ; l<MULTICACHE_DEPTH ; l++){
+	for (k=0;k<KEY_SIZE-1;k++) {
+	  val[l][k]=rand() % ('z' - 'a') + 'a';
+	}
+	val[l][k]='\0';
+	if (verbose) printf("%s ; ",val[l]);
+	key[l]=val[l];//  NOWADAYS, no need to strdup the key.
+      }
+      if (verbose) printf("in multitree %p.\n",head);
+      TRYFAIL(gras_multidict_insert(&head,MULTICACHE_DEPTH,key,
+				    strdup(val[0]),&free));
+
+      TRYFAIL(gras_multidict_retrieve(head,
+				      MULTICACHE_DEPTH,(const char **)val,
+				      &data));
+      if (!data || strcmp((char*)data,val[0])) {
+	fprintf(stderr,"Retrieved value (%s) does not match the entrered one (%s)\n",
+		(char*)data,val[0]);
+	abort();
+      }
+    }
+    gras_dict_dump(head,&gras_dict_print);
+    gras_dict_free(&head);
+
+    for (l=0 ; l<MULTICACHE_DEPTH ; l++)
+      if (val[l]) free(val[l]);
+    free(val);
+    free(key);
+
+  }
+
+  printf("\n");
+  return no_error;
+}
+
+int main() {
+  gras_error_t errcode;
+
+  TRY(gras_log_control_set("root.thresh=debug"));
+  /*
+  //DirectDiagnostics(DIAGDEBUG, stdout);
+  DirectDiagnostics(DIAGINFO, stdout);
+  //  DirectDiagnostics(DIAGLOG, stdout);
+  DirectDiagnostics(DIAGWARN, stderr);
+  DirectDiagnostics(DIAGERROR, stderr);
+  DirectDiagnostics(DIAGFATAL, stderr);
+  */
+  TRYFAIL(test1());
+  return 0;
+}