search for: accret

...ng. > > I'll be talking about this in a lightning talk, perhaps others have thoughts on this. Hi Joe, As you mentioned in your talk, I'm sympathetic to your desires, but highly skeptical of this approach - for a number of reasons. Off the top of my head: 1. This will (over time) accrete a ton of old gunk in the bitcode writer, and also slow down progress. 2. The use case for it is also very narrow (in contrast to having the *reader* handle old files, which many scenarios benefit from). 3. The open source project as a whole benefits from "forcing" users of LLVM to "...

...4-bit and 128-bit > chunks and determine the proper index ranges to look for. For example, > for 64-bit elements, result element zero must come from index 0 or 1. > For 32-bit elements, result element zero must come from index 0-3. David, this is probably the wrong approach, based on the accreted awfulness of the X86 shuffle lowering code, which Eli and I have hacked on to improve somewhat. The correct approach is probably a rewrite based around what AltiVec does: Canonicalize to byte ops, and write all the patterns once rather than having to look for 6 different variants of the same pat...

...t really a "whole problem" to consider. Even if there is, I agree that the shortest path to solving my immediate problem is to do exactly as you suggest. I guess my take is that when faced with an architectural question that you eventually may have to address in full, quick fixes tend to accrete that have to be undone when you get around to the general solution, and these make implementing the general thing harder -- unless you have thought it out in advance and the quick fixes are in line with the eventual solution. Now it may turn out that there isn't any "general thing"...

On Nov 8, 2012, at 3:31 AM, Duncan Sands <baldrick at free.fr> wrote: > Hi Joe, > >> We have a tool which reads in bitcode, processes it, and re-emits it. We use >> this tool as a flexible way to integrate our tool into the Xcode, Android NDK, >> Chromium, and Linux build process. >> >> The problem we face is that bitcode changes, and when it does…

...about this in a lightning talk, perhaps others have thoughts on this. > > > Hi Joe, > > As you mentioned in your talk, I'm sympathetic to your desires, but highly skeptical of this approach - for a number of reasons. Off the top of my head: > > 1. This will (over time) accrete a ton of old gunk in the bitcode writer, and also slow down progress. > > 3. The open source project as a whole benefits from "forcing" users of LLVM to "stay up" on mainline… which this feature acts in opposition to. > > -Chris > Hi Chris! Thanks for the re...

...this: daily.wage.growth = 1.001 # deterministic contribution.rate = 0.08 # deterministic 8% Wage = 10 # initial Asset = 0 # initial for (10,000 days) { Asset += contribution.rate * Wage # accreting contributions Wage *= daily.wage.growth * Wage # wage growth Asset *= draw from a normal distribution # Asset returns } cat("Terminal asset = ", Asset, "\n") How can one do this well in R? What I tried so far is to notice that the wage trajectory is det...

I'm working on debugging AVX shuffles and I ran into an interesting problem. The current isSHUFPMask predicate in X86ISelLowering needs to be generalized to operate on 128-bit or 256-bit masks. There are probably lots of other things to change too (LowerVECTOR_SHUFFLE_4wide, etc.) but I'll worry about that later. The generalized rule is: 1. For the low 64 bits of the result vector, the

Just got a pointer to this via ACM "TechNews Alert" for today: http://www.acm.org/technews/articles/2004-6/0818w.html#item2 Seems that "... French computer scientist Antoine Joux reported on Aug. 12 his discovery of a flaw in the MD5 algorithm, which is often used with digital signatures...." There's more in the article cited above. Peace, david -- David H. Wolfskill

On Wed, December 31, 2014 12:03, Warren Young wrote: > > So, cope with change. > Is one to infer from your mantra 'cope with change' that one is not supposed to express any opinion whatsoever, ever, on any forum; on the externalised cost of changes made to software with no evident technical justification? And that to do so is evidence of some moral or intellectual defect in

...involved. Put your code out into the marketplace of ideas as an alternative to the ideas currently being offered. If you?ve truly got the best solution, you?ll start to move things in the direction you want them to go. It?s not going to happen immediately, but in a do-ocracy, those who do things accrete ruling powers. Or, you can go fork EL6 or whatever other ?classic? distro that makes you happier. That?s a lot more work and just adds to the fractiousness that?s part of the problem here, but if your ideas really are hot, you?ll cause another of the occasional shifts that happen in the Unix/Lin...

