diff options
| author | Paul Eggert <eggert@cs.ucla.edu> | 2004-03-31 00:37:21 +0000 |
|---|---|---|
| committer | Paul Eggert <eggert@cs.ucla.edu> | 2004-03-31 00:37:21 +0000 |
| commit | 779e7ceb9395424c2cf90d43c75302ababc8ee72 (patch) | |
| tree | 914f6342feffe56045fc1692323d05c4eac50d34 /lib/lbitset.c | |
| parent | 2ae64eed2720a7bd03febd7207a62049448f04c1 (diff) | |
| download | bison-779e7ceb9395424c2cf90d43c75302ababc8ee72.tar.gz | |
Use 'short int' rather than 'short', and similarly for 'long', 'unsigned', etc.
Diffstat (limited to 'lib/lbitset.c')
| -rw-r--r-- | lib/lbitset.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/lib/lbitset.c b/lib/lbitset.c index 82fc10ce..26d798c5 100644 --- a/lib/lbitset.c +++ b/lib/lbitset.c @@ -1,5 +1,5 @@ /* Functions to support link list bitsets. - Copyright (C) 2002, 2003 Free Software Foundation, Inc. + Copyright (C) 2002, 2003, 2004 Free Software Foundation, Inc. Contributed by Michael Hayes (m.hayes@elec.canterbury.ac.nz). This program is free software; you can redistribute it and/or modify @@ -54,7 +54,7 @@ typedef bitset_word lbitset_word; /* Number of bits stored in each element. */ #define LBITSET_ELT_BITS \ - ((unsigned) (LBITSET_ELT_WORDS * LBITSET_WORD_BITS)) + ((unsigned int) (LBITSET_ELT_WORDS * LBITSET_WORD_BITS)) /* Lbitset element. We use an array of bits for each element. These are linked together in a doubly-linked list. */ @@ -127,7 +127,7 @@ lbitset_elt_alloc (void) obstack_specify_allocation (&lbitset_obstack, OBSTACK_CHUNK_SIZE, __alignof__ (lbitset_elt), - (void *(*)PARAMS ((long))) + (void *(*)PARAMS ((long int))) OBSTACK_CHUNK_ALLOC, (void (*)PARAMS ((void *))) OBSTACK_CHUNK_FREE); @@ -1390,7 +1390,7 @@ debug_lbitset (bitset bset) for (elt = LBITSET_HEAD (bset); elt; elt = elt->next) { - fprintf (stderr, "Elt %lu\n", (unsigned long) elt->index); + fprintf (stderr, "Elt %lu\n", (unsigned long int) elt->index); for (i = 0; i < LBITSET_ELT_WORDS; i++) { unsigned int j; |