search for: sparseness

tree: https://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost.git linux-next head: b072ae74df177c3ad7704c5fbe66e3f10aad9d4e commit: b072ae74df177c3ad7704c5fbe66e3f10aad9d4e [12/12] vhost: use vhost_desc instead of vhost_log reproduce: # apt-get install sparse # sparse version: v0.6.1-101-g82dee2e-dirty git checkout b072ae74df177c3ad7704c5fbe66e3f10aad9d4e make

tree: https://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost.git vhost head: 3d22d7c1190db3209b644b8a13a75a9802b4587f commit: b3a8771f409b74c42deee28aee3092fc5d2c8dab [22/23] fw_cfg: write vmcoreinfo details reproduce: # apt-get install sparse git checkout b3a8771f409b74c42deee28aee3092fc5d2c8dab make ARCH=x86_64 allmodconfig make C=1 CF=-D__CHECK_ENDIAN__

We copied the virtio_iommu_config from the virtio-iommu specification, which declares the fields using little-endian annotations (for example le32). Unfortunately this causes sparse to warn about comparison between little- and cpu-endian, because of the typecheck() in virtio_cread(): drivers/iommu/virtio-iommu.c:1024:9: sparse: sparse: incompatible types in comparison expression (different base

tree: https://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost.git vhost head: 84d40e4b4bc64456abf5ef5663871053b40e84ac commit: fee8fe6bd8ccacd27e963b71b4f943be3721779e [38/45] vdpa: make sure set_features in invoked for legacy :::::: branch date: 5 hours ago :::::: commit date: 6 hours ago config: x86_64-randconfig-s021-20200727 (attached as .config) compiler: gcc-9 (Debian 9.3.0-14) 9.3.0

When sparse_array_zero() is used for a range larger than a page, there's no need to waste time in memset() or is_zero() - we already know the page will be free()d. Signed-off-by: Eric Blake <eblake@redhat.com> --- Here's a fun one :) common/sparse/sparse.c | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-) diff --git a/common/sparse/sparse.c b/common/sparse/sparse.c

Dear all, I've been getting different results from the sparse and dense version of model.Matrix when used with sparse contrasts and interactions between factors. The same happens when using model.matrix and sparse.model.matrix. When calculating list.contrasts I get the same results for sparse and dense contrasts (except the type of the matrix is different of course). However, when I use these

? "form" -> "from". Diff against latest SVN: Index: sparse.model.matrix.Rd =================================================================== --- sparse.model.matrix.Rd??? (revision 3336) +++ sparse.model.matrix.Rd??? (working copy) @@ -4,7 +4,7 @@ ?\alias{fac2sparse} ?\alias{fac2Sparse} ?\description{Construct a sparse model or \dQuote{design} matrix, -? form a formula

Hello, Arnd, As you asked, here's a pull request. This has been in linux-next apparently with no ill effects. The following changes since commit 99975cc6ada0d5f2675e83abecae05aba5f437d2: vhost/net: length miscalculation (2015-01-07 12:22:00 +0200) are available in the git repository at: git://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost.git tags/uaccess_for_upstream for you to

Hello, Arnd, As you asked, here's a pull request. This has been in linux-next apparently with no ill effects. The following changes since commit 99975cc6ada0d5f2675e83abecae05aba5f437d2: vhost/net: length miscalculation (2015-01-07 12:22:00 +0200) are available in the git repository at: git://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost.git tags/uaccess_for_upstream for you to

...sparsely to a file being newly created -- to read that block from the dest and refrain from writing it back if it is already zero in the dest file. (Of course, if it is _not_ all zero in the dest, the non-zero bytes would have to be overwritten with zeros.) Granted this approach will not introduce sparseness into an existing non-sparse dest, but it at least will preserve any sparseness which already exists in the dest. I'm currently using 3.0.7, but I think the same issue still exists in 3.1.0 since there's no mention of such a change in the release notes and the 3.1.0 manpage still documents...

Hi. I have an old Xen para virt vm which I created using sparse file. Is there any way to convert this vm image to non-sparse without shutting down the vm?. Thanks Paras.

Dear all, I am currently working on the calculation of eigenvalues (and -vectors) of large matrices. Since these are mostly sparse matrices and I remember some specific functionalities in MATLAB for sparse matrices, I started a research how to optimize the calculation of eigenvalues of a sparse matrix. The function eigen itself works with the LAPACK library which has no special handling for

In some filesystems, typically optimized for large I/O throughputs (like IBM GPFS, IBM SAN FS, or distributed filesystems in general) a lot of lseek() operations can strongly impact on performances. In this cases it can be helpful to enlarge the block size used to handle sparse files directly from a command line parameter. For example, using a sparse write size of 32KB, I've been able to

...rter: rsync at sanitarium.net QA Contact: rsync-qa at samba.org I have read and understand why --inplace and --sparse can't normally coexist. However, those reasons don't seem to apply to a case where --whole-file is in play. Consider the use case of a 10GB VM image with 512MB of sparseness. On the source the file uses 9.5GB of storage. But on the target, rsync forces me to choose between 10GB of permanent storage or 9.5GB of permanent storage + another 9.5GB of temporary storage while the file is updated. If --whole-file --sparse --inplace were all in play then rsync could write o...

Hi, I'm very new to working with sparse matrices and would like to know how I can column permute a sparse matrix. Here is a small example: > M1 <- > spMatrix(nrow=5,ncol=6,i=sample(5,15,replace=TRUE),j=sample(6,15,replace=TRUE),x=round_any(rnorm(15,2),0.001)) > M1 5 x 6 sparse Matrix of class "dgTMatrix" [1,] 2.983 . 1.656 5.003 . . [2,] .

Hello, I am working with a sparse matrix that is approx. 13,900 by 14,100. My goal is to select a row out of the matrix and create a new matrix with that row repeated 13,900 times without having to do any looping. Example: Starting Matrix: exampleMatrix 3 x 4 sparse Matrix of class "dgCMatrix" [1,] 1 . . . [2,] . 1 . 0.5 [3,] . . 1 .. New Matrix:.. newExampleMatrix 3 x 4 sparse

These plugins are both based on the same sparse array structure which supports a simple implementation of extents. --- common/sparse/sparse.h | 7 ++++++- common/sparse/sparse.c | 29 ++++++++++++++++++++++++++++- plugins/data/data.c | 16 +++++++++++++++- plugins/memory/memory.c | 16 +++++++++++++++- 4 files changed, 64 insertions(+), 4 deletions(-) diff --git a/common/sparse/sparse.h

To whom it may concern, I am trying to maximize a log-likelihood function using optim. This is a simple problem with only 18 parameters. To conserve memory, I am using sparse matrices (SLAM) for some of the data matrices used in the computation of the likelihood. However, optim appears to convert the sparse matrix back to regular data format. This causes me to run out of memory as R tries to

This allows you to append one file to another: copy-file-to-file /input.txt /output.txt append:true will append the contents of /input.txt to /output.txt. --- daemon/copy.c | 38 +++++++++++++++++++++++++++++++------- generator/actions.ml | 29 +++++++++++++++++++++-------- 2 files changed, 52 insertions(+), 15 deletions(-) diff --git a/daemon/copy.c b/daemon/copy.c index

I can't be the first person to think of this, can I? But I couldn't locate any reference on this combination. If you know of one, please tell me. Sparse: http://kernel.org/pub/linux/kernel/people/josh/sparse/ LLVM: http://llvm.org/ So, you may expect compile-llvm.c in a few days. :) -- Seo Sanghyeon