Home
last modified time | relevance | path

Searched refs:sz (Results 1 - 25 of 78) sorted by relevance

1234

/6.6.0/couchstore/src/views/
H A Dvalues.cc51 uint32_t sz = dec_raw24(bytes); in decode_view_btree_value() local
55 v.values[i].size = sz; in decode_view_btree_value()
57 sized_buf_area += sz; in decode_view_btree_value()
59 memcpy(v.values[i].buf, bytes, sz); in decode_view_btree_value()
60 bytes += sz; in decode_view_btree_value()
61 len -= sz; in decode_view_btree_value()
90 auto sz = dec_raw24(bytes); in decode_view_btree_partition_and_num_values() local
94 cb_assert(len >= sz); in decode_view_btree_partition_and_num_values()
95 bytes += sz; in decode_view_btree_partition_and_num_values()
96 len -= sz; in decode_view_btree_partition_and_num_values()
109 size_t sz = 0; encode_view_btree_value() local
151 size_t sz, length; decode_view_id_btree_value() local
275 size_t sz = 0; encode_view_id_btree_value() local
[all...]
H A Dkeys.cc18 uint16_t sz; in decode_view_btree_json_key() local
20 sz = dec_uint16(bytes); in decode_view_btree_json_key()
25 key.size = sz; in decode_view_btree_json_key()
26 key.buf = (char*)cb_malloc(sz); in decode_view_btree_json_key()
32 cb_assert(len >= sz); in decode_view_btree_json_key()
33 memcpy(key.buf, bytes, sz); in decode_view_btree_json_key()
42 uint16_t sz; in decode_view_btree_key() local
53 sz = dec_uint16(bytes); in decode_view_btree_key()
58 k->json_key.size = sz; in decode_view_btree_key()
59 k->json_key.buf = (char *) cb_malloc(sz); in decode_view_btree_key()
97 size_t sz = 0; encode_view_btree_key() local
183 size_t sz = 0; encode_view_id_btree_key() local
[all...]
H A Dreductions.cc39 uint16_t sz; in decode_view_btree_reduction() local
57 sz = dec_uint16(bs); in decode_view_btree_reduction()
61 cb_assert(len >= sz); in decode_view_btree_reduction()
62 bs += sz; in decode_view_btree_reduction()
63 len -= sz; in decode_view_btree_reduction()
65 buffer_size += sz; in decode_view_btree_reduction()
92 sz = dec_uint16(bytes); in decode_view_btree_reduction()
96 r.reduce_values[i].size = sz; in decode_view_btree_reduction()
99 memcpy(r.reduce_values[i].buf, bytes, sz); in decode_view_btree_reduction()
100 bytes += sz; in decode_view_btree_reduction()
114 size_t sz = 0; encode_view_btree_reduction() local
198 size_t sz = 0; encode_view_id_btree_reduction() local
[all...]
H A Dindex_header.cc57 uint16_t num_seqs, i, j, sz, num_part_versions; in decode_index_header() local
127 sz = dec_uint16(b); in decode_index_header()
129 h->id_btree_state = read_root((void *) b, (int) sz); in decode_index_header()
130 b += sz; in decode_index_header()
141 sz = dec_uint16(b); in decode_index_header()
143 h->view_states[i] = read_root((void *) b, (int) sz); in decode_index_header()
144 b += sz; in decode_index_header()
150 sz = dec_uint16(b); in decode_index_header()
157 for (i = 0; i < sz; ++i) { in decode_index_header()
166 sz in decode_index_header()
291 size_t sz = 2; size_of_partition_versions() local
310 size_t sz = 0; encode_index_header() local
[all...]
/6.6.0/goproj/src/github.com/couchbase/query/util/
H A Dcache_test.go52 sz := 49
59 if s != sz {
60 t.Errorf("Delete test: expected %v elements, got %v", sz, s)
67 if s != sz {
68 t.Errorf("Delete test: expected %v elements, got %v", sz, s)
76 if s != sz {
77 t.Errorf("Update test: expected %v elements, got %v", sz, s)
94 if s != sz {
95 t.Errorf("Foreach test: expected %v elements, got %v", sz, s)
98 for i := 0; i < sz;
[all...]
/6.6.0/goproj/src/github.com/couchbase/nitro/mm/
H A Dmalloc.c43 void *mm_malloc(size_t sz) { in mm_malloc() argument
45 return je_calloc(1, sz); in mm_malloc()
47 return calloc(1, sz); in mm_malloc()
76 size_t resident, sz; in mm_size() local
77 sz = sizeof(size_t); in mm_size()
81 sz = sizeof(epoch); in mm_size()
82 je_mallctl("epoch", &epoch, &sz, &epoch, sz); in mm_size()
84 je_mallctl("stats.resident", &resident, &sz, NULL, 0); in mm_size()
/6.6.0/goproj/src/github.com/couchbase/indexing/secondary/indexer/
H A Dindex_entry.go116 desc []bool, buf []byte, meta *MutationMeta, sz keySizeConfig) (secondaryIndexEntry, error) {
118 return NewSecondaryIndexEntry2(key, docid, isArray, count, desc, buf, true, meta, sz)
123 sz keySizeConfig) (secondaryIndexEntry, error) {
133 if !sz.allowLargeKeys && validateSize && len(key) > sz.maxArrayKeyLength {
134 return nil, errors.New(fmt.Sprintf("Secondary array key is too long (> %d)", sz.maxArrayKeyLength))
136 } else if !sz.allowLargeKeys && validateSize && len(key) > sz.maxSecKeyLen {
137 return nil, errors.New(fmt.Sprintf("Secondary key is too long (> %d)", sz.maxSecKeyLen))
147 if !sz
[all...]
H A Darray.go91 isDistinct, checkSize bool, sz keySizeConfig) ([][]byte, []int, int, error) {
123 if checkSize && (l-from) > sz.maxSecKeyBufferLen {
124 logging.Errorf("Encoded array item key too long. Length of key = %v, Limit = %v", l-from, sz.maxSecKeyBufferLen)
127 if checkSize && l > sz.maxArrayIndexEntrySize {
128 logging.Errorf("Encoded array key too long. Length of key = %v, Limit = %v", l, sz.maxArrayIndexEntrySize)
/6.6.0/goproj/src/github.com/couchbase/indexing/secondary/stubs/nitro/plasma/
H A Dplasma_enterprise.go11 func SetMemoryQuota(sz int64) {
12 ee.SetMemoryQuota(sz)
15 func SetLogReclaimBlockSize(sz int64) {
16 ee.SetLogReclaimBlockSize(sz)
/6.6.0/kv_engine/daemon/
H A Dexecutorpool.cc27 cb::ExecutorPool::ExecutorPool(size_t sz) in ExecutorPool() argument
28 : ExecutorPool(sz, cb::defaultProcessClockSource()) { in ExecutorPool()
31 cb::ExecutorPool::ExecutorPool(size_t sz, cb::ProcessClockSource& clock) { in ExecutorPool() argument
33 executors.reserve(sz); in ExecutorPool()
34 for (size_t ii = 0; ii < sz; ++ii) { in ExecutorPool()
/6.6.0/couchdb/src/couch_view_parser/yajl/
H A Dyajl_alloc.c26 static void * yajl_internal_malloc(void *ctx, size_t sz) in yajl_internal_malloc() argument
28 return malloc(sz); in yajl_internal_malloc()
32 size_t sz) in yajl_internal_realloc()
34 return realloc(previous, sz); in yajl_internal_realloc()
31 yajl_internal_realloc(void *ctx, void * previous, size_t sz) yajl_internal_realloc() argument
H A Dyajl_alloc.h28 #define YA_MALLOC(afs, sz) (afs)->malloc((afs)->ctx, (sz))
30 #define YA_REALLOC(afs, ptr, sz) (afs)->realloc((afs)->ctx, (ptr), (sz))
/6.6.0/couchdb/src/ejson/yajl/
H A Dyajl_alloc.c42 static void * yajl_internal_malloc(void *ctx, unsigned int sz) in yajl_internal_malloc() argument
44 return malloc(sz); in yajl_internal_malloc()
48 unsigned int sz) in yajl_internal_realloc()
50 return realloc(previous, sz); in yajl_internal_realloc()
47 yajl_internal_realloc(void *ctx, void * previous, unsigned int sz) yajl_internal_realloc() argument
H A Dyajl_alloc.h44 #define YA_MALLOC(afs, sz) (afs)->malloc((afs)->ctx, (sz))
46 #define YA_REALLOC(afs, ptr, sz) (afs)->realloc((afs)->ctx, (ptr), (sz))
/6.6.0/godeps/src/google.golang.org/grpc/internal/transport/
H A Dflowcontrol.go43 func newWriteQuota(sz int32, done <-chan struct{}) *writeQuota {
45 quota: sz,
53 func (w *writeQuota) get(sz int32) error {
56 atomic.AddInt32(&w.quota, -sz)
69 sz := int32(n)
70 a := atomic.AddInt32(&w.quota, sz)
71 b := a - sz
/6.6.0/platform/include/platform/compression/
H A Dbuffer.h52 * @param sz The new size for the buffer
55 void resize(size_t sz) { in resize() argument
56 if (sz > capacity_) { in resize()
57 memory.reset(allocator.allocate(sz)); in resize()
58 capacity_ = sz; in resize()
60 size_ = sz; in resize()
/6.6.0/godeps/src/google.golang.org/grpc/test/bufconn/
H A Dbufconn.go35 sz int
44 func Listen(sz int) *Listener {
45 return &Listener{sz: sz, ch: make(chan net.Conn), done: make(chan struct{})}
80 p1, p2 := newPipe(l.sz), newPipe(l.sz)
111 func newPipe(sz int) *pipe {
112 p := &pipe{buf: make([]byte, 0, sz)}
/6.6.0/godeps/src/github.com/etcd-io/bbolt/
H A Dbolt_windows.go95 func mmap(db *DB, sz int) error {
98 if err := db.file.Truncate(int64(sz)); err != nil {
104 sizelo := uint32(sz >> 32)
105 sizehi := uint32(sz) & 0xffffffff
112 addr, errno := syscall.MapViewOfFile(h, syscall.FILE_MAP_READ, 0, 0, uintptr(sz))
124 db.datasz = sz
H A Ddb.go381 sz := int64(size)
382 if remainder := sz % int64(maxMmapStep); remainder > 0 {
383 sz += int64(maxMmapStep) - remainder
389 if (sz % pageSize) != 0 {
390 sz = ((sz / pageSize) + 1) * pageSize
394 if sz > maxMapSize {
395 sz = maxMapSize
398 return int(sz), nil
926 // grow grows the size of the database to the given sz
[all...]
H A Dbolt_unix_solaris.go56 func mmap(db *DB, sz int) error {
58 b, err := unix.Mmap(int(db.file.Fd()), 0, sz, syscall.PROT_READ, syscall.MAP_SHARED|db.MmapFlags)
71 db.datasz = sz
/6.6.0/ns_server/scripts/
H A Dproxy-testing.rb53 sz = self.read(4)
54 STDOUT.puts "sz: #{sz.inspect}"
55 sz.force_encoding(Encoding::ASCII_8BIT)
56 sz = sz.unpack("N")[0]
57 JSON.parse(self.read(sz))
/6.6.0/godeps/src/golang.org/x/tools/go/buildutil/
H A Doverlay.go84 sz, err := r.ReadString('\n')
88 sz = strings.TrimSpace(sz)
89 size, err := strconv.ParseUint(sz, 10, 32)
/6.6.0/kv_engine/engines/ep/src/
H A Dstats.cc156 void EPStats::memAllocated(size_t sz) { in memAllocated() argument
161 if (0 == sz) { in memAllocated()
167 // Update the coreMemory and also create a local copy of the old value + sz in memAllocated()
169 auto value = coreMemory.fetch_add(sz) + sz; in memAllocated()
174 void EPStats::memDeallocated(size_t sz) { in memDeallocated() argument
179 if (0 == sz) { in memDeallocated()
185 // Update the coreMemory and also create a local copy of the old value - sz in memDeallocated()
187 auto value = coreMemory.fetch_sub(sz) - sz; in memDeallocated()
[all...]
/6.6.0/kv_engine/engines/ep/src/couch-kvstore/
H A Dcouch-fs-stats.cc108 size_t sz, in pread()
111 stats.readSizeHisto.add(sz); in pread()
118 sz, off); in pread()
129 size_t sz, in pwrite()
132 stats.writeSizeHisto.add(sz); in pwrite()
135 sz, off); in pwrite()
105 pread(couchstore_error_info_t* errinfo, couch_file_handle h, void* buf, size_t sz, cs_off_t off) pread() argument
126 pwrite(couchstore_error_info_t*errinfo, couch_file_handle h, const void* buf, size_t sz, cs_off_t off) pwrite() argument
/6.6.0/phosphor/include/gsl_p/
H A Ddyn_array.h449 size_t sz = __il.size(); in dyn_array() local
450 __base_ = __allocate (sz); in dyn_array()
453 for ( __size_ = 0; __size_ < sz; ++__size_, ++__data, ++src ) in dyn_array()
461 size_t sz = __d.size(); in dyn_array() local
462 __base_ = __allocate (sz); in dyn_array()
465 for ( __size_ = 0; __size_ < sz; ++__size_, ++__data, ++src ) in dyn_array()

Completed in 54 milliseconds

1234