Lines Matching refs:bits
65 if (bitset->blist.bits != NULL)
67 ANTLR3_FREE(bitset->blist.bits);
68 bitset->blist.bits = NULL;
98 // No we need to allocate the memory for the number of bits asked for
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)));
107 if (bitset->blist.bits == NULL)
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)));
197 // Install the actual bits in the source set
199 ANTLR3_MEMCPY(bitset->blist.bits, inSet->blist.bits, (ANTLR3_UINT64)(inSet->blist.length * sizeof(ANTLR3_BITWORD)));
234 /// Creates a new bitset with at least one 64 bit bset of bits, but as
238 /// A variable number of bits to add to the set, ending in -1 (impossible bit).
262 // bit + 1 bits. If any arguments indicate a
263 // a bit higher than the default number of bits (0 means default size)
276 // Now we can add the element bits into the set
286 bitset->blist.bits[count] = *((inBits->bits)+count);
302 /// A variable number of bits to add to the set, ending in -1 (impossible bit).
326 // bit + 1 bits. If any arguments indicate a
327 // a bit higher than the default number of bits (0 menas default size)
338 // Now we can add the element bits into the set
390 bitset->blist.bits[word] |= bitMask(bit);
403 if (bitset->blist.bits != NULL)
405 // Copy existing bits
407 ANTLR3_MEMCPY((void *)newBits, (const void *)bitset->blist.bits, (size_t)(bitset->blist.length * sizeof(ANTLR3_BITWORD)));
409 // Out with the old bits... de de de derrr
411 ANTLR3_FREE(bitset->blist.bits);
414 // In with the new bits... keerrrang.
416 bitset->blist.bits = newBits;
452 // for the new bits to be ored in.
459 // Or the miniimum number of bits after any resizing went on
472 bitset->blist.bits[i-1] |= bitset2->blist.bits[i-1];
490 // then shift right a copy of the 4 bits, than shift left a constant of 1.
497 if (bitset->blist.bits[i] != 0)
501 if ((bitset->blist.bits[i] & (((ANTLR3_BITWORD)1) << bit)) != 0)
533 // Make sure explict in common bits are equal
537 if (bitset1->blist.bits[i] != bitset2->blist.bits[i])
543 // Now make sure the bits of the larger set are all turned
550 if (bitset1->blist.bits[i] != 0)
560 if (bitset2->blist.bits[i] != 0)
582 if ((bitset->blist.bits[wordNo] & bitMask(bit)) == 0)
601 bitset->blist.bits[wordNo] &= ~(bitMask(bit));
611 if (bitset->blist.bits[i] != 0)
638 /** Produce an integer list of all the bits that are turned on
649 ANTLR3_UINT32 numBits; // How many bits are in the set
667 // Enumerate the bits that are turned on
