| /external/dng_sdk/source/ |
| dng_hue_sat_map.cpp | 125 uint32 size = SafeUint32Mult(DeltasCount (), (uint32) sizeof (HSBModify)); local
127 fDeltas.Allocate (size);
129 DoZeroBytes (fDeltas.Buffer (), size);
|
| /external/e2fsprogs/lib/ext2fs/ |
| alloc_tables.c | 41 int flexbg, flexbg_size, size; local
47 size = rem_grp * elem_size;
49 if (size > (int) (fs->super->s_blocks_per_group / 8))
50 size = (int) fs->super->s_blocks_per_group / 8;
67 if (ext2fs_get_free_blocks2(fs, start_blk, last_blk, size,
|
| /external/eigen/Eigen/src/Core/ |
| EigenBase.h | 49 inline Index size() const { return rows() * cols(); } function in struct:Eigen::EigenBase
|
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointRank2Update.h | 29 const Index size = u.size(); local
30 for (Index i=0; i<size; ++i)
32 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+i, size-i) +=
33 (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.tail(size-i)
34 + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i);
44 const Index size = u.size(); local
45 for (Index i=0; i<size; ++i)
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky_impl.h | 53 const Index size = ap.rows(); local
54 m_matrix.resize(size, size);
55 m_parent.resize(size);
56 m_nonZerosPerCol.resize(size);
58 ei_declare_aligned_stack_constructed_variable(Index, tags, size, 0);
60 for(Index k = 0; k < size; ++k)
87 for(Index k = 0; k < size; ++k)
90 m_matrix.resizeNonZeros(Lp[size]);
107 const Index size = ap.rows() local
[all...] |
| /external/eigen/bench/ |
| bench_reverse.cpp | 22 int size = m.size(); local
24 int repeats = (REPEAT*1000)/size;
52 << "(" << 1e-6 * size*repeats/timerB.value() << " MFLOPS)\t";
63 std::cout << "size no sqrt standard";
|
| spmv.cpp | 39 int size = 10000; local
40 int rows = size;
41 int cols = size;
|
| /external/eigen/blas/ |
| level3_impl.h | 271 int size = (SIDE(*side)==LEFT) ? (*m) : (*n); local
272 Matrix<Scalar,Dynamic,Dynamic,ColMajor> matA(size,size);
275 matA.triangularView<Upper>() = matrix(a,size,size,*lda);
276 matA.triangularView<Lower>() = matrix(a,size,size,*lda).transpose();
280 matA.triangularView<Lower>() = matrix(a,size,size,*lda);
281 matA.triangularView<Upper>() = matrix(a,size,size,*lda).transpose()
[all...] |
| /external/eigen/demos/mandelbrot/ |
| mandelbrot.h | 41 int size; member in class:MandelbrotWidget
56 size(0), buffer(0), draft(16)
|
| /external/eigen/test/eigen2/ |
| eigen2_lu.cpp | 83 int size = ei_random<int>(10,200); local
85 MatrixType m1(size, size), m2(size, size), m3(size, size);
86 m1 = MatrixType::Random(size,size);
91 MatrixType a = MatrixType::Random(size,size*2)
[all...] |
| eigen2_packetmath.cpp | 14 template<typename Scalar> bool areApprox(const Scalar* a, const Scalar* b, int size)
16 for (int i=0; i<size; ++i)
46 const int PacketSize = ei_packet_traits<Scalar>::size;
48 const int size = PacketSize*4; local
49 EIGEN_ALIGN_128 Scalar data1[ei_packet_traits<Scalar>::size*4];
50 EIGEN_ALIGN_128 Scalar data2[ei_packet_traits<Scalar>::size*4];
52 EIGEN_ALIGN_128 Scalar ref[ei_packet_traits<Scalar>::size*4];
53 for (int i=0; i<size; ++i)
|
| eigen2_regression.cpp | 21 const int size = points[0]->size(); local
23 hyperplane->coeffs().resize(size + 1);
24 for(int j = 0; j < size + 1; j++)
37 cur_point = VectorType::Random(size)/*.normalized()*/;
39 Scalar x = - (hyperplane->coeffs().start(size).cwise()*cur_point).sum();
40 cur_point *= hyperplane->coeffs().coeff(size) / x;
47 *(points[i]) += noiseAmplitude * VectorType::Random(size);
56 int size = points[0]->size(); local
71 int size = points[0]->size(); local
[all...] |
| /external/eigen/test/ |
| nullary.cpp | 41 const Index size = base.size(); local
44 Scalar low = (size == 1 ? high : internal::random<Scalar>(-500,500));
47 const Scalar step = ((size == 1) ? 1 : (high-low)/(size-1));
51 m.setLinSpaced(size,low,high);
53 VectorType n(size);
54 for (int i=0; i<size; ++i)
60 m = VectorType::LinSpaced(size,low,high);
67 //VERIFY( m(m.size()-1) == high )
[all...] |
| redux.cpp | 68 Index size = w.size(); local
70 VectorType v = VectorType::Random(size);
71 VectorType v_for_prod = VectorType::Ones(size) + Scalar(0.2) * v; // see comment above declaration of m1_for_prod
73 for(int i = 1; i < size; i++)
90 for(int i = 0; i < size-1; i++)
94 for(int j = i; j < size; j++)
101 VERIFY_IS_MUCH_SMALLER_THAN(abs(s - v.tail(size-i).sum()), Scalar(1));
102 VERIFY_IS_APPROX(p, v_for_prod.tail(size-i).prod());
103 VERIFY_IS_APPROX(minc, v.real().tail(size-i).minCoeff())
[all...] |
| stable_norm.cpp | 77 RealScalar size = static_cast<RealScalar>(m.size()); local
84 VERIFY(isFinite(sqrt(size)*abs(big)));
85 VERIFY_IS_NOT_APPROX(sqrt(copy(vbig.squaredNorm())), abs(sqrt(size)*big)); // here the default norm must fail
86 VERIFY_IS_APPROX(vbig.stableNorm(), sqrt(size)*abs(big));
87 VERIFY_IS_APPROX(vbig.blueNorm(), sqrt(size)*abs(big));
88 VERIFY_IS_APPROX(vbig.hypotNorm(), sqrt(size)*abs(big));
91 VERIFY(isFinite(sqrt(size)*abs(small)));
92 VERIFY_IS_NOT_APPROX(sqrt(copy(vsmall.squaredNorm())), abs(sqrt(size)*small)); // here the default norm must fail
93 VERIFY_IS_APPROX(vsmall.stableNorm(), sqrt(size)*abs(small))
[all...] |
| /external/elfutils/libdwfl/ |
| open.c | 49 size_t size = 0; local
58 error = __libdw_gunzip (fd, offset, mapped, mapped_size, &buffer, &size);
60 error = __libdw_bunzip2 (fd, offset, mapped, mapped_size, &buffer, &size);
62 error = __libdw_unlzma (fd, offset, mapped, mapped_size, &buffer, &size);
66 if (unlikely (size == 0))
73 Elf *memelf = elf_memory (buffer, size);
|
| /external/elfutils/tests/ |
| sectiondump.c | 98 "size = %" PRId64 "\n"
143 size_t size = data->d_size; local
148 for (cnt = 0; cnt < size; cnt += 16)
154 for (inner = 0; inner < 16 && cnt + inner < size; ++inner)
|
| /external/emma/core/java12/com/vladium/jcd/cls/ |
| IConstantCollection.java | 83 * @param index constant pool index [must be in [1, size()] range]
106 * O(pool size). When multiple matches exist, the location of the first one
136 int size (); method in interface:IConstantCollection
161 * @param index constant pool index [must be in [1, size()] range]
|
| InterfaceCollection.java | 31 public int size () method in class:InterfaceCollection
33 return m_interfaces.size ();
62 int _interfaces_count = m_interfaces.size (); // use size() if class becomes non-final
83 final int newoffset = m_interfaces.size (); // use size() if class becomes non-final
|
| /external/emma/core/java12/com/vladium/jcd/cls/attribute/ |
| DeclaredExceptionTable.java | 31 public int size () method in class:DeclaredExceptionTable
33 return m_exceptions.size ();
38 return (1 + m_exceptions.size ()) << 1; // use size() if class becomes non-final
67 int number_of_exceptions = m_exceptions.size (); // use size() if class becomes non-final
81 final int newoffset = m_exceptions.size (); // use size() if class becomes non-final
|
| /external/fio/lib/ |
| rand.c | 120 unsigned int i = 0, size = 0; local
124 size = pattern_bytes;
125 if (size > (len - i))
126 size = len - i;
127 memcpy(b+i, pattern, size);
128 i += size;
|
| /external/fio/profiles/ |
| tiobench.c | 5 static unsigned long long size; variable
26 unsigned long long size; member in struct:tiobench_options
37 .name = "size",
38 .lname = "Tiobench size",
40 .off1 = offsetof(struct tiobench_options, size),
41 .help = "Size in MB",
50 .help = "Block size in bytes",
93 * tiobench uses size as MB, so multiply up
95 size *= 1024 * 1024ULL;
96 if (size)
[all...] |
| /external/google-breakpad/src/client/mac/tests/ |
| spawn_child_process.h | 82 uint32_t size = sizeof(self_path); local
83 if (_NSGetExecutablePath(self_path, &size) != 0)
139 for (unsigned i = 0; i < argv_v.size(); i++) {
|
| /external/google-breakpad/src/client/solaris/handler/ |
| solaris_lwp.h | 67 int size; member in struct:google_breakpad::ModuleInfo
|
| /external/google-breakpad/src/common/linux/ |
| synth_elf.cc | 50 assert(Size() == EI_NIDENT);
89 size_t size = section.Size(); local
106 .Append(endianness(), addr_size_, size)
117 size));
137 assert(size_t(start) < sections_.size());
139 assert(size_t(end) < sections_.size());
154 size_t size = sections_[i].size_; local
158 size = (size + 3) & ~3
[all...] |
