Staging
v0.5.1
v0.5.1
https://github.com/python/cpython
Revision 28626de45201fcfc575f6ffcc6af849673f04476 authored by Hirokazu Yamamoto on 02 February 2009, 09:46:30 UTC, committed by Hirokazu Yamamoto on 02 February 2009, 09:46:30 UTC
svn+ssh://pythondev@svn.python.org/python/branches/py3k ................ r69202 | hirokazu.yamamoto | 2009-02-02 18:15:41 +0900 | 9 lines Merged revisions 69200 via svnmerge from svn+ssh://pythondev@svn.python.org/python/trunk ........ r69200 | hirokazu.yamamoto | 2009-02-02 17:01:17 +0900 | 1 line Set native svn:eol-style property for text files. ........ ................
1 parent c2c707c
Tip revision: 28626de45201fcfc575f6ffcc6af849673f04476 authored by Hirokazu Yamamoto on 02 February 2009, 09:46:30 UTC
Merged revisions 69202 via svnmerge from
Merged revisions 69202 via svnmerge from
Tip revision: 28626de
bitset.c
/* Bitset primitives used by the parser generator */
#include "pgenheaders.h"
#include "bitset.h"
bitset
newbitset(int nbits)
{
int nbytes = NBYTES(nbits);
bitset ss = (char *)PyObject_MALLOC(sizeof(BYTE) * nbytes);
if (ss == NULL)
Py_FatalError("no mem for bitset");
ss += nbytes;
while (--nbytes >= 0)
*--ss = 0;
return ss;
}
void
delbitset(bitset ss)
{
PyObject_FREE(ss);
}
int
addbit(bitset ss, int ibit)
{
int ibyte = BIT2BYTE(ibit);
BYTE mask = BIT2MASK(ibit);
if (ss[ibyte] & mask)
return 0; /* Bit already set */
ss[ibyte] |= mask;
return 1;
}
#if 0 /* Now a macro */
int
testbit(bitset ss, int ibit)
{
return (ss[BIT2BYTE(ibit)] & BIT2MASK(ibit)) != 0;
}
#endif
int
samebitset(bitset ss1, bitset ss2, int nbits)
{
int i;
for (i = NBYTES(nbits); --i >= 0; )
if (*ss1++ != *ss2++)
return 0;
return 1;
}
void
mergebitset(bitset ss1, bitset ss2, int nbits)
{
int i;
for (i = NBYTES(nbits); --i >= 0; )
*ss1++ |= *ss2++;
}
Computing file changes ...