3 /* dict_crash - A crash test for dictionnaries */
5 /* Authors: Martin Quinson */
6 /* Copyright (C) 2003 the OURAGAN project. */
8 /* This program is free software; you can redistribute it and/or modify it
9 under the terms of the license (GNU LGPL) which comes with this package. */
16 #define SIZEOFKEY 1024
18 static void print_str(void *str);
19 static void print_str(void *str) {
20 printf("%s",(char*)str);
24 static gras_error_t traverse(gras_dict_t *head) {
25 gras_dict_cursor_t *cursor=NULL;
29 gras_dict_foreach(head,cursor,key,data) {
30 // printf(" Seen: %s=%s\n",key,data);
31 if (strcmp(key,data)) {
32 printf("Key(%s) != value(%s). Abording\n",key,data);
39 static gras_error_t countelems(gras_dict_t *head,int*count) {
40 gras_dict_cursor_t *cursor;
45 gras_dict_foreach(head,cursor,key,data) {
51 int main(int argc,char **argv) {
53 gras_dict_t *head=NULL;
58 gras_init_defaultlog(&argc,argv,"dict.thresh=verbose");
59 srand((unsigned int)time(NULL));
61 printf("Dictionnary: CRASH test:\n");
62 printf(" Fill the struct, count its elems and frees the structure (x20)\n");
63 printf(" using 1000 elements with %d chars long randomized keys.\n",SIZEOFKEY);
64 printf(" (a point is a test)\n");
67 TRYFAIL(gras_dict_new(&head));
68 if (i%10) printf("."); else printf("%d",i/10); fflush(stdout);
70 for (j=0;j<1000;j++) {
71 if (!(key=malloc(SIZEOFKEY))) {
72 fprintf(stderr,"Out of memory\n");
76 for (k=0;k<SIZEOFKEY-1;k++)
77 key[k]=rand() % ('z' - 'a') + 'a';
79 // printf("[%d %s]\n",j,key);
80 TRYFAIL(gras_dict_set(head,key,key,&free));
83 // gras_dict_dump(head,(void (*)(void*))&printf);
84 TRYFAIL(countelems(head,&nb));
86 printf ("\nI found %d elements, and not 1000\n",nb);
89 TRYFAIL(traverse(head));
90 gras_dict_free(&head);
94 TRYFAIL(gras_dict_new(&head));
95 printf("\n Fill 20 000 elements, with keys being the number of element\n");
96 printf(" (a point is 1 000 elements)\n");
97 for (j=0;j<NB_ELM;j++) {
102 if (!(key=malloc(10))) {
103 fprintf(stderr,"Out of memory\n");
108 TRYFAIL(gras_dict_set(head,key,key,&free));
111 printf("\n Count the elements (retrieving the key and data for each): \n");
112 TRYFAIL(countelems(head,&i));
114 printf(" There is %d elements\n",i);
115 printf("\n Search my 20 000 elements 20 times. (a point is a test)\n");
116 if (!(key=malloc(10))) {
117 fprintf(stderr,"Out of memory\n");
121 if (i%10) printf("."); else printf("%d",i/10); fflush(stdout);
122 for (j=0;j<NB_ELM;j++) {
125 TRYFAIL(gras_dict_get(head,key,&data));
126 if (strcmp(key,(char*)data)) {
127 printf("key=%s != data=%s\n",key,(char*)data);
134 printf("\n Remove my 20 000 elements. (a point is 10 000 elements)\n");
135 if (!(key=malloc(10))) {
136 fprintf(stderr,"Out of memory\n");
139 for (j=0;j<NB_ELM;j++) {
140 if (!(j%10000)) printf("."); fflush(stdout);
143 TRYFAIL(gras_dict_remove(head,key));
149 printf("\n Free the structure (twice)\n");
150 gras_dict_free(&head);
151 gras_dict_free(&head);