2 * Copyright (C) 1994, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.1 1994-09-26 10:16:53 adam
8 * First version of dfa module in alex. This version uses yacc to parse
9 * regular expressions. This should be hand-made instead.
22 #define GET_BIT(s,m) (s[(m)/(sizeof(BSetWord)*8)]&(1<<(m&(sizeof(BSetWord)*8-1))))
23 #define SET_BIT(s,m) (s[(m)/(sizeof(BSetWord)*8)]|=(1<<(m&(sizeof(BSetWord)*8-1))))
25 BSetHandle *mk_BSetHandle (int size, int chunk)
27 int wsize = 1+size/(sizeof(BSetWord)*8);
32 sh = (BSetHandle *) imalloc( sizeof(BSetHandle) +
33 chunk*sizeof(BSetWord)*wsize );
37 sh->chunk = chunk * wsize;
43 void rm_BSetHandle (BSetHandle **shp)
58 int inf_BSetHandle (BSetHandle *sh, long *used, long *allocated)
69 *allocated += sh->chunk;
70 } while( (sh = sh->setchain) );
74 BSet mk_BSet (BSetHandle **shp)
83 if( (off + sh->wsize) > sh->chunk )
85 sh1 = (BSetHandle *) imalloc( sizeof(BSetHandle ) +
86 sh->chunk*sizeof(BSetWord) );
88 sh1->wsize = sh->wsize;
89 sh1->chunk = sh->chunk;
90 off = sh1->offset = 0;
94 sh->offset = off + sh->wsize;
95 return sh->setarray + off;
98 void add_BSet (BSetHandle *sh, BSet dst, unsigned member)
102 assert( member <= sh->size );
103 SET_BIT(dst, member);
106 unsigned test_BSet (BSetHandle *sh, BSet src, unsigned member)
110 assert( member <= sh->size );
111 return GET_BIT( src , member) != 0;
114 BSet cp_BSet (BSetHandle *sh, BSet dst, BSet src)
119 memcpy( dst, src, sh->wsize * sizeof(BSetWord));
123 void res_BSet (BSetHandle *sh, BSet dst)
126 memset( dst, 0, sh->wsize * sizeof(BSetWord));
129 void union_BSet (BSetHandle *sh, BSet dst, BSet src)
135 for( i=sh->wsize; --i >= 0; )
139 unsigned hash_BSet (BSetHandle *sh, BSet src)
145 for( i=sh->wsize; --i >= 0; )
150 void com_BSet (BSetHandle *sh, BSet dst)
155 for( i=sh->wsize; --i >= 0; dst++ )
159 int eq_BSet (BSetHandle *sh, BSet dst, BSet src)
165 for( i=sh->wsize; --i >= 0; )
166 if( *dst++ != *src++ )
171 int trav_BSet (BSetHandle *sh, BSet src, unsigned member)
173 int i = sh->size - member;
174 BSetWord *sw = src+member/(sizeof(BSetWord)*8);
175 unsigned b = member & (sizeof(BSetWord)*8-1);
177 if( b == 0 && *sw == 0 )
179 member += sizeof(BSetWord)*8;
181 i -= sizeof(BSetWord)*8;
183 else if( *sw & (1<<b) )
189 if( ++b == sizeof(BSetWord)*8 )
198 int travi_BSet (BSetHandle *sh, BSet src, unsigned member)
200 int i = sh->size - member;
201 BSetWord *sw = src+member/(sizeof(BSetWord)*8);
202 unsigned b = member & (sizeof(BSetWord)*8-1);
204 if( b == 0 && *sw == (BSetWord) ~ 0 )
206 member += sizeof(BSetWord)*8;
208 i -= sizeof(BSetWord)*8;
210 else if( (*sw & (1<<b)) == 0 )
216 if( ++b == sizeof(BSetWord)*8 )
226 void pr_BSet (BSetHandle *sh, BSet src)
231 for( i=0; (i=trav_BSet(sh,src,i)) != -1; i++ )
236 void pr_charBSet (BSetHandle *sh, BSet src, void (*f) (int))
242 i = trav_BSet( sh, src, 0 );
249 i1 = trav_BSet( sh, src, ++i );
252 while( (i1=trav_BSet( sh, src, ++i )) == i )