Lines Matching refs:blist
65 if (bitset->blist.bits != NULL)
67 ANTLR3_FREE(bitset->blist.bits);
68 bitset->blist.bits = NULL;
103 bitset->blist.bits = (pANTLR3_BITWORD) ANTLR3_MALLOC((size_t)(numelements * sizeof(ANTLR3_BITWORD)));
104 memset(bitset->blist.bits, 0, (size_t)(numelements * sizeof(ANTLR3_BITWORD)));
105 bitset->blist.length = numelements;
107 if (bitset->blist.bits == NULL)
141 antlr3BitsetCopy(pANTLR3_BITSET_LIST blist)
155 numElements = blist->length;
166 bitset->blist.length = numElements;
168 bitset->blist.bits = (pANTLR3_BITWORD)ANTLR3_MALLOC((size_t)(numElements * sizeof(ANTLR3_BITWORD)));
170 if (bitset->blist.bits == NULL)
176 ANTLR3_MEMCPY(bitset->blist.bits, blist->bits, (ANTLR3_UINT64)(numElements * sizeof(ANTLR3_BITWORD)));
190 bitset = antlr3BitsetNew(ANTLR3_BITSET_BITS * inSet->blist.length);
199 ANTLR3_MEMCPY(bitset->blist.bits, inSet->blist.bits, (ANTLR3_UINT64)(inSet->blist.length * sizeof(ANTLR3_BITWORD)));
281 if (bitset->blist.length <= count)
286 bitset->blist.bits[count] = *((inBits->bits)+count);
385 if (word >= bitset->blist.length)
390 bitset->blist.bits[word] |= bitMask(bit);
403 if (bitset->blist.bits != NULL)
407 ANTLR3_MEMCPY((void *)newBits, (const void *)bitset->blist.bits, (size_t)(bitset->blist.length * sizeof(ANTLR3_BITWORD)));
411 ANTLR3_FREE(bitset->blist.bits);
416 bitset->blist.bits = newBits;
417 bitset->blist.length = newSize;
426 bl = (bitset->blist.length << 1);
454 if (bitset->blist.length < bitset2->blist.length)
456 growToInclude(bitset, (bitset2->blist.length * sizeof(ANTLR3_BITWORD)));
461 if (bitset->blist.length < bitset2->blist.length)
463 minimum = bitset->blist.length;
467 minimum = bitset2->blist.length;
472 bitset->blist.bits[i-1] |= bitset2->blist.bits[i-1];
495 for (i = bitset->blist.length - 1; i>= 0; i--)
497 if (bitset->blist.bits[i] != 0)
501 if ((bitset->blist.bits[i] & (((ANTLR3_BITWORD)1) << bit)) != 0)
524 if (bitset1->blist.length < bitset2->blist.length)
526 minimum = bitset1->blist.length;
530 minimum = bitset2->blist.length;
537 if (bitset1->blist.bits[i] != bitset2->blist.bits[i])
546 if (bitset1->blist.length > (ANTLR3_UINT32)minimum)
548 for (i = minimum ; (ANTLR3_UINT32)i < bitset1->blist.length; i++)
550 if (bitset1->blist.bits[i] != 0)
556 else if (bitset2->blist.length > (ANTLR3_UINT32)minimum)
558 for (i = minimum; (ANTLR3_UINT32)i < bitset2->blist.length; i++)
560 if (bitset2->blist.bits[i] != 0)
577 if (wordNo >= bitset->blist.length)
582 if ((bitset->blist.bits[wordNo] & bitMask(bit)) == 0)
599 if (wordNo < bitset->blist.length)
601 bitset->blist.bits[wordNo] &= ~(bitMask(bit));
609 for (i = bitset->blist.length -1; i>= 0; i--)
611 if (bitset->blist.bits[i] != 0)
635 return bitset->blist.length << ANTLR3_BITSET_LOG_BITS;