search for: recompute

dear R wizards: I have a large data frame, a million rows, 40 columns. In this data frame, there are some (about 100,000) rows which I want to recompute (update), while I want to leave others just as is. this is based on a condition that I need to compute, based on what is in a few of the columns. what is the right R way to do this? I could subset out the rows that I want to recompute into a new data frame (A), subset out the rows I don't wa...

...> Thank you very much for your talk. > I think I could append more information about updating LiveIntervals. > 1. It works well if I just use from step1 to step3, without step4. > 2. In step4, I firstly use UnreachableBlockElim pass to delete OldMBB. > Then, remove all intervals and recompute all the virtual registers' LiveIntervals. > 3. I debug source code in LiveRangeCalc.cpp and copy partial code shown following. > /// LiveRangeCalc.cpp > ... > #ifndef NDEBUG > if (MBB->pred_empty()) { > MBB->getParent()->verify(); > llvm_unreachable...

Hello all, I need to tap into the collective wisdom of the group re an issue of efficiency. A sketch of the situation: Let's say 4000 observations in variables Y, X1, X2 , X3 and X4. I would like to feed various combinations of this expression Y ~ X1+X2+X3+X4 + I(X1^2)+I(X2^2)+I(X3^2)+I(X4^2) + X1*X2 + X1*X3 + X1*X4 + X2*X3 + X2*X4 + X3*X4 repeatedly to glm(). (I really have little

Thanks, but this is most probably different issue. My maildirsize is computed incorrectly even if I delete it completely and let dovead recompute it so expunging is not in the game. Is there any way how to track/debug the recomputation algorithm in dovecot? On Wed, Aug 24, 2016 at 12:02 AM, WJCarpenter <bill-dovecot at carpenter.org> wrote: > A long shot, but here's how I experienced similar symptoms: > http://www.dovecot....

Hello all, I’m pretty new to LLVM. I'm writing a pass for loop optimization. I clone and rearrange loops, setting the cloned loop as the original loop’s parent. This can be done multiple times, until there is no more work to do. The trouble is, after the first time I do this, the cloned loop's SCEVs become unknown types when they should be AddRecExpr. If I re-run the whole pass on the

On Jan 3, 2014, at 1:52 PM, Andrew Trick <atrick at apple.com> wrote: > He really just wants to rerun LiveIntervals analysis, but LiveVariables is no longer available. Would it work just to clear all the intervals rerun LiveIntervals::computeVirtRegs after all the CFG transforms are complete? Yes, I should think so. /jakob -------------- next part -------------- An HTML attachment was

...nce. -Haishan Yes, I think error that means LiveIntervals have been invalidated. It is supposed to be user-friendly but should probably be changed to be more specific. If you schedule a new pass between coalescing and regalloc, it needs to preserve LiveIntervals analysis. There are utilities to recompute live intervals for individual virtual registers. See LiveIntervals::computeVirtRegs. LiveVariables is not actually needed to update live intervals. It is only added as a requirement to make sure it runs before the 2-address pass. -Andy Thank you for your reply. I do it as you tell me, and y...

I an stumbling on something that is probably very simple, but I cannot see the solution. I have an object generated by the table () function and want to recompute this table so each cell represents the percentage of the corresponding row sum. Of course a dedicated function can be written (which I have done), containing the necessary loops etc., but there should be a simpler way. I'd prefer something simple and as transparent as possible since it is...

...xamine the IR annotations in order to reflect changes to them. There are a few other "Immutable" analysis passes that abuse the legacy pass manager in this way. That seems fine as a temporary thing. I don't *think* this kind of information would pose a significant compile time cost to recompute on each query, but I've not looked at the nature of the IPA queries you would want to make. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20160419/7b50ce90/attachment.html>

...uot;foo"), and then construct a second CachedHashStringRef("foo") again later, you'll compute the hash for "foo" twice [1]. Instead, once you've constructed a CachedHashStringRef from a StringRef, you can pass that around instead of the StringRef to avoid needing to recompute the hash for it. LLD COFF's symbol table structure is a DenseMap<CachedHashStringRef, Symbol *> named symMap [2]. (ELF's is similar, except it maps to a vector index instead of a Symbol * directly for symbol order determinism reasons.) The only accesses to symMap are either iterating...