...each output line - Understand chown and chmod effects implicitly - Be able to read ls -l output at a blink And much more. All of this will be covered in any decent text on Unix/Linux security. Sorry, I can?t give recommendations since I got past the book learnin? stage long ago, and have been accreting such things ever since. Coming back to martial arts, at some point you get past the point of conscious action and react implicitly. The equivalent in security is recognizing risks and mitigating against them before they become NY Times headlines.

These two patches implement the first (and hardest) part of the fix for CVE-2010-3851. This adds a way to specify the format when adding a drive, avoiding qemu's auto-detection. In order to avoid an explosion of different add_drive_* functions (we have 4 already), we have implemented a way to specify optional arguments to functions, so all we need is a single new 'add_drive_opts'

On Wed, 26 Mar 2008, Jonathan S. Shapiro wrote: >> Why not define an "add with overflow" intrinsic that returns its value and >> overflow bit as an i1? > > Chris: > > I understand several simple ways to implement add with carry. Your > suggestion is one of them. What I'm trying to understand is how to > handle the conditional code issue generally.

On Wed, 26 Mar 2008, Jonathan S. Shapiro wrote: > I guess my take is that when faced with an architectural question that > you eventually may have to address in full, quick fixes tend to accrete > that have to be undone when you get around to the general solution, and > these make implementing the general thing harder -- unless you have > thought it out in advance and the quick fixes are in line with the > eventual solution. Hey, you need to be careful with this reasoning or...

On Wed, 2008-03-26 at 11:02 -0700, Chris Lattner wrote: > On Wed, 26 Mar 2008, Jonathan S. Shapiro wrote: > > I want to background process this for a bit, but it would be helpful to > > discuss some approaches first. > > > > There would appear to be three approaches: > > > > 1. Introduce a CC register class into the IR. This seems to be a > >

On Thursday 17 December 2009 17:16, Nate Begeman wrote: > David, this is probably the wrong approach, based on the accreted awfulness > of the X86 shuffle lowering code, Ha! I have no issue believing this statement. :) > The correct approach is probably a rewrite based around what > AltiVec does: Canonicalize to byte ops, and write all the patterns once > rather than having to look for 6 different var...

If I try the following: class foo { define bar ($text) { file {"/tmp/foo.txt": content => $text, } } bar { "hello": text => ''Hello World'', } } class foo2 inherits foo { Foo::bar["default"] { text => ''Hello World Again'', } } I get: "Syntax error at '':''; expected

...idmap_ldap the manpage actually refers to. Anyway, the global section of my smb.conf follows, edited slightly. Can someone help me out? Oh, and I should mention-- I did set the alloc secret using 'net idmap secret alloc'. That part seems to go OK. (BTW-- some of these options have accreted over the years-- some of them may no longer be necessary, or even helpful-- please let me know if anything sticks out at you) [global] interfaces = eth0 netbios name = FOZZIE-NEW socket options = TCP_NODELAY SO_RCVBUF=16384 SO_SNDBUF=16384 realm = BOSTON.EXA...

...d by this. <snip> > Proposal: a slow, multistep, backward-compatible transition to remove > the disincentive to contribute patches from private forks: I strongly doubt that this is the primary barrier for the contribution of such patches. Code review, the fact that these patches have accreted for long periods of time outside the view of the community, and a lack (or broken nature) of incremental development processes seem likely to cost much more. > P.S. tl;dr, right? Actually, yes. This entire conversation is too long to read. Many are claiming there is something wrong with the...

...y additions and improvements to the operating system available to the public in the form of source code. This means that a community of hackers and software developers, linked by the Internet, is constantly adding to and improving Linux. The operating system as it exists today is a loosely defined accretion of repairs and new features. The general public license made that possible. But free software doesn't mean free of charge, and that is where closely held companies like Red Hat and its rival, Caldera Inc., come in. Red Hat, of Research Triangle Park, N.C., takes the latest version of Linux...