size_t nmemb, size;
int (*compar)(const void *, const void *);
{
- int cnt, i, j, l;
+ size_t cnt, i, j, l;
char tmp, *tmp1, *tmp2;
char *base, *k, *p, *t;
int fd;
struct nlist *list;
{
- int n = -1, i;
+ size_t i;
+ int n = -1;
for (i = 0; i < sizeof(nlist_fn) / sizeof(nlist_fn[0]); i++) {
n = (nlist_fn[i].fn)(fd, list);
* character at position i, move on to the next
* character.
*/
- if (nc == 1 && count[bmin] == n) {
+ if (nc == 1 && count[bmin] == (u_int)n) {
push(a, n, i+1);
nc = count[bmin] = 0;
continue;