/6.0.3/platform/tests/pipe_test/ |
H A D | pipe_test.cc | 28 EXPECT_EQ(2048, buffer.produce([](void*, size_t size) -> ssize_t { in TEST_F() 29 return size; in TEST_F() 31 EXPECT_EQ(2048, buffer.consume([](const void*, size_t size) -> ssize_t { in TEST_F() 32 return size; in TEST_F() 42 buffer.produce([capacity](void*, size_t size) -> ssize_t { in TEST_F() 43 EXPECT_EQ(capacity, size); in TEST_F() 47 buffer.consume([](const void*, size_t size) -> ssize_t { in TEST_F() 49 EXPECT_EQ(0u, size); in TEST_F() 59 return message.size(); in TEST_F() 62 EXPECT_EQ(message.size(), buffe in TEST_F() [all...] |
/6.0.3/kv_engine/daemon/ |
H A D | darwin_zone.cc | 61 static void *zone_malloc(malloc_zone_t *zone, size_t size); 62 static void *zone_calloc(malloc_zone_t *zone, size_t num, size_t size); 63 static void *zone_valloc(malloc_zone_t *zone, size_t size); 65 static void *zone_realloc(malloc_zone_t *zone, void *ptr, size_t size); 67 size_t size); 69 size_t size); 72 static inline void invoke_new_hook(void* ptr, size_t size) { in invoke_new_hook() argument 74 (*new_hook)(ptr, size); in invoke_new_hook() 93 return default_zone->size(default_zone, ptr); in zone_size() 97 zone_malloc(malloc_zone_t *zone, size_t size) in zone_malloc() argument 105 zone_calloc(malloc_zone_t *zone, size_t num_items, size_t size) zone_calloc() argument 113 zone_valloc(malloc_zone_t *zone, size_t size) zone_valloc() argument 128 zone_realloc(malloc_zone_t *zone, void *ptr, size_t size) zone_realloc() argument 137 zone_memalign(malloc_zone_t *zone, size_t alignment, size_t size) zone_memalign() argument 145 zone_free_definite_size(malloc_zone_t *zone, void *ptr, size_t size) zone_free_definite_size() argument [all...] |
/6.0.3/forestdb/utils/ |
H A D | memleak.h | 34 #define malloc(size) memleak_alloc(size, (char*)__FILE__, __LINE__) 35 #define calloc(nmemb, size) memleak_calloc(nmemb, size, (char*)__FILE__, __LINE__) 36 #define realloc(ptr, size) memleak_realloc(ptr, size); 42 #define posix_memalign(memptr, alignment, size) \ 43 memleak_posix_memalign(memptr, alignment, size, (char*)__FILE__, __LINE__) 45 #define memalign(alignment, size) \ 46 memleak_memalign(alignment, size, (cha [all...] |
H A D | crypto_primitives.h | 33 size_t size, in sha256() 36 CC_SHA256(src_buf, size, (uint8_t*)digest); in sha256() 44 size_t size) in aes256() 51 src_buf, size, dst_buf, size, &outSize); in aes256() 65 size_t size, in sha256() 68 unsigned long dummy = size; in sha256() 71 (unsigned long)size, (unsigned char*)digest, &dummy); in sha256() 79 size_t size) in aes256() 100 size, in aes256() 32 sha256(const void *src_buf, size_t size, void *digest) sha256() argument 39 aes256(bool encrypt, const void *key, const void *iv, void *dst_buf, const void *src_buf, size_t size) aes256() argument 64 sha256(const void *src_buf, size_t size, void *digest) sha256() argument 74 aes256(bool encrypt, const void *key, const void *iv, void *dst_buf, const void *src_buf, size_t size) aes256() argument 122 sha256(const void *src_buf, size_t size, void *digest) sha256() argument 132 aes256(bool encrypt, const void *key, const void *iv, void *dst_buf, const void *src_buf, size_t size) aes256() argument [all...] |
/6.0.3/kv_engine/engines/ep/src/ |
H A D | objectregistry.cc | 86 size_t size = getAllocSize(blob); in onCreateBlob() local 87 if (size == 0) { in onCreateBlob() 88 size = blob->getSize(); in onCreateBlob() 90 coreLocalStats->blobOverhead.fetch_add(size - blob->getSize()); in onCreateBlob() 92 coreLocalStats->currentSize.fetch_add(size); in onCreateBlob() 93 coreLocalStats->totalValueSize.fetch_add(size); in onCreateBlob() 104 size_t size = getAllocSize(blob); in onDeleteBlob() local 105 if (size == 0) { in onDeleteBlob() 106 size = blob->getSize(); in onDeleteBlob() 108 coreLocalStats->blobOverhead.fetch_sub(size in onDeleteBlob() 122 size_t size = getAllocSize(sv); onCreateStoredValue() local 140 size_t size = getAllocSize(sv); onDeleteStoredValue() local [all...] |
/6.0.3/kv_engine/engines/default_engine/ |
H A D | slabs.cc | 3 * Slabs memory allocation, based on powers-of-N. Slabs are up to 1MB in size 4 * and are divided into chunks. The chunk sizes start off at the size of the 6 * a multiplier factor from there, up to half the maximum slab size. The last 7 * slab size is always 1MB, since that's the maximum item size allowed by the 32 static void *memory_allocate(struct default_engine *engine, size_t size); 45 * Figures out which slab class (chunk size) is required to store an item of 46 * a given size. 48 * Given object size, return id to use when allocating/freeing memory for object 52 unsigned int slabs_clsid(struct default_engine *engine, const size_t size) { in slabs_clsid() argument 63 my_allocate(struct default_engine *e, size_t size) my_allocate() argument 94 unsigned int size = sizeof(hash_item) + (unsigned int)engine->config.chunk_size; slabs_init() local 205 do_slabs_alloc(struct default_engine *engine, const size_t size, unsigned int id) do_slabs_alloc() argument 257 do_slabs_free(struct default_engine *engine, void *ptr, const size_t size, unsigned int id) do_slabs_free() argument 373 memory_allocate(struct default_engine *engine, size_t size) memory_allocate() argument 402 slabs_alloc(struct default_engine *engine, size_t size, unsigned int id) slabs_alloc() argument 411 slabs_free(struct default_engine *engine, void *ptr, size_t size, unsigned int id) slabs_free() argument [all...] |
/6.0.3/moxi/src/ |
H A D | slabs.c | 3 * Slabs memory allocation, based on powers-of-N. Slabs are up to 1MB in size 4 * and are divided into chunks. The chunk sizes start off at the size of the 6 * a multiplier factor from there, up to half the maximum slab size. The last 7 * slab size is always 1MB, since that's the maximum item size allowed by the 21 unsigned int size; /* sizes of items */ member 25 unsigned int sl_total; /* size of previous array */ 34 unsigned int list_size; /* size of prev array */ 58 static void *memory_allocate(size_t size); 71 * Figures out which slab class (chunk size) i 78 slabs_clsid(const size_t size) slabs_clsid() argument 96 unsigned int size = sizeof(item) + settings.chunk_size; slabs_init() local 217 do_slabs_alloc(const size_t size, unsigned int id) do_slabs_alloc() argument 270 do_slabs_free(void *ptr, const size_t size, unsigned int id) do_slabs_free() argument 469 memory_allocate(size_t size) memory_allocate() argument 498 slabs_alloc(size_t size, unsigned int id) slabs_alloc() argument 507 slabs_free(void *ptr, size_t size, unsigned int id) slabs_free() argument [all...] |
/6.0.3/couchstore/src/ |
H A D | util.cc | 16 size_t size; in ebin_cmp() local 17 if (e2->size < e1->size) { in ebin_cmp() 18 size = e2->size; in ebin_cmp() 20 size = e1->size; in ebin_cmp() 23 int cmp = memcmp(e1->buf, e2->buf, size); in ebin_cmp() 25 if (size < e2->size) { in ebin_cmp() [all...] |
H A D | node_types.cc | 20 key->size = klen; in read_kv() 22 value->size = vlen; in read_kv() 30 *(raw_kv_length*)dst = encode_kv_length((uint32_t)key.size, (uint32_t)value.size); in write_kv() 32 memcpy(dst, key.buf, key.size); in write_kv() 33 dst += key.size; in write_kv() 34 memcpy(dst, value.buf, value.size); in write_kv() 35 dst += value.size; in write_kv() 39 node_pointer *read_root(void *buf, int size) in read_root() argument 41 if (size in read_root() [all...] |
H A D | arena.cc | 24 size_t size; // Size of available bytes after this header member 32 size_t chunk_size; // The size of chunks to allocate, as passed to new_arena 49 return (char*)chunk_start(chunk) + chunk->size; in chunk_end() 52 // Allocates a new chunk, attaches it to the arena, and allocates 'size' bytes from it. 53 static void* add_chunk(arena* a, size_t size) in add_chunk() argument 56 if (size > chunk_size) { in add_chunk() 57 chunk_size = size; // make sure the new chunk is big enough to fit 'size' bytes in add_chunk() 65 chunk->size = chunk_size; in add_chunk() 68 a->next_block = (char*)result + size; in add_chunk() 112 arena_alloc_unaligned(arena* a, size_t size) arena_alloc_unaligned() argument 128 arena_alloc(arena* a, size_t size) arena_alloc() argument [all...] |
/6.0.3/kv_engine/xattr/ |
H A D | blob.cc | 29 alloc_size(other.blob.size()) { in Blob() 30 decompressed.resize(other.decompressed.size()); in Blob() 32 other.decompressed.size(), in Blob() 42 size_t size) in Blob() 43 : blob(buffer), allocator(allocator_), alloc_size(size) { in Blob() 48 if (compressed && buffer.size()) { in assign() 52 {static_cast<const char*>(buffer.data()), buffer.size()}, in assign() 60 blob = {decompressed.data(), decompressed.size()}; in assign() 61 } else if (buffer.size()) { in assign() 62 // incoming data is not compressed, just get the size an in assign() 39 Blob(cb::char_buffer buffer, std::unique_ptr<char[]>& allocator_, bool compressed, size_t size) Blob() argument 76 const auto size = read_length(current); get() local 105 const auto size = read_length(current); prune_user_keys() local 127 const auto size = 4 + key.len + 1 + old.len + 1; remove() local 174 grow_buffer(uint32_t size) grow_buffer() argument 219 remove_segment(const size_t offset, const size_t size) remove_segment() argument 277 const auto size = read_length(current); get_system_size() local 296 const auto size = read_length(current); to_json() local [all...] |
H A D | utils.cc | 53 // may be the same size as the blob if the actual data payload is empty in validate() 54 auto size = get_body_offset(blob); in validate() local 55 if (size > blob.len) { in validate() 68 while (offset < size) { in validate() 73 if (offset + 7 > size) { in validate() 80 if (offset + kvsize > size) { in validate() 81 // The kvsize exceeds the blob size in validate() 86 const auto keybuf = trim_string({blob.buf + offset, size - offset}); in validate() 95 const auto valuebuf = trim_string({blob.buf + offset, size - offset}); in validate() 117 return offset == size; in validate() 122 check_len(uint32_t len, size_t size) check_len() argument [all...] |
/6.0.3/godeps/src/github.com/blevesearch/segment/ |
H A D | segment_words.go | 18692 } else if dr, size := utf8.DecodeRune(data[endPos+1:]); dr == utf8.RuneError && size == 1 { 18711 } else if dr, size := utf8.DecodeRune(data[endPos+1:]); dr == utf8.RuneError && size == 1 { 18746 } else if dr, size := utf8.DecodeRune(data[endPos+1:]); dr == utf8.RuneError && size == 1 { 18765 } else if dr, size := utf8.DecodeRune(data[endPos+1:]); dr == utf8.RuneError && size == 1 { 18784 _, size := utf8.DecodeRune(data[lastPos:]) 18785 lastPos += size [all...] |
/6.0.3/kv_engine/protocol/mcbp/libmcbp/ |
H A D | framebuilder_test.cc | 25 return cb::const_byte_buffer{(const uint8_t*)value.data(), value.size()}; in buffer() 29 std::string provided{(const char*)value.data(), value.size()}; in compare() 30 EXPECT_EQ(expected.size(), value.size()); in compare() 65 ResponseBuilder builder({backing_store.data(), backing_store.size()}); in TEST() 79 EXPECT_EQ(value.size(), response->getBodylen()); in TEST() 83 EXPECT_EQ(key.size(), response->getKeylen()); in TEST() 84 EXPECT_EQ(value.size() + key.size(), response->getBodylen()); in TEST() 88 EXPECT_EQ(extras.size(), respons in TEST() [all...] |
/6.0.3/sigar/src/os/win32/ |
H A D | peb.c | 39 DWORD size=sizeof(pbi); in sigar_pbi_get() local 52 size, NULL); in sigar_pbi_get() 62 size = sizeof(*peb); in sigar_pbi_get() 64 if (ReadProcessMemory(proc, pbi.PebBaseAddress, peb, size, NULL)) { in sigar_pbi_get() 77 DWORD size=sizeof(*rtl); in sigar_rtl_get() local 83 if (ReadProcessMemory(proc, peb.ProcessParameters, rtl, size, NULL)) { in sigar_rtl_get() 128 DWORD size; in sigar_proc_args_peb_get() local 134 size = rtl_bufsize(buf, rtl.CommandLine); in sigar_proc_args_peb_get() 135 if (size <= 0) { in sigar_proc_args_peb_get() 140 if (ReadProcessMemory(proc, rtl.CommandLine.Buffer, buf, size, NUL in sigar_proc_args_peb_get() 148 sigar_proc_env_peb_get(sigar_t *sigar, HANDLE proc, WCHAR *buf, DWORD size) sigar_proc_env_peb_get() argument [all...] |
/6.0.3/godeps/src/github.com/couchbase/vellum/regexp/ |
H A D | sparse.go | 20 size uint 23 func newSparseSet(size uint) *sparseSet { 25 dense: make([]uint, size), 26 sparse: make([]uint, size), 27 size: 0, 32 return int(s.size) 36 i := s.size 39 s.size++ 49 return i < s.size && s.dense[i] == ip 53 s.size [all...] |
/6.0.3/couchstore/tests/views/ |
H A D | reducers.cc | 95 key1.doc_id.size = sizeof("doc_00000057") - 1; in test_view_id_btree_reducer() 108 data1.view_keys_map[0].json_keys[0].size = sizeof("-321") - 1; in test_view_id_btree_reducer() 110 data1.view_keys_map[0].json_keys[1].size = sizeof("[123,\"foobar\"]") - 1; in test_view_id_btree_reducer() 116 data1.view_keys_map[1].json_keys[0].size = sizeof("[5,6,7]") - 1; in test_view_id_btree_reducer() 123 key2.doc_id.size = sizeof("foobar") - 1; in test_view_id_btree_reducer() 136 data2.view_keys_map[0].json_keys[0].size = sizeof("\"abc\"") - 1; in test_view_id_btree_reducer() 142 data2.view_keys_map[1].json_keys[0].size = sizeof("\"qwerty\"") - 1; in test_view_id_btree_reducer() 164 nl->data.size = data_bin1_size; in test_view_id_btree_reducer() 166 nl->key.size = key_bin1_size; in test_view_id_btree_reducer() 173 np->key.size in test_view_id_btree_reducer() [all...] |
/6.0.3/platform/include/platform/ |
H A D | sized_buffer.h | 35 * Struct representing a buffer of some known size. This is used to 81 : sized_buffer(str.data(), str.size()) { in sized_buffer() 88 : sized_buffer(&str[0], str.size()) { in sized_buffer() 96 : sized_buffer(vec.data(), vec.size()) { in sized_buffer() 103 : sized_buffer(vec.data(), vec.size()) { in sized_buffer() 112 * cb::sized_buffer<char> buf{vec.data(), vec.size()}; 135 return buf + size(); in end() 139 return buf + size(); in end() 143 return buf + size(); in cend() 157 if (pos >= size()) { in at() 202 constexpr size_type size() const { size() function 341 const size_t size = base.size() * sizeof(CharT); buffer_hash() local [all...] |
/6.0.3/kv_engine/tests/mcbp/ |
H A D | xattr_key_validator_test.cc | 38 EXPECT_TRUE(is_valid_xattr_key({key.data(), key.size()})); in TEST() 65 EXPECT_FALSE(is_valid_xattr_key({copy.data(), copy.size()})) in TEST() 68 EXPECT_TRUE(is_valid_xattr_key({copy.data(), copy.size()})) in TEST() 79 EXPECT_TRUE(is_valid_xattr_key({key.data(), key.size()})); in TEST() 84 EXPECT_TRUE(is_valid_xattr_key({key.data(), key.size()})); in TEST() 94 EXPECT_TRUE(is_valid_xattr_key({key.data(), key.size()})); in TEST() 97 EXPECT_FALSE(is_valid_xattr_key({key.data(), key.size()})); in TEST() 106 EXPECT_TRUE(is_valid_xattr_key({key.data(), key.size()})); in TEST() 109 EXPECT_TRUE(is_valid_xattr_key({key.data(), key.size()})); in TEST() 112 EXPECT_FALSE(is_valid_xattr_key({key.data(), key.size()})); in TEST() [all...] |
/6.0.3/kv_engine/cbcrypto/ |
H A D | cbcrypto.cc | 58 // calculate the size of the buffer to hold the hash object in hash() 103 ULONG(key.size()), in hash() 111 status = BCryptHashData(hHash, (PBYTE)data.data(), ULONG(data.size()), 0); in hash() 197 ULONG(pass.size()), in PBKDF2() 199 ULONG(salt.size()), in PBKDF2() 202 ULONG(ret.size()), in PBKDF2() 267 // Calculate the size of the buffer to hold the KeyObject. in AES_256_cbc() 306 ULONG(key.size()), in AES_256_cbc() 321 ret.resize(data.size() + iv.size()); in AES_256_cbc() [all...] |
/6.0.3/goproj/src/github.com/couchbase/indexing/secondary/indexer/ |
H A D | mutation.go | 61 size := int64(len(m.bucket)) 62 size += 8 + 4 + 8 + 8 //fixed cost of members 63 return size 107 var size int64 var 108 size = mk.meta.Size() 109 size += int64(len(mk.docid)) 111 size += m.Size() 114 size += 8 + 16 + 16 //fixed cost of members 115 return size 154 var size int6 var [all...] |
/6.0.3/platform/tests/crc32/ |
H A D | crc32c_bench.cc | 48 column_heads.push_back("Data size (bytes) "); in crc_results_banner() 80 // Allows us to print 2.0x when a is twice the size of b 104 avg_sw = avg_sw / timings_sw.size(); in crc_results() 105 avg_hw = avg_hw / timings_hw.size(); in crc_results() 106 avg_hw_opt = avg_hw_opt / timings_hw.size(); in crc_results() 120 for (size_t ii = 0; ii < column_heads.size(); ii++) { in crc_results() 176 for(size_t size = 32; size <= 8*(1024*1024); size = size * in main() [all...] |
/6.0.3/moxi/libmemcached/libmemcached/ |
H A D | allocators.c | 9 void *libmemcached_malloc(const memcached_st *ptr, const size_t size) in libmemcached_malloc() argument 11 return ptr->allocators.malloc(ptr, size, ptr->allocators.context); in libmemcached_malloc() 14 void *libmemcached_realloc(const memcached_st *ptr, void *mem, const size_t size) in libmemcached_realloc() argument 16 return ptr->allocators.realloc(ptr, mem, size, ptr->allocators.context); in libmemcached_realloc() 19 void *libmemcached_calloc(const memcached_st *ptr, size_t nelem, size_t size) in libmemcached_calloc() argument 21 return ptr->allocators.calloc(ptr, nelem, size, ptr->allocators.context); in libmemcached_calloc() 31 void *_libmemcached_malloc(const memcached_st *ptr, const size_t size, void *context) in _libmemcached_malloc() argument 35 return malloc(size); in _libmemcached_malloc() 38 void *_libmemcached_realloc(const memcached_st *ptr, void *mem, const size_t size, void *context) in _libmemcached_realloc() argument 42 return realloc(mem, size); in _libmemcached_realloc() 45 _libmemcached_calloc(const memcached_st *ptr, size_t nelem, size_t size, void *context) _libmemcached_calloc() argument [all...] |
/6.0.3/couchstore/tests/ |
H A D | documents.cc | 50 for (size_t ii = 0; ii < documents.size(); ii++) { in generateDocs() 78 return docs.size(); in getDocsCount() 82 return docInfos.size(); in getDocInfosCount() 140 EXPECT_EQ(0, std::memcmp(info->id.buf, docInfo->id.buf, info->id.size)); in checkCallback() 141 EXPECT_EQ(0, std::memcmp(info->rev_meta.buf, docInfo->rev_meta.buf, info->rev_meta.size)); in checkCallback() 142 EXPECT_EQ(info->id.size, docInfo->id.size); in checkCallback() 143 EXPECT_EQ(info->rev_meta.size, info->rev_meta.size); in checkCallback() 152 if (openDoc && doc->data.size > in checkCallback() [all...] |
/6.0.3/query-ui/query-ui/ui-current/data_display/ |
H A D | qw-json-datatable.directive.js | 325 meta.arrayInnerPrims.size + 'ch; max-width:' + 326 meta.arrayInnerPrims.size + 'ch"' + 333 var size = meta.innerKeys[fieldName].size; 334 headerHTML += '<span style="min-width: ' + size + 'ch; max-width:' + 335 size + 'ch"' + 'class="data-table-header-cell">' + mySanitize(fieldName) +'<span class="caret-subspan"></span></span>'; 344 var arraySize = meta.arrayInnerObjects.arrayInnerPrims.size; 346 // arraySize += meta.arrayInnerObjects.arrayInnerObjects.size; 355 var size = meta.arrayInnerObjects.innerKeys[fieldName].size; 740 var size = 0; global() variable [all...] |