Hello, This patch fixes PR5382. The problem is that "bu_ls_rr_sort::operator()" and "td_ls_rr_sort::operator()" call getHeight() and getDepth() methods on SUnit, which can recompute values, what invalidates heap (SPQ). This patch guarantees that height and depth values won't be recomputed. The other solution would be to reheapify SPQ everytime when new SUnit is pop()ed, however I think it would be too expensive. Can anyone look at this? Thanks -Jakub ------------...

Caching computation in rails? Simple example: factorial modulus a large number input: integer x output: factorial( x ) % 12345678901234567 I want it so that if it computes factorial of N once, it will not have to compute for N again. code: class SiteController < ApplicationController caches_action :factorial, :inv def examine @inv = @params[''inv''] @outv =

Hi, How can I rerun an analysis pass in the middle of a function pass? In particular, my dominator set needs to be recomputed. It looks like I can manually edit the dominator set with getAnalysisToUpdate. If I could rerun the dominator set pass to get this info automatically, it would save me some time. Thanks.

On 15 Apr 2013, at 16:03, Sean Silva <silvas at purdue.edu> wrote: > See http://llvm.org/bugs/show_bug.cgi?id=6210. Chris is correct at the coarse granularity, but there are some trades to be made at the fine. There is some interesting work from MIT in the context of image processing kernels related to the relative costs of saving intermediates out to cache or DRAM vs recomputing them

...t; 4. Then I want to delete OldMBB in the current MachineFuncion. At the same time, delete LiveIntervals info of OldMBB. So, firstly, Use RemoveMachineInstrFromMaps() to erase SlotIndexes info of OldMBB. And, delete OldMBB from current CFG. Lastly, remove all registers' interval, create and recompute virtual register interval info. >> However, I get an unreachable error "Use not jointly dominated by defs" in LiveRangeCalc.cpp:188. >> So, comparing with Step3, Step4 generates an unreachable error, Why? >> Valid information of OldMBB is deleted when updating CFG? I...

...to > the inliner. The next step is to use the callsite hotness instead. I also > want to focus on the infrastructure to enable this and what I've been > experimenting with is similar to your two alternative approaches: > > >> Alternate Approaches: >> 1) We could just recompute BFI explicitly in the inliner right before >> passing the result to ICA for the purposes of prototyping. If this was off >> by default, this might be a reasonable scheme for investigation. This >> could likely never be enabled for real uses. >> 2) We could pre-compute BFI o...

Hello, I'm working on a project that involves archive files and since llvm-link does not currently support them, I have a simple patch (attached) to add this functionality. It isn't really efficient (it recomputes the set of symbols that need to be linked in after each link), and it probably has some problems with append linkage, but so far it has been enough for me. I'd like to clean this up and commit it back to llvm. Would someone like to tell me how to proceed? Thanks. -- gregory malecha http://...

...lust function (from the hclust help page): "...Initially, each object is assigned to its own cluster and then the algorithm proceeds iteratively, at each stage joining the two most similar clusters, continuing until there is just a single cluster. At each stage distances between clusters are recomputed by the Lance?Williams dissimilarity update formula according to the particular clustering method being used. ..." I am wondering is there another function that doesnt do " At each stage distances between clusters are recomputed by the Lance?Williams dissimilarity update formula accordi...

- Please do not add any more uses of the LiveVariables pass! It is deprecated and only kept around for one last pass that isn't converted. All new code should use LiveIntervalAnalysis! - Kill flags are optional: If they are present they must be correct, but it is legal to have a value die without having a kill flag on the operand. So often a simple fix is to clear out the kill flags from

Dear R wizards--- I have a wrapper on mclapply() that makes it a little easier for me to do multiprocessing. (Posting this may make life easier for other googlers.) I pass a data frame, a vector that tells me what rows should be recomputed, and the function; and I get back a vector or matrix of answers. d <- data.frame( id=1:6, val=11:16 ) loc <- c(TRUE,TRUE,FALSE,TRUE,FALSE,TRUE) v1 <- mc.byselectrows( d, loc, function(x) x[,2]^2 ) v2 <- mc.byselectrows(d, loc, function(x) cbind(x[,2]^2,x[,2]^3)) mc.bysele...