| /external/icu/icu4c/source/test/intltest/ |
| strtest.cpp | 380 int32_t capacity = -1; local
381 char *dest = sink.GetAppendBuffer(0, 50, scratch, (int32_t)sizeof(scratch), &capacity);
382 if(dest != NULL || capacity != 0) {
386 dest = sink.GetAppendBuffer(10, 50, scratch, 9, &capacity);
387 if(dest != NULL || capacity != 0) {
391 dest = sink.GetAppendBuffer(5, 50, scratch, (int32_t)sizeof(scratch), &capacity);
392 if(dest != scratch || capacity != (int32_t)sizeof(scratch)) {
411 int32_t capacity = -1; local
412 char *dest = sink.GetAppendBuffer(0, 50, scratch, (int32_t)sizeof(scratch), &capacity);
413 if(dest != NULL || capacity != 0)
[all...] |
| /external/icu/icu4c/source/tools/toolutil/ |
| toolutil.cpp | 244 int32_t capacity, maxCapacity, size, idx; member in struct:UToolMemory
265 mem->capacity=initialCapacity;
295 utm_hasCapacity(UToolMemory *mem, int32_t capacity) {
296 if(mem->capacity<capacity) {
299 if(mem->maxCapacity<capacity) {
306 if(capacity>=2*mem->capacity) {
307 newCapacity=capacity;
308 } else if(mem->capacity<=mem->maxCapacity/3)
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| SimpleFormatterImpl.java | 293 int capacity = compiledPattern.length() - 1 - getArgumentLimit(compiledPattern); local
294 StringBuilder sb = new StringBuilder(capacity);
|
| /external/kernel-headers/original/uapi/linux/ |
| virtio_blk.h | 59 /* The capacity (in 512-byte sectors). */
60 __u64 capacity; member in struct:virtio_blk_config
|
| /external/libaom/libaom/common/ |
| obudec.c | 191 const size_t capacity = *obu_buffer_capacity; local
192 if (SIZE_MAX - growth_amount < capacity) {
193 fprintf(stderr, "obudec: cannot grow buffer, capacity will roll over.\n");
197 const size_t new_capacity = capacity + growth_amount;
|
| /external/libchrome/base/task/sequence_manager/ |
| lazily_deallocated_deque.h | 43 // Maximum "wasted" capacity allowed when considering if we should resize
62 size_t capacity() const { function in class:base::sequence_manager::internal::LazilyDeallocatedDeque
63 size_t capacity = 0; local
65 capacity += iter->capacity();
67 return capacity;
106 tail_->next_ = std::make_unique<Ring>(tail_->capacity() * 2);
140 // head one (which we expect to have lower capacity than the remaining
177 // Only realloc if the current capacity is sufficiently the observed maximum
179 if (new_capacity + kReclaimThreshold >= capacity())
233 size_t capacity() const { return capacity_; } function in struct:base::sequence_manager::internal::LazilyDeallocatedDeque::Ring
[all...] |
| /external/libchrome/mojo/core/ |
| channel.cc | 69 Channel::Message::Message(size_t capacity,
73 : Message(capacity, payload_size, max_handles, MessageType::NORMAL_LEGACY) {
76 : Message(capacity, payload_size, max_handles, MessageType::NORMAL) {
80 Channel::Message::Message(size_t capacity,
85 DCHECK_GE(capacity, payload_size);
116 capacity_ = header_size + extra_header_size + capacity;
272 size_t Channel::Message::capacity() const { function in class:mojo::core::Channel::Message
279 size_t capacity_without_header = capacity();
486 // The Reserve() method ensures that a certain capacity of unoccupied bytes are
487 // available. It does not claim that capacity and only allocates new capacit
[all...] |
| /external/mesa3d/src/gallium/drivers/r600/sb/ |
| sb_valtable.cpp | 310 unsigned capacity = block_size * blocks.size(); local
312 if (total_size + sz > capacity) {
313 total_size = capacity;
|
| /external/protobuf/ruby/ext/google/protobuf_c/ |
| protobuf.h | 352 int capacity; member in struct:__anon36105
|
| /external/protobuf/src/google/protobuf/stubs/ |
| stringpiece.h | 368 stringpiece_ssize_type capacity() const { return length_; } function in class:google::protobuf::StringPiece
|
| /external/skia/src/core/ |
| SkRWBuffer.cpp | 26 SkBufferBlock(size_t capacity) : fNext(nullptr), fUsed(0), fCapacity(capacity) {}
34 size_t capacity = LengthToCapacity(length); local
35 void* buffer = sk_malloc_throw(sizeof(SkBufferBlock) + capacity);
36 return new (buffer) SkBufferBlock(capacity);
71 SkBufferHead(size_t capacity) : fRefCnt(1), fBlock(capacity) {}
79 size_t capacity = LengthToCapacity(length); local
80 size_t size = sizeof(SkBufferHead) + capacity;
82 return new (buffer) SkBufferHead(capacity);
[all...] |
| SkTDynamicHash.h | 141 int capacity() const { return fCapacity; } function in class:SkTDynamicHash
168 // Is capacity sane?
|
| /external/skqp/src/core/ |
| SkRWBuffer.cpp | 26 SkBufferBlock(size_t capacity) : fNext(nullptr), fUsed(0), fCapacity(capacity) {}
34 size_t capacity = LengthToCapacity(length); local
35 void* buffer = sk_malloc_throw(sizeof(SkBufferBlock) + capacity);
36 return new (buffer) SkBufferBlock(capacity);
71 SkBufferHead(size_t capacity) : fRefCnt(1), fBlock(capacity) {}
79 size_t capacity = LengthToCapacity(length); local
80 size_t size = sizeof(SkBufferHead) + capacity;
82 return new (buffer) SkBufferHead(capacity);
[all...] |
| SkTDynamicHash.h | 141 int capacity() const { return fCapacity; } function in class:SkTDynamicHash
168 // Is capacity sane?
|
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| FileSystem.h | 85 uint64_t capacity; member in struct:llvm::sys::fs::space_info
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/DebugInfo/PDB/Native/ |
| HashTable.h | 111 support::ulittle32_t Capacity;
120 HashTable(uint32_t Capacity, TraitsT Traits) : Traits(Traits) {
121 Buckets.resize(Capacity);
128 if (H->Capacity == 0)
130 "Invalid Hash Table Capacity");
131 if (H->Size > maxLoad(H->Capacity))
135 Buckets.resize(H->Capacity);
191 H.Capacity = capacity();
217 uint32_t capacity() const { return Buckets.size(); function in class:llvm::pdb::HashTable
[all...] |
| /external/tensorflow/tensorflow/compiler/tf2tensorrt/utils/ |
| trt_lru_cache.h | 45 explicit LRUCache(size_t capacity) : capacity_(capacity) {}
47 size_t capacity() const { return capacity_; } function in class:tensorflow::tensorrt::LRUCache
49 void reserve(size_t capacity) {
50 capacity_ = capacity;
105 return errors::Internal("Insufficient capacity in cache (capacity = ",
144 TRTEngineCacheResource(OpKernelContext* ctx, size_t capacity)
145 : cache_(capacity) {
|
| /external/tensorflow/tensorflow/core/lib/gtl/ |
| flatrep.h | 272 const size_t capacity = (1 << lg) * kWidth; local
274 mask_ = capacity - 1;
279 grow_ = static_cast<size_t>(capacity * 0.8);
|
| /external/tensorflow/tensorflow/lite/java/src/main/native/ |
| nativeinterpreterwrapper_jni.cc | 320 jlong capacity = env->GetDirectBufferCapacity(model_buffer); local
321 if (!VerifyModel(buf, capacity)) {
328 buf, static_cast<size_t>(capacity), error_reporter);
|
| /external/u-boot/drivers/scsi/ |
| scsi.c | 361 lbaint_t *capacity, unsigned long *blksz)
363 *capacity = 0;
375 *capacity = ((lbaint_t)pccb->pdata[0] << 24) |
380 if (*capacity != 0xffffffff) {
381 /* Read capacity (10) was sufficient for this drive. */
389 /* Read capacity (10) was insufficient. Use read capacity (16). */
400 *capacity = ((uint64_t)pccb->pdata[0] << 56) |
494 lbaint_t capacity; local
542 if (scsi_read_capacity(dev, pccb, &capacity, &blksz))
[all...] |
| /external/v8/src/base/ |
| hashmap.h | 32 // The default capacity. This is used by the call sites which want
34 // default value of capacity specified by the implementation.
39 TemplateHashMapImpl(uint32_t capacity = kDefaultHashMapCapacity,
89 // The capacity of the table. The implementation
91 // the table capacity.
92 uint32_t capacity() const { return capacity_; } function in class:v8::base::TemplateHashMapImpl
111 void Initialize(uint32_t capacity, AllocationPolicy allocator);
335 uint32_t capacity, AllocationPolicy allocator) {
336 DCHECK(base::bits::IsPowerOfTwo(capacity));
337 map_ = reinterpret_cast<Entry*>(allocator.New(capacity * sizeof(Entry)))
[all...] |
| /external/v8/src/compiler/ |
| node.cc | 11 Node::OutOfLineInputs* Node::OutOfLineInputs::New(Zone* zone, int capacity) {
13 sizeof(OutOfLineInputs) + capacity * (sizeof(Node*) + sizeof(Use));
16 reinterpret_cast<OutOfLineInputs*>(raw_buffer + capacity * sizeof(Use));
17 outline->capacity_ = capacity;
71 int capacity = local
73 OutOfLineInputs* outline = OutOfLineInputs::New(zone, capacity);
88 int capacity = input_count; local
91 capacity = std::min(input_count + 3, max);
94 size_t size = sizeof(Node) + capacity * (sizeof(Node*) + sizeof(Use));
97 reinterpret_cast<void*>(raw_buffer + capacity * sizeof(Use))
[all...] |
| /external/v8/src/ |
| identity-map.h | 23 int capacity() const { return capacity_; } function in class:v8::internal::IdentityMapBase
170 Iterator end() { return Iterator(map_, map_->capacity()); }
|
| /external/v8/src/interpreter/ |
| constant-array-builder.h | 41 // Capacity of the 8-bit operand slice.
44 // Capacity of the 16-bit operand slice.
47 // Capacity of the 32-bit operand slice.
192 ConstantArraySlice(Zone* zone, size_t start_index, size_t capacity,
204 inline size_t available() const { return capacity() - reserved() - size(); }
206 inline size_t capacity() const { return capacity_; } function in struct:v8::internal::interpreter::BASE_EMBEDDED::final
209 inline size_t max_index() const { return start_index_ + capacity() - 1; }
|
| /external/v8/src/objects/ |
| ordered-hash-table.cc | 17 Isolate* isolate, int capacity, PretenureFlag pretenure) {
18 // Capacity must be a power of two, since we depend on being able
19 // to divide and multiple by 2 (kLoadFactor) to derive capacity
21 // to something other than 2, capacity should be stored as another
23 capacity = base::bits::RoundUpToPowerOfTwo32(Max(kMinCapacity, capacity));
24 if (capacity > kMaxCapacity) {
27 int num_buckets = capacity / kLoadFactor;
30 kHashTableStartIndex + num_buckets + (capacity * kEntrySize), pretenure);
48 int capacity = table->Capacity() local
63 int capacity = table->Capacity(); local
505 int capacity = table->Capacity(); local
[all...] |
