/external/compiler-rt/test/tsan/ |
H A D | memcpy_race.cc | 13 static volatile int size = 1; local 14 memcpy(data+5, data1, size); 19 static volatile int size = 4; local 21 memcpy(data+3, data2, size); 37 // CHECK: Write of size 1 at [[ADDR]] by thread T2: 40 // CHECK: Previous write of size 1 at [[ADDR]] by thread T1:
|
/external/e2fsprogs/misc/ |
H A D | partinfo.c | 23 #define BLKGETSIZE _IO(0x12,96) /* return device size */ 30 unsigned long size; local 63 if (ioctl(fd, BLKGETSIZE, &size) < 0) { 64 fprintf(stderr, _("Cannot get size of %s: %s"), 70 printf(_("%s: h=%3d s=%3d c=%4d start=%8d size=%8lu end=%8d\n"), 73 (int)loc.start, size, (int) loc.start + size -1); local
|
/external/eigen/Eigen/src/Core/ |
H A D | VectorBlock.h | 19 * \brief Expression of a fixed-size or dynamic-size sub-vector 22 * \param Size size of the sub-vector we are taking at compile time (optional) 24 * This class represents an expression of either a fixed-size or dynamic-size sub-vector. 36 * \note Even though this expression has dynamic size, in the case where \a VectorType 37 * has fixed size, this expression inherits a fixed maximal size which means that evaluating 40 * Here is an example illustrating the fixed-size case: 73 /** Dynamic-size constructo 75 VectorBlock(VectorType& vector, Index start, Index size) argument [all...] |
/external/eigen/bench/btl/generic_bench/init/ |
H A D | init_matrix.hh | 28 BTL_DONT_INLINE void init_row(Vector & X, int size, int row){ argument 30 X.resize(size); 32 for (int j=0;j<X.size();j++){ 43 BTL_DONT_INLINE void init_matrix(Vector & A, int size){ argument 44 A.resize(size); 45 for (int row=0; row<A.size() ; row++){ 46 init_row<init_function>(A[row],size,row); 51 BTL_DONT_INLINE void init_matrix_symm(Matrix& A, int size){ argument 52 A.resize(size); 53 for (int row=0; row<A.size() ; ro [all...] |
/external/eigen/bench/btl/generic_bench/timers/ |
H A D | mixed_perf_analyzer.hh | 46 inline double eval_mflops(int size) argument 51 result=_ppa.eval_mflops(size); 55 result=_x86pa.eval_mflops(size);
|
/external/eigen/test/ |
H A D | determinant.cpp | 20 Index size = m.rows(); local 22 MatrixType m1(size, size), m2(size, size); 27 VERIFY_IS_APPROX(MatrixType::Identity(size, size).determinant(), Scalar(1)); 29 if(size==1) return; 30 Index i = internal::random<Index>(0, size-1); 33 j = internal::random<Index>(0, size [all...] |
H A D | product_mmtr.cpp | 20 template<typename Scalar> void mmtr(int size) argument 27 MatrixColMaj matc(size, size); 28 MatrixRowMaj matr(size, size); 29 MatrixColMaj ref1(size, size), ref2(size, size); 31 MatrixColMaj soc(size,othersiz [all...] |
H A D | product_trsolve.cpp | 30 template<typename Scalar,int Size, int Cols> void trsolve(int size=Size,int cols=Cols) argument 34 Matrix<Scalar,Size,Size,ColMajor> cmLhs(size,size); 35 Matrix<Scalar,Size,Size,RowMajor> rmLhs(size,size); 39 Matrix<Scalar,Size,Cols,colmajor> cmRhs(size,cols); 40 Matrix<Scalar,Size,Cols,rowmajor> rmRhs(size,cols); 41 Matrix<Scalar,Dynamic,Dynamic,colmajor> ref(size,cols);
|
/external/eigen/test/eigen2/ |
H A D | eigen2_determinant.cpp | 19 int size = m.rows(); local 21 MatrixType m1(size, size), m2(size, size); 26 VERIFY_IS_APPROX(MatrixType::Identity(size, size).determinant(), Scalar(1)); 28 if(size==1) return; 29 int i = ei_random<int>(0, size-1); 32 j = ei_random<int>(0, size [all...] |
/external/eigen/unsupported/test/ |
H A D | matrix_functions.h | 20 static void run(MatrixType& result, typename MatrixType::Index size) argument 22 MatrixType mat = MatrixType::Random(size, size); 25 for (typename MatrixType::Index i = 0; i < size; ++i) { 37 static void run(MatrixType& result, typename MatrixType::Index size) argument 39 result = MatrixType::Random(size, size);
|
/external/elfutils/0.153/libelf/ |
H A D | elf_update.c | 64 write_file (Elf *elf, off_t size, int change_bo, size_t shnum) argument 76 /* Adjust the size in any case. We do this even if we use `write'. 83 || (size_t) size > elf->maximum_size) 84 && unlikely (ftruncate (elf->fildes, size) != 0)) 96 elf->map_address = mmap (NULL, size, PROT_READ | PROT_WRITE, 110 size = -1; 119 size = -1; 122 if (size != -1 125 && (size_t) size < elf->maximum_size 126 && unlikely (ftruncate (elf->fildes, size) ! 157 off_t size; local [all...] |
/external/fio/ |
H A D | fifo.c | 28 struct fifo *fifo_alloc(unsigned int size) argument 36 fifo->buffer = malloc(size); 37 fifo->size = size; 56 l = min(len, fifo->size - (fifo->in & (fifo->size - 1))); 57 memcpy(fifo->buffer + (fifo->in & (fifo->size - 1)), buffer, l); 82 l = min(len, fifo->size - (fifo->out & (fifo->size - 1))); 83 memcpy(buf, fifo->buffer + (fifo->out & (fifo->size [all...] |
H A D | fifo.h | 23 unsigned int size; /* the size of the allocated buffer */ member in struct:fifo 24 unsigned int in; /* data is added at offset (in % size) */ 25 unsigned int out; /* data is extracted from off. (out % size) */ 40 return fifo->size - fifo->in + fifo->out;
|
H A D | memalign.c | 14 void *fio_memalign(size_t alignment, size_t size) argument 21 ptr = malloc(size + alignment + size + sizeof(*f) - 1); 24 f = ret + size; 31 void fio_memfree(void *ptr, size_t size) argument 33 struct align_footer *f = ptr + size;
|
/external/freetype/src/base/ |
H A D | ftapi.c | 46 FT_ULong size, 51 FT_Stream_OpenMemory( stream, base, size ); 44 FT_New_Memory_Stream( FT_Library library, FT_Byte* base, FT_ULong size, FT_Stream stream ) argument
|
/external/guava/guava-tests/test/com/google/common/io/ |
H A D | IoTestCase.java | 36 /** Returns a byte array of length size that has values 0 .. size - 1. */ 37 protected static byte[] newPreFilledByteArray(int size) { argument 38 return newPreFilledByteArray(0, size); 42 * Returns a byte array of length size that has values 43 * offset .. offset + size - 1. 45 protected static byte[] newPreFilledByteArray(int offset, int size) { argument 46 byte[] array = new byte[size]; 47 for (int i = 0; i < size; i++) {
|
/external/jemalloc/include/jemalloc/internal/ |
H A D | extent.h | 12 /* Linkage for the size/address-ordered tree. */ 24 /* Total region size. */ 25 size_t size; member in struct:extent_node_s
|
/external/jemalloc/test/unit/ |
H A D | bitmap.c | 15 size_t size = bitmap_size(i); local 16 assert_true(size >= prev_size, 17 "Bitmap size is smaller than expected"); 18 prev_size = size;
|
/external/libcxx/test/containers/sequences/deque/deque.modifiers/ |
H A D | erase_iter.pass.cpp | 21 make(int size, int start = 0 ) argument 34 for (int i = 0; i < size; ++i) 46 assert(P < c1.size()); 47 std::size_t c1_osize = c1.size(); 50 assert(c1.size() == c1_osize - 1); 51 assert(distance(c1.begin(), c1.end()) == c1.size());
|
H A D | push_back.pass.cpp | 23 make(int size, int start = 0 ) argument 36 for (int i = 0; i < size; ++i) 44 void test(int size) argument 50 C c = make<C>(size, rng[j]); 52 for (int i = 0; i < size; ++i, ++it)
|
H A D | push_back_rvalue.pass.cpp | 26 make(int size, int start = 0 ) argument 39 for (int i = 0; i < size; ++i) 47 void test(int size) argument 53 C c = make<C>(size, rng[j]); 55 for (int i = 0; i < size; ++i, ++it)
|
/external/libexif/libexif/canon/ |
H A D | mnote-canon-entry.h | 36 unsigned int size; member in struct:_MnoteCanonEntry
|
/external/libexif/libexif/fuji/ |
H A D | mnote-fuji-entry.h | 38 unsigned int size; member in struct:_MnoteFujiEntry
|
/external/libexif/libexif/olympus/ |
H A D | mnote-olympus-entry.h | 36 unsigned int size; member in struct:_MnoteOlympusEntry
|
/external/libexif/libexif/pentax/ |
H A D | mnote-pentax-entry.h | 36 unsigned int size; member in struct:_MnotePentaxEntry
|