| /external/dexmaker/src/dx/java/com/android/dx/io/ |
| CodeReader.java | 81 int size = decodedInstructions.length; local
83 for (int i = 0; i < size; i++) {
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/annotation/ |
| AnnotationsList.java | 41 int size = list1.size(); local
43 if (size != list2.size()) {
44 throw new IllegalArgumentException("list1.size() != list2.size()");
47 AnnotationsList result = new AnnotationsList(size);
49 for (int i = 0; i < size; i++) {
62 * @param size the size of the lis
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/util/ |
| Bits.java | 37 int size = (max + 0x1f) >> 5; local
38 return new int[size];
|
| /external/dng_sdk/source/ |
| dng_opcodes.cpp | 174 uint32 size = stream.Get_uint32 (); local
176 if (size)
179 fData.Reset (host.Allocate (size));
|
| /external/drm_gralloc/ |
| gralloc.cpp | 198 int size, bpp, err; local
|
| gralloc_drm_rockchip.c | 44 uint32_t size, gem_handle; local
65 size = aligned_height * pitch;
76 size += 64 * w_mbs * h_mbs;
92 0, size);
94 ALOGE("failed to wrap bo handle=%d size=%d\n",
95 gem_handle, size);
103 buf->bo = rockchip_bo_create(info->rockchip, size, 0);
106 handle->height, pitch, cpp, size);
|
| /external/e2fsprogs/debugfs/ |
| lsdel.c | 27 __u64 size; member in struct:deleted_info
167 delarray[num_delarray].size = EXT2_I_SIZE(&inode);
187 fprintf(out, " Inode Owner Mode Size Blocks Time deleted\n");
195 delarray[i].uid, delarray[i].mode, delarray[i].size,
|
| /external/e2fsprogs/lib/blkid/ |
| getsize.c | 2 * getsize.c --- get the size of a partition.
50 #define BLKGETSIZE _IO(0x12,96) /* return device size */
54 #define BLKGETSIZE64 _IOR(0x12,114,size_t) /* return device size in bytes (u64 *arg) */
112 unsigned long size; local
114 if (ioctl(fd, BLKGETSIZE, &size) >= 0)
115 return (blkid_loff_t)size << 9;
130 return (blkid_loff_t)this_floppy.size << 9;
176 * find the size of the partition.
200 "Determine the size of a device\n", argv[0]);
|
| /external/e2fsprogs/lib/ext2fs/ |
| dir_iterate.c | 191 unsigned int rec_len, size; local
242 size = ((dirent->name_len & 0xFF) + 11) & ~3;
244 if (rec_len != size) {
248 offset += size;
|
| imager.c | 244 ssize_t actual, size; local
247 size = fs->blocksize * (fs->group_desc_count + 1);
248 buf = malloc(size);
255 actual = read(fd, buf, size);
260 if (actual != size) {
288 __u32 itr, cnt, size; local
301 size = (EXT2_INODES_PER_GROUP(fs->super) / 8);
311 size = EXT2_BLOCKS_PER_GROUP(fs->super) / 8;
313 total_size = size * fs->group_desc_count;
316 size = sizeof(buf)
364 unsigned int size; local
[all...] |
| qcow2.c | 54 size_t size; local
67 size = read(fd, buffer, sizeof(struct ext2_qcow2_hdr));
68 if (size != sizeof(struct ext2_qcow2_hdr)) {
87 size_t size, l1_size = img->l1_size * sizeof(blk64_t); local
100 size = read(fd, table, l1_size);
101 if (size != l1_size) {
115 size_t size; local
122 size = read(fd, *l2_table, img->cluster_size);
123 if (size != img->cluster_size)
132 size_t size; local
163 size_t size; local
[all...] |
| /external/e2fsprogs/resize/ |
| online.c | 62 blk_t size; local
167 size = ext2fs_blocks_count(sb);
169 if (ioctl(fd, EXT2_IOC_GROUP_EXTEND, &size)) {
217 size = fs->group_desc_count * sb->s_blocks_per_group +
219 if (size > *new_size)
220 size = *new_size;
222 if (ioctl(fd, EXT2_IOC_GROUP_EXTEND, &size)) {
|
| /external/e2fsprogs/tests/progs/ |
| random_exercise.c | 76 int size; local
87 size = random() & (DATA_SIZE-1);
89 write(fd, data_buffer, size);
90 printf("Created temp file %s, fd = %d, size=%d\n",
91 template, fd, size);
103 int size; local
105 size = random() & (DATA_SIZE-1);
110 ftruncate(fd, size);
111 printf("Truncating temp file %s, fd = %d, ino=%u, size=%d\n",
112 state_array[fd].name, fd, get_inode_num(fd), size);
[all...] |
| /external/eigen/Eigen/src/misc/ |
| SparseSolve.h | 56 int size = m_rhs.rows(); local
57 Eigen::Matrix<DestScalar,Dynamic,Dynamic> tmp(size,rhsCols);
58 Eigen::Matrix<DestScalar,Dynamic,Dynamic> tmpX(size,rhsCols);
|
| /external/eigen/bench/ |
| benchVecAdd.cpp | 7 #ifndef SIZE
8 #define SIZE 50
17 __attribute__ ((noinline)) void benchVec(Scalar* a, Scalar* b, Scalar* c, int size);
23 int size = SIZE * 8; local
24 int size2 = size * size;
29 for (int i=0; i<size; ++i)
45 for (int innersize = size; innersize>2 ; --innersize)
91 void benchVec(Scalar* a, Scalar* b, Scalar* c, int size)
[all...] |
| /external/eigen/bench/btl/data/ |
| mean.cxx | 155 int size=tab_sizes.size(); local
159 for (int i=0;i<size;i++){
|
| smooth.cxx | 84 for (int i=0 ; i<data.size() ; i++){
90 return mean/double(data.size()) ;
104 int size=tab_mflops.size(); local
108 for (int i=0 ; i < size ; i++){
114 if (shifted_index>size-1) shifted_index=size-1;
129 int size=tab_mflops.size(); local
132 for (int i=0 ; i < size ; i++)
186 int size=0; local
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_visitor.cpp | 22 for(int i = 0; i < m.size(); i++)
63 int size = w.size(); local
67 v = VectorType::Random(size);
68 for(int i = 0; i < size; i++)
75 for(int i = 0; i < size; i++)
|
| /external/eigen/test/ |
| lu.cpp | 103 DenseIndex size = MatrixType::RowsAtCompileTime; local
104 if( size==Dynamic)
105 size = internal::random<DenseIndex>(1,EIGEN_TEST_MAX_SIZE);
107 MatrixType m1(size, size), m2(size, size), m3(size, size);
111 m1 = MatrixType::Random(size,size)
[all...] |
| mapped_matrix.cpp | 21 Index size = m.size(); local
24 Scalar* array1 = internal::aligned_new<Scalar>(size);
25 Scalar* array2 = internal::aligned_new<Scalar>(size);
26 Scalar* array3 = new Scalar[size+1];
29 Map<VectorType, Aligned>(array1, size) = VectorType::Random(size);
30 Map<VectorType, Aligned>(array2, size) = Map<VectorType,Aligned>(array1, size);
31 Map<VectorType>(array3unaligned, size) = Map<VectorType>(array1, size)
52 Index rows = m.rows(), cols = m.cols(), size = rows*cols; local
81 Index size = m.size(); local
122 Index size = 11; local
[all...] |
| qr.cpp | 60 int size = internal::random<int>(10,50); local
62 MatrixType m1(size, size), m2(size, size), m3(size, size);
63 m1 = MatrixType::Random(size,size);
68 MatrixType a = MatrixType::Random(size,size*2)
[all...] |
| qr_colpivoting.cpp | 78 int size = internal::random<int>(10,50); local
80 MatrixType m1(size, size), m2(size, size), m3(size, size);
81 m1 = MatrixType::Random(size,size);
86 MatrixType a = MatrixType::Random(size,size*2)
[all...] |
| qr_fullpivoting.cpp | 58 int size = internal::random<int>(10,50); local
60 MatrixType m1(size, size), m2(size, size), m3(size, size);
61 m1 = MatrixType::Random(size,size);
66 MatrixType a = MatrixType::Random(size,size*2)
[all...] |
| /external/eigen/unsupported/Eigen/src/AutoDiff/ |
| AutoDiffVector.h | 61 Index size() const { return m_values.size(); } function in class:Eigen::AutoDiffVector
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 41 int size = mat.cols(); local
42 Vector diag(size);
43 for(int i=0; i<size; ++i)
|
