diff options
| author | H.J. Lu <hjl@lucon.org> | 2000-06-15 20:56:25 +0000 |
|---|---|---|
| committer | H.J. Lu <hjl@lucon.org> | 2000-06-15 20:56:25 +0000 |
| commit | 4e8632cf5c1836fd78f9f1d6fb6d99624a607a5b (patch) | |
| tree | 4f5251c0536a55ce83d3a0f6197859988968758c /libiberty/partition.c | |
| parent | 4c7819c41071cf69ebb603225b4ebb0b5594a896 (diff) | |
| download | binutils-redhat-4e8632cf5c1836fd78f9f1d6fb6d99624a607a5b.tar.gz | |
Synced with libiberty in the gcc repository.
Diffstat (limited to 'libiberty/partition.c')
| -rw-r--r-- | libiberty/partition.c | 8 |
1 files changed, 5 insertions, 3 deletions
diff --git a/libiberty/partition.c b/libiberty/partition.c index 52fb128d7b..a5a734937a 100644 --- a/libiberty/partition.c +++ b/libiberty/partition.c @@ -34,6 +34,8 @@ #include "libiberty.h" #include "partition.h" +static int elem_compare PARAMS ((const void *, const void *)); + /* Creates a partition of NUM_ELEMENTS elements. Initially each element is in a class by itself. */ @@ -128,8 +130,8 @@ elem_compare (elem1, elem2) const void *elem1; const void *elem2; { - int e1 = * (int *) elem1; - int e2 = * (int *) elem2; + int e1 = * (const int *) elem1; + int e2 = * (const int *) elem2; if (e1 < e2) return -1; else if (e1 > e2) @@ -175,7 +177,7 @@ partition_print (part, fp) c = elements[c].next - elements; } /* Sort them. */ - qsort ((void *) class_elements, count, sizeof (int), &elem_compare); + qsort ((void *) class_elements, count, sizeof (int), elem_compare); /* Print them. */ fputc ('(', fp); for (i = 0; i < count; ++i) |