search for: riddl

Hi, everyone: R is new to me. I am writing a nested loop to simulate data for t-test. The following code is wrong. The subscript is out of bounds. Could anyone tell me how to revise it? Thanks, Riddle Chin. result<-matrix(ncol=5, nrow=1000) colnames(result)<-c('N=20','N=40','N=60','N=80','N=100') for (i in 1:1000){ for (j in seq(20,100,20)){ x<-rnorm(j,2.7,1) result[i,j]<-t.test(x,mu=4)$p.value<=0.05 } } --...

I'd be interested in using this but I have to wait until someone ports this to firefox (or at least chromium). Thanks for sharing it though! On 3/31/20 2:16 PM, River Riddle via llvm-dev wrote: > For those interested I've uploaded to the chrome store to make installs > easier. An install link is now included on the repo. > > -- River > > On Mon, Mar 30, 2020, 1:44 PM River Riddle <riddleriver at gmail.com> wrote: > >> Hi all, >&...

...o Andrey, I won’t oppose. I feel sad we have to split our effort on outlining technology, but I certainly don’t pretend to know what is best! The bottom line is if people are happy with that going in, the conversation on the details can continue in parallel. > On Jul 24, 2017, at 4:56 PM, River Riddle <riddleriver at gmail.com> wrote: > > Hey Quentin, > Sorry I missed the last question. Currently it doesn't do continual outlining, but it's definitely a possibility. Ok, that means we probably won’t have the very bad runtime problems I had in mind with adding a lot of in...

...h Danny's cases from the machine outliner RFC, we can add region outlining, etc. We can do all of this and make it available to every target automatically. The reason why I am for this being at the IR level is not because I want to split up the technical effort, but combine it. Thanks, River Riddle On Mon, Jul 24, 2017 at 4:14 PM, Quentin Colombet <qcolombet at apple.com> wrote: > Hi River, > > On Jul 24, 2017, at 2:36 PM, River Riddle <riddleriver at gmail.com> wrote: > > Hi Quentin, > I appreciate the feedback. When I reference the cost of Target Hooks it&...

...is only: checksum = 31 2C D2 93 The boot info table was written by xorriso. The boot success with many systems tells us that the checksum is ok in normal situations. "-ls -l" and field "file_len" both say that in total 80 blocks should be read by the MBR. ---------- The riddle of the all zero first block is now explainable: The address conversion 8444 -> 1/6/3 matches two geometries: H/C= 128 S/H= 63 H/C= 195 S/H= 42 I would assume the first one. It would yield with the MBR bug: 8444 -> 1/2/125 which is not a valid C/H/S address under S/H=63 and thus d...

