/* A simple, memory-efficient bitset implementation.
- Copyright (C) 2009 Free Software Foundation, Inc.
+ Copyright (C) 2009-2012 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
Sbitset
Sbitset__new_on_obstack (Sbitset__Index nbits, struct obstack *obstackp)
{
- char *result;
- char *ptr;
- char *end;
+ Sbitset result;
+ Sbitset ptr;
+ Sbitset end;
aver (nbits);
result = obstack_alloc (obstackp, Sbitset__nbytes (nbits));
for (ptr = result, end = result + Sbitset__nbytes (nbits); ptr < end; ++ptr)
bool
Sbitset__isEmpty (Sbitset self, Sbitset__Index nbits)
{
- char *last = self + Sbitset__nbytes (nbits) - 1;
+ Sbitset last = self + Sbitset__nbytes (nbits) - 1;
for (; self < last; ++self)
if (*self != 0)
return false;
Sbitset__Index i;
Sbitset itr;
bool first = true;
- fprintf (file, "nbits = %d, set = {", nbits);
+ fprintf (file,
+ "nbits = %" SBITSET__INDEX__CONVERSION_SPEC ", set = {",
+ nbits);
SBITSET__FOR_EACH (self, nbits, itr, i)
{
if (first)
first = false;
else
fprintf (file, ",");
- fprintf (file, " %d", i);
+ fprintf (file, " %" SBITSET__INDEX__CONVERSION_SPEC, i);
}
fprintf (file, " }");
}