| /external/deqp/doc/testspecs/VK/ |
| D | sparse_resources.txt | 27 The test creates two queues - one supporting sparse binding operations, the second one supporting c…
29 First queue is used to perform binding of device memory to sparse buffer. The binding operation sig…
32 The second queue is used to perform transfer operations. The test creates two non-sparse buffer obj…
33 one used as input and the second as output. The input buffer is used to transfer data to sparse buf…
34 transfered further from sparse buffer to output buffer. The transer queue waits on a semaphore, bef…
46 The test creates two queues - one supporting sparse binding operations, the second one supporting c…
48 First queue is used to perform binding of device memory to sparse image. The binding operation sign…
51 The second queue is used to perform transfer operations. The test creates two non-sparse buffer obj…
52 one used as input and the second as output. The input buffer is used to transfer data to sparse ima…
53 transfered further from sparse image to output buffer. The transfer queue waits on a semaphore, bef…
[all …]
|
| /external/r8/src/test/smali/sparse-switch/ |
| D | SparseSwitch.smali | 9 # Empty sparse switch
12 sparse-switch v0, :sparse_switch_data
17 .sparse-switch
18 .end sparse-switch
21 # Empty sparse switch after data
28 .sparse-switch
29 .end sparse-switch
32 sparse-switch v0, :sparse_switch_data
48 .sparse-switch
51 .end sparse-switch
[all …]
|
| /external/eigen/doc/ |
| D | TutorialSparse.dox | 7 Manipulating and solving sparse problems involves various modules which are summarized below:
11 …eMatrix and SparseVector classes, matrix assembly, basic sparse linear algebra (including sparse t…
12 … <Eigen/SparseCholesky>\endcode</td><td>Direct sparse LLT and LDLT Cholesky factorization to solve…
14 <td>%Sparse LU factorization to solve general square sparse systems</td></tr>
15 …de<Eigen/SparseQR>\endcode </td><td>%Sparse QR factorization for solving sparse linear least-squar…
22 …ized representation storing only the nonzero coefficients. Such a matrix is called a sparse matrix.
26 The class SparseMatrix is the main sparse matrix representation of Eigen's sparse module; it offers…
45 and one of its possible sparse, \b column \b major representation:
68 The results of %Eigen's operations always produces \b compressed sparse matrices.
97 In this example, we start by defining a column-major sparse matrix type of double \c SparseMatrix<d…
[all …]
|
| D | SparseQuickReference.dox | 2 /** \eigenManualPage SparseQuickRefPage Quick reference guide for sparse matrices
7 …sparse matrices in the class SparseMatrix. First, it is recommended to read the introductory tuto…
8 …column major. The default is column major. Most arithmetic operations on sparse matrices will asse…
95 sm1.isVector(); // Check if sm1 is a sparse vector or a sparse matrix
103 …sparse matrices provided that the dimensions are adequate and that the matrices have the same stor…
240 <td> For general sparse solve, Use any suitable module described at \ref TopicSparseSystems </td>
|
| /external/r8/src/test/smali/regression/33846227/ |
| D | 33846227.smali | 5 # Before Lollipop (Art 5.1.1) Art/Dalvik failed on verification if an empty sparse switch payload
20 sparse-switch v0, :SparseSwitch
25 .sparse-switch
26 .end sparse-switch
|
| /external/smali/baksmali/src/test/resources/SwitchTest/ |
| D | UnorderedSparseSwitchInput.smali | 9 sparse-switch v0, :SparseSwitch
28 .sparse-switch
34 .end sparse-switch
|
| D | UnorderedSparseSwitchOutput.smali | 6 sparse-switch v0, :sswitch_data_c
21 .sparse-switch
27 .end sparse-switch
|
| /external/lz4/tests/ |
| D | Makefile | 143 test-lz4-sparse: lz4 datagen
146 $(LZ4) -B4D tmpSrc | $(LZ4) -dv --sparse > tmpB4
148 $(LZ4) -B5D tmpSrc | $(LZ4) -dv --sparse > tmpB5
150 $(LZ4) -B6D tmpSrc | $(LZ4) -dv --sparse > tmpB6
152 $(LZ4) -B7D tmpSrc | $(LZ4) -dv --sparse > tmpB7
154 $(LZ4) tmpSrc | $(LZ4) -dv --no-sparse > tmpNoSparse
157 …./datagen -s1 -g1200007 -P100 | $(LZ4) | $(LZ4) -dv --sparse > tmpOdd # Odd size file (to genera…
182 @./datagen -g3G -P100 | $(LZ4) -vv | $(LZ4) --decompress --force --sparse - tmp
184 … -g3G -P100 | $(LZ4) --quiet --content-size | $(LZ4) --verbose --decompress --force --sparse - tmp2
293 test-lz4: lz4 datagen test-lz4-opt-parser test-lz4-basic test-lz4-multiple test-lz4-sparse \
|
| /external/squashfs-tools/squashfs-tools/ |
| D | process_fragments.c | 64 int bytes = file_buffer->size, sparse = TRUE, value; in checksum_sparse() local
70 sparse = FALSE; in checksum_sparse()
76 return sparse; in checksum_sparse()
276 int sparse = checksum_sparse(file_buffer); in frag_thrd() local
283 if(sparse_files && sparse) { in frag_thrd()
|
| D | unsquashfs.h | 100 char sparse; member
208 char sparse; member
|
| /external/llvm/test/CodeGen/X86/ |
| D | switch-density.ll | 6 define void @sparse(i32 %x) {
20 ; CHECK-LABEL: sparse
44 ; Lowered as a jump table when sparse, and branches when dense.
75 ; Lowered as a jump table when sparse, and branches when dense.
|
| /external/eigen/Eigen/ |
| D | OrderingMethods | 20 * It defines various built-in and external ordering methods for sparse matrices.
22 * the sparse matrix decomposition (LLT, LU, QR).
25 * Using for instance the sparse Cholesky decomposition, it is expected that
34 * A simple usage is as a template parameter in the sparse decomposition classes :
|
| D | IterativeLinearSolvers | 19 …oblems of the form \c A \c x = \c b, where \c A is a squared matrix, usually very large and sparse.
30 …* Such problems can also be solved using the direct sparse decomposition modules: SparseCholesky, …
|
| /external/e2fsprogs/contrib/android/ |
| D | ext2simg.c | 28 int sparse; member
35 .sparse = 1,
194 params.sparse = 0; in main()
214 if (sparse_file_write(s, out_fd, params.gzip, params.sparse, params.crc) < 0) in main()
|
| /external/deqp/external/vulkancts/modules/vulkan/sparse_resources/ |
| D | CMakeLists.txt | 43 add_library(deqp-vk-sparse-resources STATIC ${DEQP_VK_SPARSE_RESOURCES_SRCS})
44 target_link_libraries(deqp-vk-sparse-resources ${DEQP_VK_SPARSE_RESOURCES_LIBS})
|
| D | vktSparseResourcesQueueBindSparseTests.cpp | 46 namespace sparse namespace
68 VkBindSparseInfo sparse; member
129 submission.info.sparse = bindInfo; in makeSubmissionSparse()
287 …K(vk.queueBindSparse(submissionIter->queue->queueHandle, 1u, &submissionIter->info.sparse, fence)); in iterate()
|
| /external/e2fsprogs/tests/d_fallocate_bigalloc/ |
| D | script | 58 # b*: falloc sparse file starting at b*
60 # d: midcluster to midcluster, surrounding sparse
63 # g*: falloc sparse init file starting at g*
64 # h*: falloc sparse init file ending at h*
65 # i: midcluster to midcluster, surrounding sparse init
|
| /external/e2fsprogs/tests/d_fallocate/ |
| D | script | 57 # b*: falloc sparse file starting at b*
59 # d: midcluster to midcluster, surrounding sparse
62 # g*: falloc sparse init file starting at g*
63 # h*: falloc sparse init file ending at h*
64 # i: midcluster to midcluster, surrounding sparse init
|
| D | name | 1 fallocate sparse files and big files
|
| /external/smali/smali/src/test/resources/LexerTest/ |
| D | DirectiveTest.tokens | 20 SPARSE_SWITCH_DIRECTIVE(".sparse-switch")
21 END_SPARSE_SWITCH_DIRECTIVE(".end sparse-switch")
|
| /external/autotest/client/tests/wb_kupdate/ |
| D | control | 8 This tests checks the wb_kupdate code path by writting data to a sparse file
27 sparse_file=os.path.join( # Absolute path to the sparse file.
|
| /external/e2fsprogs/tests/m_hugefile/ |
| D | script | 8 echo "$test_name: $DESCRIPTION: skipped for HFS+ (no sparse files)"
14 echo "$test_name: $DESCRIPTION: skipped for FreeBSD (no sparse files)"
|
| /external/squashfs-tools/kernel/fs/squashfs/ |
| D | file.c | 379 int bytes, i, offset = 0, sparse = 0; in squashfs_readpage() local
411 sparse = 1; in squashfs_readpage()
455 int avail = sparse ? 0 : min_t(int, bytes, PAGE_CACHE_SIZE); in squashfs_readpage()
480 if (!sparse) in squashfs_readpage()
|
| /external/e2fsprogs/misc/ |
| D | e2image.c | 567 int sparse = 0; in output_meta_data_blocks() local
673 if (sparse) in output_meta_data_blocks()
674 seek_relative(fd, sparse); in output_meta_data_blocks()
675 sparse = 0; in output_meta_data_blocks()
689 sparse += fs->blocksize; in output_meta_data_blocks()
690 if (sparse > 1024*1024) { in output_meta_data_blocks()
692 sparse -= 1024*1024; in output_meta_data_blocks()
709 sparse = 0; in output_meta_data_blocks()
727 if (sparse) { in output_meta_data_blocks()
733 offset = seek_relative(fd, sparse); in output_meta_data_blocks()
[all …]
|
| /external/e2fsprogs/tests/f_big_sparse/ |
| D | name | 1 big sparse file
|