...on benchmarks given in the "More detailed performance data" of the original RFC. It includes comparisons to the Machine Outliner when possible(I can't build clang on Linux with Machine Outliner). I welcome any and all discussion on the placement of the outliner in LLVM. Thanks, River Riddle On Mon, Jul 24, 2017 at 1:42 PM, Quentin Colombet <qcolombet at apple.com> wrote: > Hi River, > > On Jul 24, 2017, at 11:55 AM, River Riddle via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > > Hi Jessica, > The comparison to the inliner is an interesting one...

...loss in exact cost modeling to gain flexibility, coverage, and potential for further features. This trade off is the same made for quite a few IR level optimizations, including inlining. As for the worry about code size regressions, so far the results seem to support our hypothesis. Thanks, River Riddle On Mon, Jul 24, 2017 at 11:12 AM, Jessica Paquette <jpaquette at apple.com> wrote: > > Hi River, > > I’m working on the MachineOutliner pass at the MIR level. Working at the > IR level sounds interesting! It also seems like our algorithms are similar. > I was thinking of...

...very experimental given that there isn't a size pipeline for LTO yet(there should be). The %improvements can be similar to non LTO but because the LTO binary is generally much smaller the actual decrease in size is also much smaller. I'll add more detailed LTO numbers as well. Thanks, River Riddle On Sat, Jul 22, 2017 at 3:23 PM, Andrey Bokhanko <andreybokhanko at gmail.com> wrote: > Hi River, > > Very impressive! -- thanks for working on this. > > A few questions, if you don't mind. > > First, on results (from goo.gl/5k6wsP). Some of them are quite > sur...

...dev at lists.llvm.org>> wrote: >> >> >> >> On Mon, Jul 24, 2017 at 4:14 PM, Quentin Colombet via llvm-dev <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>> wrote: >> Hi River, >> >>> On Jul 24, 2017, at 2:36 PM, River Riddle <riddleriver at gmail.com <mailto:riddleriver at gmail.com>> wrote: >>> >>> Hi Quentin, >>> I appreciate the feedback. When I reference the cost of Target Hooks it's mainly for maintainability and cost on a target author. We want to keep the intrusion i...

On Mon, Jul 24, 2017 at 4:14 PM, Quentin Colombet via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Hi River, > > On Jul 24, 2017, at 2:36 PM, River Riddle <riddleriver at gmail.com> wrote: > > Hi Quentin, > I appreciate the feedback. When I reference the cost of Target Hooks it's > mainly for maintainability and cost on a target author. We want to keep the > intrusion into target information minimized. The heuristics used f...

On Thu, 24 Aug 2023, Jani Nikula wrote: > On Thu, 24 Aug 2023, Lee Jones <lee at kernel.org> wrote: > > This set is part of a larger effort attempting to clean-up W=1 > > kernel builds, which are currently overwhelmingly riddled with > > niggly little warnings. > > The next question is, how do we keep it W=1 clean going forward? My plan was to fix them all, then move each warning to W=0. Arnd recently submitted a set doing just that for a bunch of them. https://lore.kernel.org/all/20230811140327.3754597-1...

...parsing the llvm stackmap can be found at: https://github.com/dotnet/llilc/blob/master/lib/GcInfo/GcInfo.cpp https://llvm.org/docs/StackMaps.html#stackmap-format https://github.com/llvm-mirror/llvm/blob/4604874612fa292ab4c49f96aedefdf8be1ff27e/include/llvm/Object/StackMapParser.h Thanks, River Riddle On Sat, Jan 13, 2018 at 10:02 AM, benzrf via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Is there an explanation anywhere of what code that uses a stack map looks > like? I'm interested in writing a garbage collector, but it's not clear to > me how my code should make...

On Thu, 24 Aug 2023, Lee Jones <lee at kernel.org> wrote: > This set is part of a larger effort attempting to clean-up W=1 > kernel builds, which are currently overwhelmingly riddled with > niggly little warnings. The next question is, how do we keep it W=1 clean going forward? Most people don't use W=1 because it's too noisy, so it's a bit of a catch-22. In i915, we enable a lot of W=1 warnings using subdir-ccflags-y in our Makefile. For CI/developer use we...

On Tue, Aug 15, 2017 at 4:14 PM, River Riddle via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Hey Graham, > I worked on pretty much this exact thing last year. I did something > similar to what you described, I traversed the CFG and built potentially > profitable regions from any given valid start node. At that point...

Hi all, Recently I've had some extra time on my hands, so I spent part of the weekend coding up a simple chrome extension to monitor the status of code reviews on the LLVM phabricator instance. This extension is inspired by some other review monitoring tools that I've used in the past. It allows for monitoring revisions that a user needs to review, revisions by the user that need to be

Is there an explanation anywhere of what code that uses a stack map looks like? I'm interested in writing a garbage collector, but it's not clear to me how my code should make use of the stack map format to actually locate roots in memory. -------------- next part -------------- An HTML attachment was scrubbed... URL:

I've been scratching my head over this one for too long. I'm hoping someone out there can solve this riddle. I have two vectors of characters, v1 and v2, both of length L, and two matrices of logicals, m1 and m2, both of dimension N*L. The first matrix of logicals corresponds to the first vector of characters, and the second to the second. The matrices are telling me which of the elements of v1 an...

...ode size, as possible and then extract commonly used code into functions. I am also interested in some kind of Oz LTO with the IR Outliner enabled. Evgeny Astigeevich Senior Compiler Engineer Compilation Tools ARM From: llvm-dev [mailto:llvm-dev-bounces at lists.llvm.org] On Behalf Of River Riddle via llvm-dev Sent: Saturday, July 29, 2017 6:33 AM To: Chris Bieneman Cc: llvm-dev Subject: Re: [llvm-dev] [RFC] Add IR level interprocedural outliner for code size. Hi Chris, It's okay to put this on the spot because posting the patches was meant to help further the discussion that kind of...

...nsequence, its SIP implementation now supports Speex, so if you have a Speex-compatible SIP client, you can use it to make calls using Asterisk. Some caveats: - Only narrowband (8 kHz) Speex is currently supported; not wideband. (Unfortunately, the assumption that audio sample rate == 8 kHz is riddled throughout the Asterisk code.) - Each outgoing RTP packet (from Asterisk) contains just a single Speex frame. Similarly, each incoming RTP packet (from a client) should contain just a single Speex frame. - Some existing clients (such as "linphone") will need to be modified to use th...

...tion of my brain. In addition, it is not very fun to test this on the actual hardware it is designed to run on (although I did manage to track down a 386 with detachable i387 coprocessor, the owner is not sure it still boots). Someday it would be nice to have an audit of this code; it appears to be riddled with bugs relating to segmentation, for example it assumes LDT segments on overrides, does not use the mm->context semaphore to protect LDT access, and generally looks scarily out of date in both function and appearance. I also have a makeover for the pgtable.h code. Splitting operations tha...