Home
last modified time | relevance | path

Searched refs:memory_len (Results 1 – 10 of 10) sorted by relevance

/dports/finance/chiapos/chiapos-1.0.3/src/
H A Dquicksort.hpp31 uint64_t memory_len, in SortInner() argument
79 SortInner(memory, memory_len, L, bits_begin, begin, lo, pivot_space); in SortInner()
80 SortInner(memory, memory_len, L, bits_begin, lo + 1, end, pivot_space); in SortInner()
82 SortInner(memory, memory_len, L, bits_begin, lo + 1, end, pivot_space); in SortInner()
83 SortInner(memory, memory_len, L, bits_begin, begin, lo, pivot_space); in SortInner()
93 uint64_t const memory_len = (uint64_t)entry_len * num_entries; in Sort() local
95 SortInner(memory, memory_len, entry_len, bits_begin, 0, num_entries, pivot_space.get()); in Sort()
H A Duniformsort.hpp47 uint64_t const memory_len = Util::RoundSize(num_entries) * entry_len; in SortToMemory() local
53 memset(memory, 0, memory_len); in SortToMemory()
74 while (!IsPositionEmpty(memory + pos, entry_len) && pos < memory_len) { in SortToMemory()
91 for (uint64_t pos = 0; entries_written < num_entries && pos < memory_len; in SortToMemory()
/dports/finance/chiapos/chiapos-1.0.3/hellman_example/
H A Dsort_on_disk.hpp654 uint64_t memory_len = SortOnDiskUtils::RoundSize(num_entries) * entry_len_memory; in SortInMemory() local
663 memset(memory, 0, sizeof(memory[0])*memory_len); in SortInMemory()
687 …e (SortOnDiskUtils::IsPositionEmpty(memory + pos, entry_len_memory) == false && pos < memory_len) { in SortInMemory()
707 …for (uint64_t pos = 0; entries_written < num_entries && pos < memory_len; pos += entry_len_memory)… in SortInMemory()
736 uint64_t memory_len = (uint64_t)entry_len * num_entries; in QuickSort() local
738 QuickSortInner(memory, memory_len, entry_len, bits_begin, 0, num_entries, pivot_space); in QuickSort()
769 inline static void QuickSortInner(uint8_t* memory, uint64_t memory_len, in QuickSortInner() argument
812 QuickSortInner(memory, memory_len, L, bits_begin, begin, lo, pivot_space); in QuickSortInner()
813 QuickSortInner(memory, memory_len, L, bits_begin, lo + 1, end, pivot_space); in QuickSortInner()
815 QuickSortInner(memory, memory_len, L, bits_begin, lo + 1, end, pivot_space); in QuickSortInner()
[all …]
/dports/sysutils/vector/lucet-d4fc14a03bdb99ac83173d27fddf1aca48412a86/wasmtime/crates/wasi-common/wig/src/
H A Dhostcalls.rs123 memory_len: usize, in generate_wrappers()
128 std::slice::from_raw_parts_mut(memory, memory_len), in generate_wrappers()
/dports/finance/chiapos/chiapos-1.0.3/tests/
H A Dtest.cpp707 const uint32_t memory_len = 1000000; variable
708 SortManager manager(memory_len, 16, 4, size, ".", "test-files", 0, 1);
735 const uint32_t memory_len = 1000000; variable
736 SortManager manager(memory_len, 16, 4, size, ".", "test-files", 0, 1);
775 const uint32_t memory_len = Util::RoundSize(iters) * size; variable
776 auto memory = std::make_unique<uint8_t[]>(memory_len);
/dports/net/wireshark/wireshark-3.6.1/epan/dissectors/pidl/frsrpc/
H A Dfrsrpc.idl338 [value(pkt_len+12)] uint32 memory_len;
/dports/net/wireshark-lite/wireshark-3.6.1/epan/dissectors/pidl/frsrpc/
H A Dfrsrpc.idl338 [value(pkt_len+12)] uint32 memory_len;
/dports/net/tshark-lite/wireshark-3.6.1/epan/dissectors/pidl/frsrpc/
H A Dfrsrpc.idl338 [value(pkt_len+12)] uint32 memory_len;
/dports/net/tshark/wireshark-3.6.1/epan/dissectors/pidl/frsrpc/
H A Dfrsrpc.idl338 [value(pkt_len+12)] uint32 memory_len;
/dports/net/samba412/samba-4.12.15/librpc/idl/
H A Dfrsrpc.idl345 [value(pkt_len+12)] uint32 memory_len;