Re: alsa-lib patches

[Martin Stransky <stransky@redhat.com>]

[-- Attachment #1: Type: text/plain, Size: 347 bytes --]

Bugzilla link:

https://bugzilla.redhat.com/bugzilla-old/show_bug.cgi?id=146607

We had old patch (it's attached) and it's very similar to your current 
code. It causes some problems, so i changed the patch and it works.

Ma.

> Please give a more detailed description of the patches.  What kind of
> problem?  How about a bugzilla link?
> 
> Lee

[-- Attachment #2: old-alsa-lib-stack.patch --]
[-- Type: text/x-patch, Size: 851 bytes --]

--- alsa-lib-1.0.6/src/mixer/mixer.c.org	2005-01-07 22:37:42.688153791 +0100
+++ alsa-lib-1.0.6/src/mixer/mixer.c	2005-01-07 22:39:49.943579453 +0100
@@ -520,17 +520,14 @@
 	return c1->class->compare(c1, c2);
 }
 
+typedef int (*qsort_func)(const void *, const void *);
 static int snd_mixer_sort(snd_mixer_t *mixer)
 {
 	unsigned int k;
-	int compar(const void *a, const void *b) {
-		return mixer->compare(*(const snd_mixer_elem_t * const *) a,
-				      *(const snd_mixer_elem_t * const *) b);
-	}
 	assert(mixer);
 	assert(mixer->compare);
 	INIT_LIST_HEAD(&mixer->elems);
-	qsort(mixer->pelems, mixer->count, sizeof(snd_mixer_elem_t*), compar);
+	qsort(mixer->pelems, mixer->count, sizeof(snd_mixer_elem_t*), (qsort_func)mixer->compare);
 	for (k = 0; k < mixer->count; k++)
 		list_add_tail(&mixer->pelems[k]->list, &mixer->elems);
 	return 0;