Home
last modified time | relevance | path

Searched refs:bits_per_entry (Results 1 – 25 of 85) sorted by relevance

1234

/dports/multimedia/v4l_compat/linux-5.13-rc2/fs/omfs/
H A Dbitmap.c95 int bits_per_entry = 8 * sb->s_blocksize; in omfs_allocate_block() local
101 bit = do_div(tmp, bits_per_entry); in omfs_allocate_block()
137 int bits_per_entry = 8 * sb->s_blocksize; in omfs_allocate_range() local
144 while (bit < bits_per_entry) { in omfs_allocate_range()
148 if (bit == bits_per_entry) in omfs_allocate_range()
151 run = count_run(&sbi->s_imap[i], bits_per_entry, in omfs_allocate_range()
163 *return_block = (u64) i * bits_per_entry + bit; in omfs_allocate_range()
165 ret = set_run(sb, i, bits_per_entry, bit, run, 1); in omfs_allocate_range()
178 int bits_per_entry = 8 * sb->s_blocksize; in omfs_clear_range() local
184 bit = do_div(tmp, bits_per_entry); in omfs_clear_range()
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/fs/omfs/
H A Dbitmap.c95 int bits_per_entry = 8 * sb->s_blocksize; in omfs_allocate_block() local
101 bit = do_div(tmp, bits_per_entry); in omfs_allocate_block()
137 int bits_per_entry = 8 * sb->s_blocksize; in omfs_allocate_range() local
144 while (bit < bits_per_entry) { in omfs_allocate_range()
148 if (bit == bits_per_entry) in omfs_allocate_range()
151 run = count_run(&sbi->s_imap[i], bits_per_entry, in omfs_allocate_range()
163 *return_block = (u64) i * bits_per_entry + bit; in omfs_allocate_range()
165 ret = set_run(sb, i, bits_per_entry, bit, run, 1); in omfs_allocate_range()
178 int bits_per_entry = 8 * sb->s_blocksize; in omfs_clear_range() local
184 bit = do_div(tmp, bits_per_entry); in omfs_clear_range()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/fs/omfs/
H A Dbitmap.c95 int bits_per_entry = 8 * sb->s_blocksize; in omfs_allocate_block() local
101 bit = do_div(tmp, bits_per_entry); in omfs_allocate_block()
137 int bits_per_entry = 8 * sb->s_blocksize; in omfs_allocate_range() local
144 while (bit < bits_per_entry) { in omfs_allocate_range()
148 if (bit == bits_per_entry) in omfs_allocate_range()
151 run = count_run(&sbi->s_imap[i], bits_per_entry, in omfs_allocate_range()
163 *return_block = (u64) i * bits_per_entry + bit; in omfs_allocate_range()
165 ret = set_run(sb, i, bits_per_entry, bit, run, 1); in omfs_allocate_range()
178 int bits_per_entry = 8 * sb->s_blocksize; in omfs_clear_range() local
184 bit = do_div(tmp, bits_per_entry); in omfs_clear_range()
[all …]
/dports/lang/v8/v8-9.6.180.12/src/codegen/
H A Dsafepoint-table.cc112 void SafepointTableBuilder::Emit(Assembler* assembler, int bits_per_entry) { in Emit() argument
114 TrimEntries(&bits_per_entry); in Emit()
128 RoundUp(bits_per_entry, kBitsPerByte) >> kBitsPerByteLog2; in Emit()
166 DCHECK_GT(bits_per_entry, idx); in Emit()
167 int index = bits_per_entry - 1 - idx; in Emit()
202 void SafepointTableBuilder::TrimEntries(int* bits_per_entry) { in TrimEntries() argument
203 int min_index = *bits_per_entry; in TrimEntries()
208 DCHECK_GT(*bits_per_entry, idx); // Validity check. in TrimEntries()
216 *bits_per_entry -= min_index; in TrimEntries()
/dports/sysutils/vector/vector-0.10.0/cargo-crates/bloom-0.3.2/src/
H A Dcounting.rs24 bits_per_entry: usize, in with_size()
27 counters: ValueVec::new(bits_per_entry, num_entries), in with_size()
39 …pub fn with_rate(bits_per_entry: usize, rate: f32, expected_num_items: u32) -> CountingBloomFilter… in with_rate()
42 bits_per_entry, in with_rate()
80 bits_per_entry: usize, in with_size_and_hashers()
84 counters: ValueVec::new(bits_per_entry, num_entries), in with_size_and_hashers()
101 pub fn with_rate_and_hashers(bits_per_entry: usize, rate: f32, expected_num_items: u32, in with_rate_and_hashers()
104 CountingBloomFilter::with_size_and_hashers(entries,bits_per_entry, in with_rate_and_hashers()
/dports/misc/libpostal/libpostal-1.1-alpha/src/
H A Dbloom.c74 bloom->bits_per_entry = -(log(error) / LOG2_SQUARED); in bloom_filter_new()
76 bloom->num_bits = (uint64_t)((double)capacity * bloom->bits_per_entry);\ in bloom_filter_new()
79 bloom->num_hashes = (uint32_t)ceil(LOG2 * bloom->bits_per_entry); in bloom_filter_new()
121 if (!file_write_double(f, self->bits_per_entry)) { in bloom_filter_write()
179 if (!file_read_double(f, &bloom->bits_per_entry)) { in bloom_filter_read()
/dports/www/squid/squid-4.15/src/
H A DCacheDigest.cc40 const auto newMaskSz = CacheDigest::CalcMaskSize(newCapacity, bits_per_entry); in init()
41 assert(newCapacity > 0 && bits_per_entry > 0); in init()
46 debugs(70, 2, "capacity: " << capacity << " entries, bpe: " << bits_per_entry << "; size: " in init()
56 bits_per_entry(bpe) in CacheDigest()
70 CacheDigest *cl = new CacheDigest(capacity, bits_per_entry); in clone()
273 cd->bits_per_entry, in cacheDigestReport()
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/interpreter/
H A DoopMapCache.hpp76 bits_per_entry = 2, enumerator
114 …uintptr_t entry_at(int offset) const { int i = offset * bits_per_entry; return bit_mask(… in entry_at()
138 int number_of_entries() const { return mask_size() / bits_per_entry; } in number_of_entries()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/interpreter/
H A DoopMapCache.hpp76 bits_per_entry = 2, enumerator
114 …uintptr_t entry_at(int offset) const { int i = offset * bits_per_entry; return bit_mask(… in entry_at()
138 int number_of_entries() const { return mask_size() / bits_per_entry; } in number_of_entries()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/interpreter/
H A DoopMapCache.hpp77 bits_per_entry = 2, enumerator
115 …uintptr_t entry_at(int offset) const { int i = offset * bits_per_entry; return bit_mask(… in entry_at()
139 int number_of_entries() const { return mask_size() / bits_per_entry; } in number_of_entries()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/interpreter/
H A DoopMapCache.hpp77 bits_per_entry = 2, enumerator
115 …uintptr_t entry_at(int offset) const { int i = offset * bits_per_entry; return bit_mask(… in entry_at()
139 int number_of_entries() const { return mask_size() / bits_per_entry; } in number_of_entries()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/interpreter/
H A DoopMapCache.hpp77 bits_per_entry = 2, enumerator
115 …uintptr_t entry_at(int offset) const { int i = offset * bits_per_entry; return bit_mask(… in entry_at()
139 int number_of_entries() const { return mask_size() / bits_per_entry; } in number_of_entries()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/interpreter/
H A DoopMapCache.hpp76 bits_per_entry = 2, enumerator
114 …uintptr_t entry_at(int offset) const { int i = offset * bits_per_entry; return bit_mask(… in entry_at()
138 int number_of_entries() const { return mask_size() / bits_per_entry; } in number_of_entries()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/interpreter/
H A DoopMapCache.hpp77 bits_per_entry = 2, enumerator
115 …uintptr_t entry_at(int offset) const { int i = offset * bits_per_entry; return bit_mask(… in entry_at()
139 int number_of_entries() const { return mask_size() / bits_per_entry; } in number_of_entries()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/interpreter/
H A DoopMapCache.hpp77 bits_per_entry = 2, enumerator
115 …uintptr_t entry_at(int offset) const { int i = offset * bits_per_entry; return bit_mask(… in entry_at()
139 int number_of_entries() const { return mask_size() / bits_per_entry; } in number_of_entries()
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/interpreter/
H A DoopMapCache.hpp76 bits_per_entry = 2, enumerator
114 …uintptr_t entry_at(int offset) const { int i = offset * bits_per_entry; return bit_mask(… in entry_at()
138 int number_of_entries() const { return mask_size() / bits_per_entry; } in number_of_entries()
H A DoopMapCache.cpp205 for (int i = 0; i < n; i++, mask <<= bits_per_entry) { in iterate_oop()
225 for (int i = 0; i < n; i++, mask <<= bits_per_entry) { in iterate_all()
260 i *= InterpreterOopMap::bits_per_entry; in set_one()
345 set_mask_size(mh->size_of_parameters() * bits_per_entry); in fill_for_native()
375 set_mask_size(n_entries * bits_per_entry); in set_mask()
385 …for (int entry_index = 0; entry_index < n_entries; entry_index++, mask <<= bits_per_entry, cell++)… in set_mask()
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/interpreter/
H A DoopMapCache.hpp76 bits_per_entry = 2, enumerator
114 …uintptr_t entry_at(int offset) const { int i = offset * bits_per_entry; return bit_mask(… in entry_at()
138 int number_of_entries() const { return mask_size() / bits_per_entry; } in number_of_entries()
/dports/graphics/libjxl/libjxl-0.6.1/lib/jxl/
H A Ddec_context_map.cc65 int bits_per_entry = input->ReadFixedBits<2>(); in DecodeContextMap() local
66 if (bits_per_entry != 0) { in DecodeContextMap()
68 (*context_map)[i] = input->ReadBits(bits_per_entry); in DecodeContextMap()
/dports/www/firefox/firefox-99.0/third_party/jpeg-xl/lib/jxl/
H A Ddec_context_map.cc65 int bits_per_entry = input->ReadFixedBits<2>(); in DecodeContextMap() local
66 if (bits_per_entry != 0) { in DecodeContextMap()
68 (*context_map)[i] = input->ReadBits(bits_per_entry); in DecodeContextMap()
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/jpeg-xl/lib/jxl/
H A Ddec_context_map.cc65 int bits_per_entry = input->ReadFixedBits<2>(); in DecodeContextMap() local
66 if (bits_per_entry != 0) { in DecodeContextMap()
68 (*context_map)[i] = input->ReadBits(bits_per_entry); in DecodeContextMap()
/dports/www/firefox-esr/firefox-91.8.0/third_party/jpeg-xl/lib/jxl/
H A Ddec_context_map.cc65 int bits_per_entry = input->ReadFixedBits<2>(); in DecodeContextMap() local
66 if (bits_per_entry != 0) { in DecodeContextMap()
68 (*context_map)[i] = input->ReadBits(bits_per_entry); in DecodeContextMap()
/dports/multimedia/libv4l/linux-5.13-rc2/scripts/gdb/linux/
H A Dcpus.py79 bits_per_entry = mask[0].type.sizeof * 8
80 num_entries = mask.type.sizeof * 8 / bits_per_entry
98 cpu = entry * bits_per_entry + bit
/dports/multimedia/v4l_compat/linux-5.13-rc2/scripts/gdb/linux/
H A Dcpus.py79 bits_per_entry = mask[0].type.sizeof * 8
80 num_entries = mask.type.sizeof * 8 / bits_per_entry
98 cpu = entry * bits_per_entry + bit
/dports/multimedia/v4l-utils/linux-5.13-rc2/scripts/gdb/linux/
H A Dcpus.py79 bits_per_entry = mask[0].type.sizeof * 8
80 num_entries = mask.type.sizeof * 8 / bits_per_entry
98 cpu = entry * bits_per_entry + bit

1234