| /external/compiler-rt/test/msan/ |
| dtor-trivial.cpp | 17 int size; member in class:Vector
|
| /external/curl/docs/examples/ |
| postinmemory.c | 33 size_t size; member in struct:MemoryStruct
37 WriteMemoryCallback(void *contents, size_t size, size_t nmemb, void *userp)
39 size_t realsize = size * nmemb;
42 mem->memory = realloc(mem->memory, mem->size + realsize + 1);
49 memcpy(&(mem->memory[mem->size]), contents, realsize);
50 mem->size += realsize;
51 mem->memory[mem->size] = 0;
64 chunk.size = 0; /* no data at this point */
97 * Now, our chunk.memory points to a memory block that is chunk.size
|
| /external/curl/lib/ |
| curl_sec.h | 27 size_t size; member in struct:Curl_sec_client_mech
|
| llist.h | 43 size_t size; member in struct:curl_llist
|
| /external/dagger2/core/src/main/java/dagger/internal/ |
| SetFactory.java | 76 return original.size() != asSet.size();
94 int size = 0; local
100 List<Set<T>> providedSets = new ArrayList<Set<T>>(contributingProviders.size());
101 for (int i = 0, c = contributingProviders.size(); i < c; i++) {
108 size += providedSet.size();
111 Set<T> result = newLinkedHashSetWithExpectedSize(size);
112 for (int i = 0, c = providedSets.size(); i < c; i++) {
|
| /external/deqp/framework/common/ |
| tcuResource.cpp | 71 int size = (int)ftell(m_file); local
73 return size;
|
| /external/dexmaker/src/dx/java/com/android/dx/io/instructions/ |
| FillArrayDataPayloadDecodedInstruction.java | 29 private final int size; field in class:FillArrayDataPayloadDecodedInstruction
39 int opcode, Object data, int size, int elementWidth) {
43 this.size = size;
89 return size;
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/type/ |
| TypeList.java | 35 * Gets the size of this list.
37 * @return {@code >= 0;} the size
39 public int size(); method in interface:TypeList
46 * @param n {@code >= 0, < size();} which element
|
| /external/dexmaker/src/main/java/com/google/dexmaker/ |
| Local.java | 47 return size();
53 int size() { method in class:Local
|
| /external/dng_sdk/source/ |
| dng_memory.cpp | 34 dng_memory_data::dng_memory_data (uint32 size)
40 Allocate (size);
67 void dng_memory_data::Allocate (uint32 size)
72 if (size)
75 fBuffer = (char*)malloc (size);
129 uint32 size = LogicalSize (); local
131 dng_memory_block * result = allocator.Allocate (size);
133 DoCopyBytes (Buffer (), result->Buffer (), size); local
218 dng_memory_block * dng_memory_allocator::Allocate (uint32 size)
221 dng_memory_block *result = new dng_malloc_block (size);
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| brel_ma.c | 52 size_t size; local
76 size = (size_t) (sizeof(struct ext2_block_relocate_entry) *
82 memset(ma->entries, 0, size);
|
| io_manager.c | 116 size_t size; local
119 size = io->block_size;
121 size = io->block_size * count;
123 size = -count;
126 return ext2fs_get_memalign(size, io->align, ptr);
128 return ext2fs_get_mem(size, ptr);
|
| irel_ma.c | 68 size_t size; local
92 size = (size_t) (sizeof(ext2_ino_t) * (max_inode+1));
97 memset(ma->orig_map, 0, size);
99 size = (size_t) (sizeof(struct ext2_inode_relocate_entry) *
105 memset(ma->entries, 0, size);
107 size = (size_t) (sizeof(struct inode_reference_entry) *
113 memset(ma->ref_entries, 0, size);
145 size_t size, old_size;
166 size = (sizeof(struct ext2_inode_reference) * ent->max_refs);
169 retval = ext2fs_resize_mem(old_size, size, &ref_ent->refs)
[all...] |
| /external/e2fsprogs/lib/ss/ |
| get_readline.c | 18 #define size sizeof(ss_data *) macro
|
| /external/e2fsprogs/resize/ |
| test_extent.c | 24 __u64 size; local
100 &num1, &num2, &size);
103 if (!size)
106 num1, num2, size);
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| LeastSquares.h | 67 This vector must be of the same type and size as the
69 For brevity, let \f$n=Size\f$,
92 const int size = points[0]->size(); local
93 result->resize(size);
94 HyperplaneType h(size);
98 for(int i = funcOfOthers; i < size; i++)
113 * where \f$n=Size\f$, \f$r_i=retCoefficients[i]\f$, and we denote by
116 * Thus, the vector \a retCoefficients has size \f$n+1\f$, which is another
139 int size = points[0]->size() local
[all...] |
| /external/eigen/bench/btl/data/ |
| regularize.cxx | 76 int size=tab_mflops.size(); local
96 while(i<size){
119 int size=0; local
122 while (input_file >> size >> mflops ){
124 tab_sizes.push_back(size);
|
| /external/eigen/test/ |
| conservative_resize.cpp | 87 const int size = internal::random<int>(1,50); local
89 m.conservativeResize(size);
90 VERIFY_IS_APPROX(m, n.segment(0,size));
93 m.conservativeResize(m.rows(), size);
94 VERIFY_IS_APPROX(m, n.segment(0,size));
100 const int size = internal::random<int>(50,100); local
102 m.conservativeResizeLike(VectorType::Zero(size));
104 VERIFY( size<=50 || m.segment(50,size-50).sum() == Scalar(0) );
107 m.conservativeResizeLike(Matrix<Scalar,Dynamic,Dynamic>::Zero(1,size));
[all...] |
| mapstaticmethods.cpp | 118 int size = v.size(); local
122 PlainObjectType::Map(ptr, size).setZero();
123 PlainObjectType::MapAligned(ptr, size).setZero();
124 PlainObjectType::Map(const_ptr, size).sum();
125 PlainObjectType::MapAligned(const_ptr, size).sum();
127 PlainObjectType::Map(ptr, size, InnerStride<>(i)).setZero();
128 PlainObjectType::MapAligned(ptr, size, InnerStride<>(i)).setZero();
129 PlainObjectType::Map(const_ptr, size, InnerStride<>(i)).sum();
130 PlainObjectType::MapAligned(const_ptr, size, InnerStride<>(i)).sum()
[all...] |
| mapstride.cpp | 17 Index size = m.size(); local
19 VectorType v = VectorType::Random(size);
21 Index arraysize = 3*size;
29 Map<VectorType, Alignment, InnerStride<3> > map(array, size);
31 for(int i = 0; i < size; ++i)
39 Map<VectorType, Unaligned, InnerStride<Dynamic> > map(array, size, InnerStride<Dynamic>(2));
41 for(int i = 0; i < size; ++i)
80 // test no inner stride and an outer stride of +4. This is quite important as for fixed-size matrices,
|
| schur_real.cpp | 18 const Index size = T.cols(); local
22 for(int row = 2; row < size; ++row) {
30 for(int row = 1; row < size; ++row) {
32 VERIFY(row == size-1 || T(row+1,row) == 0);
40 template<typename MatrixType> void schur(int size = MatrixType::ColsAtCompileTime)
44 MatrixType A = MatrixType::Random(size, size);
60 MatrixType A = MatrixType::Random(size, size);
71 rs3.setMaxIterations(RealSchur<MatrixType>::m_maxIterationsPerRow * size).compute(A)
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_map.cpp | 16 int size = m.size(); local
19 Scalar* array1 = ei_aligned_new<Scalar>(size);
20 Scalar* array2 = ei_aligned_new<Scalar>(size);
21 Scalar* array3 = new Scalar[size+1];
24 Map<VectorType, Aligned>(array1, size) = VectorType::Random(size);
25 Map<VectorType>(array2, size) = Map<VectorType>(array1, size);
26 Map<VectorType>(array3unaligned, size) = Map<VectorType>((const Scalar*)array1, size); // test non-const-correctness support in eigen
42 int rows = m.rows(), cols = m.cols(), size = rows*cols; local
70 int size = m.size(); local
[all...] |
| eigen2_sum.cpp | 31 int size = w.size(); local
33 VectorType v = VectorType::Random(size);
34 for(int i = 1; i < size; i++)
41 for(int i = 0; i < size-1; i++)
44 for(int j = i; j < size; j++) s += v[j];
45 VERIFY_IS_APPROX(s, v.end(size-i).sum());
48 for(int i = 0; i < size/2; i++)
51 for(int j = i; j < size-i; j++) s += v[j];
52 VERIFY_IS_APPROX(s, v.segment(i, size-2*i).sum())
[all...] |
| /external/elfutils/backends/ |
| alpha_retval.c | 96 Dwarf_Word size; local
98 &attr_mem), &size) != 0)
101 size = 8;
116 if (size <= 8)
122 if (size <= 8 * 2)
127 if (size <= 8)
|
| i386_retval.c | 95 Dwarf_Word size; local
98 &attr_mem), &size) != 0)
101 size = 4;
114 if (size > 16)
121 if (size <= 4)
123 if (size <= 8)
|
