| /external/lzma/CPP/Windows/ |
| FileFind.h | 32 UInt64 Size;
|
| /external/opencv/cvaux/src/ |
| cvface.cpp | 144 long Size = Rect.width*Rect.height;
146 if ( (Size > SizeIdeal) || ( Size < (SizeIdeal/5) ) )
|
| /external/openfst/src/include/fst/ |
| bi-table.h | 54 // I Size() const;
77 table.entry2id_.size(),
92 id_ref = id2entry_.size();
104 I Size() const { return id2entry_.size(); }
160 keys_(table.keys_.size(), compact_hash_func_, compact_hash_equal_),
175 I key = id2entry_.size();
189 I Size() const { return id2entry_.size(); }
193 if (n < 0 || n > id2entry_.size())
[all...] |
| interval-set.h | 86 T Size() const { return intervals_.size(); }
125 return intervals_.size() == 1 &&
178 T size = 0; local
179 for (T i = 0; i < intervals_.size(); ++i) {
183 for (T j = i + 1; j < intervals_.size(); ++j) {
192 intervals_[size++] = inti;
194 intervals_.resize(size);
|
| sparse-tuple-weight.h | 179 size_t Size() const {
183 return rest_.size() + 1;
333 if(FLAGS_fst_weight_separator.size() != 1) {
334 FSTERROR() << "FLAGS_fst_weight_separator.size() is not equal to 1";
341 if (FLAGS_fst_weight_parentheses.size() != 2) {
342 FSTERROR() << "FLAGS_fst_weight_parentheses.size() is not equal to 2";
355 size_t n = w.Size();
374 if(FLAGS_fst_weight_separator.size() != 1) {
375 FSTERROR() << "FLAGS_fst_weight_separator.size() is not equal to 1";
382 if (FLAGS_fst_weight_parentheses.size() != 2)
[all...] |
| string-weight.h | 142 size_t Size() const { return first_ ? rest_.size() + 1 : 0; }
236 int32 size; local
237 ReadType(strm, &size);
238 for (int i = 0; i < size; ++i) {
248 int32 size = Size(); local
249 WriteType(strm, size);
259 if (Size() != 1)
298 if (w1.Size() != w2.Size()
[all...] |
| /art/compiler/utils/ |
| assembler.h | 187 CHECK_LE(position, Size() - static_cast<int>(sizeof(T)));
192 CHECK_LE(position, Size() - static_cast<int>(sizeof(T)));
200 size_t nbytes = Size() - oldposition;
208 fixup->set_position(Size());
233 // Get the size of the emitted code.
234 size_t Size() const {
262 // size before we start emitting to the buffer. This allows us to
264 // limit implied by the minimum gap size.
288 int ComputeGap() { return buffer_->Capacity() - buffer_->Size(); }
359 // Size of generated cod
[all...] |
| /art/runtime/base/ |
| hash_set.h | 264 size_t Size() const {
268 Resize(Size() / max_load_factor_);
289 return static_cast<double>(Size()) / static_cast<double>(NumBuckets());
359 size_t min_index = static_cast<size_t>(Size() / min_load_factor_);
368 // Expand / shrink the table to the new specified size.
370 DCHECK_GE(new_size, Size());
|
| /art/runtime/gc/space/ |
| space.h | 273 // Current size of space
274 size_t Size() const {
353 // Size of the space without a limit on its growth. By default this is just the Capacity, but
|
| /external/chromium_org/components/policy/core/browser/ |
| url_blacklist_manager.cc | 157 size_t size = std::min(kMaxFiltersPerPolicy, list->GetSize()); local
158 for (size_t i = 0; i < size; ++i) {
187 condition_set->query_conditions().size();
229 size_t URLBlacklist::Size() const {
230 return filters_.size();
|
| /external/chromium_org/content/browser/gpu/ |
| shader_disk_cache.cc | 320 buf_->size(),
327 if (rv && rv == buf_->size()) {
331 buf_->size()));
572 int32 ShaderDiskCache::Size() {
|
| /external/chromium_org/content/browser/ |
| storage_partition_impl_unittest.cc | 167 for (size_t i = 0; i < infos_.size(); ++i) {
376 EXPECT_EQ(0, cache_->Size());
386 size_t Size() { return cache_->Size(); }
403 EXPECT_EQ(1u, Size());
412 EXPECT_EQ(0u, Size());
[all...] |
| /external/chromium_org/net/disk_cache/blockfile/ |
| block_files.cc | 56 bool BlockHeader::CreateMapBlock(int size, int* index) {
57 DCHECK(size > 0 && size <= kMaxNumBlocks);
59 for (int i = size; i <= kMaxNumBlocks; i++) {
87 STRESS_DCHECK(*index / 4 == (*index + size - 1) / 4);
88 uint32 to_add = ((1 << size) - 1) << index_offset;
101 if (target != size) {
102 header_->empty[target - size - 1]++;
116 void BlockHeader::DeleteMapBlock(int index, int size) {
117 if (size < 0 || size > kMaxNumBlocks)
363 size_t size = address.BlockSize() * address.num_blocks(); local
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/helpers/memenv/ |
| memenv.cc | 50 uint64_t Size() const { return size_; }
54 return Status::IOError("Offset greater than file size.");
96 size_t src_len = data.size();
161 pos_ += result->size();
167 if (pos_ > file_->Size()) {
168 return Status::IOError("pos_ > file_->Size()");
170 const size_t available = file_->Size() - pos_;
292 if (filename.size() >= dir.size() + 1 && filename[dir.size()] == '/' &
[all...] |
| /external/chromium_org/third_party/lzma_sdk/ |
| 7z.h | 97 UInt64 Size;
168 if dest == NULL, the return value specifies the required size of the buffer,
181 size_t *outBufferSize, /* buffer size for output buffer */
183 size_t *outSizeProcessed, /* size of file in *outBuffer */
|
| /external/chromium_org/v8/include/ |
| v8-util.h | 43 static size_t Size(Impl* impl) { return impl->size(); }
128 * Return size of the map.
130 size_t Size() { return Traits::Size(&impl_); }
379 static size_t Size(const Impl* impl) {
380 return impl->size();
383 return (i < impl->size()) ? impl->at(i) : kPersistentContainerNotFound;
438 size_t Size() const {
439 return Traits::Size(&impl_)
[all...] |
| /external/clang/lib/AST/ |
| DeclTemplate.cpp | 60 unsigned Size = sizeof(TemplateParameterList)
64 void *Mem = C.Allocate(Size, Align);
101 if (size() == 0)
157 for (unsigned I = 0, N = PrevDecls.size(); I != N; ++I)
286 = new (getASTContext()) TemplateArgument[Params->size()];
291 return llvm::makeArrayRef(CommonPtr->InjectedArgs, Params->size());
399 PS.reserve(PartialSpecs.size());
453 TemplateArgs.resize(Params->size());
458 TemplateArgs.size());
626 return new (C, DC, sizeof(TemplateParameterList*) * Expansions.size())
[all...] |
| /external/clang/lib/Rewrite/Core/ |
| Rewriter.cpp | 53 void RewriteBuffer::RemoveText(unsigned OrigOffset, unsigned Size,
56 if (Size == 0) return;
59 assert(RealOffset+Size < Buffer.size() && "Invalid location");
62 Buffer.erase(RealOffset, Size);
65 AddReplaceDelta(OrigOffset, -Size);
106 AddInsertDelta(OrigOffset, Str.size());
117 if (OrigLength != NewStr.size())
118 AddReplaceDelta(OrigOffset, NewStr.size() - OrigLength);
126 /// getRangeSize - Return the size in bytes of the specified range if the
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| nt_io.c | 1046 // Get size
1159 // get size
1261 // set block size
1307 ULONG Size;
1328 Size = (count < 0) ? (ULONG)(-count) : (ULONG)(count * channel->block_size);
1336 if(Size <= NtData->BufferSize)
1348 SizeToRead = Size;
1359 Size, 0, Errno);
1370 ASSERT(Size <= SizeToRead);
1371 memcpy(buf, BufferToRead, Size);
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| SelfAdjointEigenSolver.h | 22 template<typename SolverType,int Size,bool IsComplex> struct direct_selfadjoint_eigenvalues;
74 Size = MatrixType::RowsAtCompileTime,
92 friend struct internal::direct_selfadjoint_eigenvalues<SelfAdjointEigenSolver,Size,NumTraits<Scalar>::IsComplex>;
97 * The length of the vector is the size of \p _MatrixType.
102 /** \brief Default constructor for fixed-size matrices.
106 * can only be used if \p _MatrixType is a fixed-size matrix; use
107 * SelfAdjointEigenSolver(Index) for dynamic-size matrices.
119 /** \brief Constructor, pre-allocates memory for dynamic-size matrices.
121 * \param [in] size Positive integer, size of the matrix whos
[all...] |
| /external/llvm/include/llvm/ADT/ |
| FoldingSet.h | 177 /// size - Returns the number of nodes in the folding set.
178 unsigned size() const { return NumNodes; } function in class:llvm::FoldingSetImpl
185 /// GrowHashTable - Double the size of the hash table and rehash everything.
270 size_t Size;
272 FoldingSetNodeIDRef() : Data(nullptr), Size(0) {}
273 FoldingSetNodeIDRef(const unsigned *D, size_t S) : Data(D), Size(S) {}
288 size_t getSize() const { return Size; }
632 /// size - Returns the number of nodes in the folding set.
633 unsigned size() const { return Set.size(); } function in class:llvm::FoldingSetVector
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| AliasSetTracker.h | 42 uint64_t Size;
46 : Val(V), PrevInList(nullptr), NextInList(nullptr), AS(nullptr), Size(0),
60 if (NewSize > Size) Size = NewSize;
70 uint64_t getSize() const { return Size; }
149 assert(i < UnknownInsts.size());
252 void addPointer(AliasSetTracker &AST, PointerRec &Entry, uint64_t Size,
257 for (size_t i = 0, e = UnknownInsts.size(); i != e; ++i)
270 bool aliasesPointer(const Value *Ptr, uint64_t Size, const MDNode *TBAAInfo,
325 bool add(Value *Ptr, uint64_t Size, const MDNode *TBAAInfo); // Add a locatio
[all...] |
| MemoryDependenceAnalysis.h | 281 /// Size - The maximum size of the dereferences of the
283 uint64_t Size;
289 : Size(AliasAnalysis::UnknownSize), TBAATag(nullptr) {}
410 /// and Size) and compares it against a load. If the specified load could
413 /// location value, then this function returns the size in bytes of the
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DIE.h | 117 /// Size - Size of instance + children.
119 unsigned Size;
143 : Offset(0), Size(0), Abbrev((dwarf::Tag)0, dwarf::DW_CHILDREN_no),
148 : Offset(0), Size(0), Abbrev((dwarf::Tag)Tag, dwarf::DW_CHILDREN_no),
157 unsigned getSize() const { return Size; }
170 void setSize(unsigned S) { Size = S; }
235 /// SizeOf - Return the size of a value in bytes.
276 /// EmitValue - Emit integer of appropriate size.
282 /// SizeOf - Determine size of integer value in bytes
[all...] |
| /external/llvm/lib/CodeGen/ |
| PrologEpilogInserter.cpp | 54 WarnStackSize("warn-stack-size", cl::Hidden, cl::init((unsigned)-1),
55 cl::desc("Warn for stack size bigger than the given"
171 // Warn on stack size when we exceeds the given limit.
211 unsigned Size = I->getOperand(0).getImm();
212 if (Size > MaxCallFrameSize) MaxCallFrameSize = Size;
348 for (unsigned i = 0, e = CSI.size(); i != e; ++i) {
362 for (unsigned ri = 0, re = ReturnBlocks.size(); ri != re; ++ri) {
381 for (unsigned i = 0, e = CSI.size(); i != e; ++i) {
405 // If the stack grows down, add the object size to find the lowest address
[all...] |
