| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRBitSet.m | 107 bitVector = CFBitVectorCreateMutable(kCFAllocatorDefault,0);
115 bitVector = CFBitVectorCreateMutable(kCFAllocatorDefault,0);
116 if ((CFIndex)type >= CFBitVectorGetCount(bitVector))
117 CFBitVectorSetCount(bitVector, type+1);
118 CFBitVectorSetBitAtIndex(bitVector, type, 1);
126 bitVector = CFBitVectorCreateMutable(kCFAllocatorDefault,0);
127 CFBitVectorSetCount( bitVector, nbits );
135 bitVector = theBitVector;
147 bitVector = CFBitVectorCreateMutable ( kCFAllocatorDefault, 0 );
148 CFBitVectorSetCount( bitVector, sizeof(unsigned long long)*8*longCount )
[all...] |
| /art/runtime/base/ |
| bit_vector.h | 32 * from zero. All operations on a BitVector are unsynchronized.
34 class BitVector {
39 * @brief Convenient iterator across the indexes of the BitVector's set bits.
42 * to the highest index of the BitVector's set bits. Instances can be retrieved
43 * only through BitVector::Indexes() which returns an IndexContainer wrapper
73 IndexIterator(const BitVector* bit_vector, begin_tag)
78 IndexIterator(const BitVector* bit_vector, end_tag)
92 friend class BitVector::IndexContainer;
96 * @brief BitVector wrapper class for iteration across indexes of set bits.
100 explicit IndexContainer(const BitVector* bit_vector) : bit_vector_(bit_vector) {
[all...] |
| bit_vector-inl.h | 26 inline bool BitVector::IndexIterator::operator==(const IndexIterator& other) const {
32 inline uint32_t BitVector::IndexIterator::operator*() const {
37 inline BitVector::IndexIterator& BitVector::IndexIterator::operator++() {
43 inline BitVector::IndexIterator BitVector::IndexIterator::operator++(int) {
49 inline uint32_t BitVector::IndexIterator::FindIndex(uint32_t start_index) const {
68 inline void BitVector::ClearAllBits() {
72 inline bool BitVector::Equal(const BitVector* src) const
[all...] |
| bit_vector_test.cc | 25 TEST(BitVector, Test) {
28 BitVector bv(kBits, false, Allocator::GetMallocAllocator());
58 BitVector::IndexIterator iterator = bv.Indexes().begin();
68 TEST(BitVector, NoopAllocator) {
74 BitVector bv(false, Allocator::GetNoopAllocator(), kWords, bits);
125 TEST(BitVector, SetInitialBits) {
131 BitVector bv(false, Allocator::GetNoopAllocator(), kWords, bits);
144 TEST(BitVector, UnionIfNotIn) {
146 BitVector first(2, true, Allocator::GetMallocAllocator());
147 BitVector second(5, true, Allocator::GetMallocAllocator())
[all...] |
| bit_vector.cc | 27 BitVector::BitVector(bool expandable,
41 BitVector::BitVector(uint32_t start_bits,
44 : BitVector(expandable,
51 BitVector::BitVector(const BitVector& src,
54 : BitVector(expandable,
62 BitVector::~BitVector()
[all...] |
| arena_bit_vector.h | 29 * A BitVector implementation that uses Arena allocation.
31 class ArenaBitVector : public BitVector, public ArenaObject<kArenaAllocGrowableBitMap> {
|
| /external/v8/test/cctest/ |
| test-bit-vector.cc | 37 TEST(BitVector) {
40 BitVector v(15, &zone);
47 BitVector w(15, &zone);
55 BitVector v(64, &zone);
60 BitVector::Iterator iter(&v);
73 BitVector v(15, &zone);
75 BitVector w(15, &zone);
83 BitVector v(15, &zone);
85 BitVector w(15, &zone);
89 BitVector u(w, &zone)
[all...] |
| /external/v8/src/ |
| bit-vector.h | 14 class BitVector : public ZoneObject {
16 // Iterator for the elements of this BitVector.
19 explicit Iterator(BitVector* target)
53 BitVector* target_;
58 friend class BitVector;
65 BitVector(int length, Zone* zone)
73 BitVector(const BitVector& other, Zone* zone)
85 void CopyFrom(const BitVector& other) {
113 void Union(const BitVector& other)
[all...] |
| bit-vector.cc | 13 void BitVector::Print() {
28 void BitVector::Iterator::Advance() {
43 int BitVector::Count() const {
|
| /external/v8/src/crankshaft/ |
| hydrogen-environment-liveness.h | 30 void ZapEnvironmentSlotsInSuccessors(HBasicBlock* block, BitVector* live);
32 void UpdateLivenessAtBlockEnd(HBasicBlock* block, BitVector* live);
33 void UpdateLivenessAtInstruction(HInstruction* instr, BitVector* live);
45 ZoneList<BitVector*> live_at_block_start_;
47 ZoneList<BitVector*> first_simulate_invalid_for_index_;
59 BitVector went_live_since_last_simulate_;
|
| hydrogen-infer-representation.h | 26 BitVector in_worklist_;
|
| hydrogen-infer-types.h | 28 BitVector in_worklist_;
|
| hydrogen-environment-liveness.cc | 28 new(zone()) BitVector(maximum_environment_size_, zone()), zone());
31 new(zone()) BitVector(maximum_environment_size_, zone()), zone());
48 HBasicBlock* block, BitVector* live) {
54 BitVector* live_in_successor = live_at_block_start_[successor_id];
85 BitVector* live) {
96 BitVector* live) {
165 BitVector live(maximum_environment_size_, zone());
166 BitVector worklist(block_count_, zone());
|
| hydrogen-infer-representation.cc | 24 ZoneList<BitVector*> connected_phis(phi_count, zone());
27 BitVector* connected_set = new(zone()) BitVector(phi_count, zone());
57 BitVector done(phi_count, zone());
64 for (BitVector::Iterator it(connected_phis[i]);
77 for (BitVector::Iterator it(connected_phis[i]);
86 for (BitVector::Iterator it(connected_phis[i]);
106 for (BitVector::Iterator it(connected_phis[i]);
|
| hydrogen-range-analysis.h | 41 BitVector in_worklist_;
|
| /external/v8/src/compiler/ |
| liveness-analyzer.h | 23 void ClearNonLiveFrameStateSlots(Node* frame_state, BitVector* liveness);
37 Node* ClearNonLiveStateValues(Node* frame_state, BitVector* liveness);
49 BitVector permanently_live_;
116 void Process(BitVector* result, NonLiveFrameStateSlotReplacer* relaxer);
117 bool UpdateLive(BitVector* working_area);
135 BitVector live_;
|
| ast-loop-assignment-analyzer.h | 23 BitVector* GetVariablesAssignedInLoop(IterationStatement* loop) {
37 ZoneVector<std::pair<IterationStatement*, BitVector*>> list_;
57 ZoneDeque<BitVector*> loop_stack_;
|
| /external/llvm/include/llvm/ADT/ |
| BitVector.h | 1 //===- llvm/ADT/BitVector.h - Bit vectors -----------------------*- C++ -*-===//
10 // This file implements the BitVector class.
27 class BitVector {
36 unsigned Size; // Size of bitvector in bits.
43 friend class BitVector;
51 reference(BitVector &b, unsigned Idx) {
77 /// BitVector default ctor - Creates an empty bitvector.
78 BitVector() : Size(0), Capacity(0) {
82 /// BitVector ctor - Creates a bitvector of specified number of bits. Al
[all...] |
| SmallBitVector.h | 17 #include "llvm/ADT/BitVector.h"
24 /// SmallBitVector - This is a 'bitvector' (really, a variable-sized bit array),
32 // TODO: In "large" mode, a pointer to a BitVector is used, leading to an
94 BitVector *getPointer() const {
96 return reinterpret_cast<BitVector *>(X);
105 void switchToLarge(BitVector *BV) {
142 /// SmallBitVector default ctor - Creates an empty bitvector.
145 /// SmallBitVector ctor - Creates a bitvector of specified number of bits. All
151 switchToLarge(new BitVector(s, t));
159 switchToLarge(new BitVector(*RHS.getPointer()))
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonGenMux.cpp | 63 BitVector Defs, Uses;
65 DefUseInfo(const BitVector &D, const BitVector &U) : Defs(D), Uses(U) {}
85 void getSubRegs(unsigned Reg, BitVector &SRs) const;
86 void expandReg(unsigned Reg, BitVector &Set) const;
87 void getDefsUses(const MachineInstr *MI, BitVector &Defs,
88 BitVector &Uses) const;
104 void HexagonGenMux::getSubRegs(unsigned Reg, BitVector &SRs) const {
110 void HexagonGenMux::expandReg(unsigned Reg, BitVector &Set) const {
118 void HexagonGenMux::getDefsUses(const MachineInstr *MI, BitVector &Defs
[all...] |
| /art/compiler/optimizing/ |
| stack_map_stream.h | 100 BitVector* sp_mask;
105 BitVector* live_dex_registers_mask;
115 BitVector* live_dex_registers_mask;
122 BitVector* sp_mask,
157 const BitVector* live_dex_registers_mask) const;
167 const BitVector& live_dex_registers_mask,
173 BitVector* live_dex_registers_mask,
|
| /external/llvm/include/llvm/CodeGen/ |
| RegisterScavenging.h | 20 #include "llvm/ADT/BitVector.h"
63 BitVector RegUnitsAvailable;
67 BitVector KillRegUnits, DefRegUnits;
68 BitVector TmpRegUnits;
109 BitVector getRegsAvailable(const TargetRegisterClass *RC);
156 void setUsed(BitVector &RegUnits) {
159 void setUnused(BitVector &RegUnits) {
168 void addRegUnits(BitVector &BV, unsigned Reg);
175 BitVector &Candidates,
|
| /external/llvm/lib/Target/AMDGPU/ |
| AMDGPURegisterInfo.h | 19 #include "llvm/ADT/BitVector.h"
36 BitVector getReservedRegs(const MachineFunction &MF) const override {
37 assert(!"Unimplemented"); return BitVector();
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| AMDGPURegisterInfo.h | 18 #include "llvm/ADT/BitVector.h"
38 virtual BitVector getReservedRegs(const MachineFunction &MF) const {
39 assert(!"Unimplemented"); return BitVector();
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/sets/ |
| ANTLRBitSetTest.m | 23 STAssertEquals(actual, expected, @"There should be three bits set in bitvector. But I have %d", actual);
45 STAssertEquals(actual, expected, @"There should be four bits set in bitvector. But I have %d", actual);
58 STAssertEquals(actual, expected, @"There should be three bits set in bitvector. But I have %d", actual);
83 STAssertEquals(actual, (CFIndex)[bitSet numBits], @"There should be three bits set in bitvector. But I have %d", [copy numBits]);
|
