4 * Time-stamp: <05.12.2004 21:39:34h liekweg>
6 * File name: ir/ana2/qset.c
7 * Purpose: yet another set implementation
10 * Created: Mon 18 Oct 2004
12 * Copyright: (c) 1999-2004 Universität Karlsruhe
13 * Licence: This file is protected by GPL - GNU GENERAL PUBLIC LICENSE.
20 # include <sys/time.h>
32 /* Check whether the given list of sortables is sorted. */
33 static void q_check (sortable_t*, const int);
34 # endif /* defined UNSINN */
36 /* Test whether the given val is among values. Return the index of
37 val in values, or -1. */
38 static int q_test (sortable_t*, const sortable_t, const int);
40 /* Sort n_elems entries in 'values' */
41 static void q_sort (sortable_t*, const int);
43 /* Compare funktion, meant to be qsort(3)-compatible */
44 static __inline__ int sortable_compare (const void *pa, const void *pb)
46 const int a = * (unsigned int*) pa;
47 const int b = * (unsigned int*) pb;
53 return ((a < b) ? -1 : +1);
57 Wrapper for mixed allocation
59 static void *mix_malloc (struct obstack *obst, size_t size)
62 return (obstack_alloc (obst, size));
64 return (malloc (size));
69 Allocate a list of sortables of the given length.
71 static sortable_t *alloc_list (const int len, struct obstack *obst)
73 sortable_t *values = (sortable_t*) mix_malloc (obst, len * sizeof (sortable_t));
75 memset (values, 0x00, len * sizeof (sortable_t));
82 Create a list of sortables of the given length.
84 static sortable_t *gen_list (const int len, struct obstack *obst)
87 sortable_t *values = alloc_list (len, obst);
89 for (i = 0; i < len; i ++) {
90 values [i] = rand () >> 16;
95 # endif /* defined UNSINN */
98 Helper to q_test --- return the index of val in values, or -1
100 static int _q_test (sortable_t *values,
101 const sortable_t val,
102 const int lo, const int hi)
106 /* fprintf (stdout, "%s for %d [%i:%i]\n", __FUNCTION__, val, lo, hi); */
109 if (EQUAL (val, values [lo])) {
116 if (COMPARE (val, values [lo])) {
121 if (COMPARE (values [hi], val)) {
128 if (EQUAL (val, values [mid])) {
132 if (COMPARE (val, values [mid])) {
133 return (_q_test (values, val, lo, mid));
135 return (_q_test (values, val, mid+1, hi));
142 static void _q_sort (sortable_t *values, const int lo, const int hi)
148 /* handle base case: */
154 if (COMPARE (values [hi], values [lo])) {
155 sortable_t tmp = values [lo];
156 values [lo] = values [hi];
168 while (p_lo <= p_hi) {
169 if (COMPARE (values [p_lo], pivot)) {
170 values [p_lo-1] = values [p_lo];
174 sortable_t tmp = values [p_lo];
176 values [p_lo] = values [p_hi];
183 values [p_lo-1] = pivot;
185 _q_sort (values, lo, p_lo-1);
186 _q_sort (values, p_lo, hi);
191 Little test harness for q_sort and friends.
193 static void test_qsort (const int n_runs, const int max_elems, const int incr)
198 fprintf (stdout, "# n_elems: q_sort time : libc qsort time\n");
200 while (n_elems <= max_elems) {
204 for (i = 0; i < n_runs; i ++) {
205 sortable_t *list = gen_list (n_elems, NULL);
207 timing_t *timing = start_timing ();
208 q_sort (list, n_elems);
209 total += end_timing (timing);
211 q_check (list, n_elems);
216 for (i = 0; i < n_runs; i ++) {
217 sortable_t *list = gen_list (n_elems, NULL);
219 timing_t *timing = start_timing ();
220 qsort (list, n_elems, sizeof (sortable_t), sortable_compare);
221 qtotal += end_timing (timing);
223 q_check (list, n_elems);
228 fprintf (stdout, "%d %d %d\n", n_elems, total/n_runs, qtotal/n_runs);
234 fprintf (stdout, "\n");
238 Little test harness for the qset implementation
240 static void test_qset (const int n_entries)
245 qset_t *q1 = qset_new (n_entries, NULL);
246 qset_t *q2 = qset_new (n_entries, NULL);
249 sortable_t *values = gen_list (n_entries, NULL);
251 for (i = 0; i < n_entries; i ++) {
252 qset_insert (q1, values [i]);
253 qset_insert (q2, values [i]);
256 fprintf (stdout, "q1: \t\t");
257 qset_print (q1, stdout);
262 q2->is_sorted = FALSE;
265 fprintf (stdout, "q1 (sorted):\t");
266 qset_print (q1, stdout);
268 assert (qset_compare (q1, q2));
270 q = qset_union (q1, q2);
271 fprintf (stdout, "qq (union):\t");
272 qset_print (q, stdout);
278 fprintf (stdout, "q1.size = %i\n", n1);
279 fprintf (stdout, "q1.slots = %i\n", q1->n_slots);
280 fprintf (stdout, "q2.size = %i\n", n2);
281 fprintf (stdout, "q2.slots = %i\n", q2->n_slots);
282 fprintf (stdout, "q.size = %i\n", n);
283 fprintf (stdout, "q.slots = %i\n", q->n_slots);
288 assert (qset_compare (q1, q2));
289 assert (qset_compare (q2, q));
290 assert (qset_compare (q, q1));
292 for (i = 0; i < n_entries; i ++) {
293 assert (qset_contains (q1, values [i]));
294 assert (qset_contains (q2, values [i]));
295 assert (qset_contains (q, values [i]));
301 fprintf (stdout, "q1.size = %i\n", n1);
302 fprintf (stdout, "q1.slots = %i\n", q1->n_slots);
303 fprintf (stdout, "q2.size = %i\n", n2);
304 fprintf (stdout, "q2.slots = %i\n", q2->n_slots);
305 fprintf (stdout, "q.size = %i\n", n);
306 fprintf (stdout, "q.slots = %i\n", q->n_slots);
308 assert (qset_compare (q1, q2));
309 assert (qset_compare (q2, q));
310 assert (qset_compare (q, q1));
312 for (i = 0; i < n_entries; i ++) {
313 assert (qset_contains (q1, values [i]));
314 assert (qset_contains (q2, values [i]));
315 assert (qset_contains (q, values [i]));
322 # endif /* defned UNSINN */
324 /* PRIVATE QSET IMPLEMENTATION */
326 Resize a qset to (at least) the given size.
328 static void qset_resize (qset_t *qset, const int n_slots)
331 sortable_t *values = NULL;
333 if (qset->n_slots >= n_slots) {
337 new_size = qset->n_slots;
339 while (new_size < n_slots) {
343 values = alloc_list (new_size, qset->obst);
345 memcpy (values, qset->values, qset->n_elems * sizeof (sortable_t));
346 memset (qset->values, 0x00, qset->n_elems * sizeof (sortable_t)); /* debug only */
348 if (NULL == qset->obst) {
352 qset->values = values;
353 qset->n_slots = new_size;
357 Print a list of sortables.
359 static void q_print (sortable_t *values, const int n_values, FILE *stream)
363 fprintf (stream, "{");
365 for (i = 0; i < n_values; i ++) {
366 if (0 == values [i]) {
367 fprintf (stream, "_");
369 fprintf (stream, "0x08%x", (int) values [i]);
372 if (i + 1 != n_values) {
373 fprintf (stream, ", ");
377 fprintf (stream, "}\n");
382 Check whether the given list of sortables is sorted.
384 static void q_check (sortable_t *values, const int n_values)
388 for (i = 1; i < n_values; i ++) {
389 assert (COMPARE (values [i-1], values [i]) ||
390 EQUAL (values [i-1], values [i]));
393 for (i = 1; i < n_values; i ++) {
394 assert (-1 != q_test (values, values [i], n_values));
397 # endif /* defined UNSINN */
400 Test whether the given val is among values. Return the lowest index of val
403 static int q_test (sortable_t *values, const sortable_t val, const int n_elems)
405 int idx = _q_test (values, val, 0, n_elems-1);
407 while ((0 <= idx-1) && EQUAL (values [idx], val)) {
415 Sort entries in 'values' from index 'lo' to 'hi' (inclusive)
417 static void q_sort (sortable_t *values, const int n_elems)
419 _q_sort (values, 0, n_elems-1);
422 /* PUBLIC INTERFACE */
425 Allocate a new qset with initial space for up to n_elems.
426 If a non-NULL obstack is given, it is used for all allocations of this qset
427 and must be initialised and deleted by the user of the qset.
429 qset_t *qset_new (const int n_elems, struct obstack *obst)
431 qset_t *qset = (qset_t*) mix_malloc (obst, sizeof (qset_t));
434 qset->values = alloc_list (n_elems, obst);
435 memset (qset->values, 0x00, n_elems * sizeof (sortable_t));
437 qset->n_slots = n_elems;
439 qset->is_sorted = FALSE;
440 qset->id = qset_id ++;
446 Sort the entries of the given qset.
448 void qset_sort (qset_t *qset)
453 if (qset->is_sorted) {
457 q_sort (qset->values, qset->n_elems);
459 for (i = 1; i < qset->n_elems; i ++) {
460 if (! EQUAL (qset->values [i], qset->values [occ])) {
461 qset->values [++ occ] = qset->values [i];
468 if (qset->n_elems != occ) {
469 fprintf (stdout, "removed %i duplicates\n", qset->n_elems - occ);
474 qset->is_sorted = TRUE;
478 Compact a qset to take up no more space than required.
480 void qset_compact (qset_t *qset)
482 if (NULL == qset->obst) {
483 sortable_t *values = (sortable_t*) mix_malloc (qset->obst,
484 qset->n_elems * sizeof (sortable_t));
485 memcpy (values, qset->values, qset->n_elems * sizeof (sortable_t));
487 memset (qset->values, 0x00, qset->n_elems * sizeof (sortable_t));
491 qset->values = values;
492 qset->n_slots = qset->n_elems;
497 Free the memory associated with the given qset
499 void qset_delete (qset_t *qset)
501 memset (qset->values, 0x00, qset->n_elems * sizeof (sortable_t));
503 if (NULL == qset->obst) {
507 memset (qset, 0x00, sizeof (qset_t));
509 if (NULL == qset->obst) {
515 Test wether the given qset contains the given value.
517 int qset_contains (qset_t *qset, sortable_t val)
521 return (-1 != q_test (qset->values, val, qset->n_elems));
525 Delete the given value from the given qset (if it exists)
527 void qset_remove (qset_t *qset, sortable_t val)
535 idx = q_test (qset->values, val, qset->n_elems);
541 while (EQUAL (qset->values [idx + occ], val)) {
545 for (i = idx; i < qset->n_elems - occ; i ++) {
546 qset->values [i] = qset->values [i+occ];
549 qset->n_elems -= occ;
553 Insert the given elem into the given qset; return nonzero iff any
554 involved values change.
556 int qset_insert (qset_t *qset, sortable_t val)
559 const int n_elems = qset->n_elems;
561 /* todo: sort, find */
564 for (i = 0; i < n_elems; i ++) {
565 if (EQUAL (val, qset->values [i])) {
570 qset_resize (qset, qset->n_elems+1);
572 qset->values [qset->n_elems++] = val;
573 qset->is_sorted = FALSE;
579 Insert all elems of qset2 into qset1; return nonzero iff any
580 involved values change. qset2 is *not* deleted.
582 int qset_insert_all (qset_t *qset1, qset_t *qset2)
585 sortable_t val = qset_start (qset2);
588 change |= qset_insert (qset1, val);
590 val = qset_next (qset2);
601 int qset_compare (qset_t *qset1, qset_t *qset2)
604 const int n_elems = qset1->n_elems;
609 if (qset1->n_elems != qset2->n_elems) {
613 for (i = 0; i < n_elems; i ++) {
614 if (qset1->values [i] != qset2->values [i]) {
623 Returns the union of two qsets.
625 qset_t *qset_union (qset_t *qset1, qset_t *qset2)
627 qset_t *qset = (qset_t*) mix_malloc (qset1->obst, sizeof (qset_t));
628 const int n_elems = qset1->n_elems + qset2->n_elems;
630 qset->values = alloc_list (n_elems, qset1->obst);
632 memcpy (qset->values, qset1->values,
633 qset1->n_elems * sizeof (sortable_t));
635 memcpy (qset->values+qset1->n_elems,
636 qset2->values, qset2->n_elems * sizeof (sortable_t));
638 qset->obst = qset1->obst;
639 qset->n_elems = n_elems;
640 qset->n_slots = qset->n_elems;
648 Report the size of the given qset.
650 int qset_size (qset_t *qset)
652 return (qset->n_elems);
656 Print the given qset to the given stream.
658 void qset_print (qset_t *qset, FILE *stream)
660 q_print (qset->values, qset->n_elems, stream);
664 Check wether the given qset is empty
666 int qset_is_empty (qset_t *qset)
668 return (0 == qset->n_elems);
672 Initialise a new iteration over a qset
674 sortable_t *qset_start (qset_t *qset)
678 sortable_t *start = qset_next (qset);
680 return (start); /* works for empty sets, too */
684 Step to the next element
686 sortable_t *qset_next (qset_t *qset)
688 if (qset->n_elems == qset->cursor) {
692 /* quick fix to skip NULL entries */
693 while ((qset->cursor < qset->n_elems) &&
694 (NULL == qset->values [qset->cursor])) {
698 return (qset->values [qset->cursor++]);
703 int qset_test_main (int argc, char **argv)
708 if (-1 == gettimeofday (&tp, NULL)) {
709 perror ("gettimeofday");
713 seed = (unsigned int) tp.tv_usec;
716 /* test_qsort (20, 1000000, 100000); */
718 test_qset (atoi (argv [1]));
722 # endif /* defined UNSINN */
726 Revision 1.8 2004/12/06 12:49:26 liekweg
729 Revision 1.7 2004/11/30 14:47:11 liekweg
730 insert report changes
732 Revision 1.6 2004/11/26 15:58:30 liekweg
733 don't free inside obstacks (thx, michael)
735 Revision 1.5 2004/11/24 14:53:56 liekweg
738 Revision 1.4 2004/11/18 16:35:45 liekweg
739 Added unique ids for debugging
741 Revision 1.3 2004/11/09 16:45:36 liekweg
744 Revision 1.2 2004/11/08 12:32:00 liekweg
745 Moved q_* methods into private section
747 Revision 1.1 2004/11/04 14:55:13 liekweg