search for: counteracted

Hello, as far as I understood ext3 will more or less hog a machine when writing away the journal. A customer is having a slowdown every 5 minues for about 30 seconds, the machine becomes more or less unusable. This is an NFS server serving 300 Gigs spread over 2 NFS shares. I'm wondering what would be the best course of action: a) make the journal bigger? b) make the journal smaller?

Hi Hal, I see. So LSR could theoretically counteract undesirable Ind Var transformations but it's not implemented at the moment? I think I've managed to come up with a small reproducer that can also exhibit similar problem on x86, here it is: https://godbolt.org/z/_wxzut As you can see, when rewriteLoopExitValues is not disabled Clang generates worse code due to additional spills,

I have all three running on the same box. I say OT because it appears asterisk is doing it's job just fine. It must be an IAXmodem or faxgetty (hylafax) problem When faxes work, they look great. I have ten IAXmodems setup with different ports and they register fine. I have ten faxgettys that startup fine. I start the IAXmodems and then faxgettys in inittab. They are setup as a roll

On Sat, 24 Mar 2007, Christopher Lamb wrote: > It seems to me that there is potential for doing some target independent loop > invariant optimizations in the back end, but prior to instruction selection. I assume you mean after instruction selection? > For instance, I noticed that the loop invariant constant generated for a loop > bounds check is still stuck inside the loop.

Things are going along well, but there is one remaining area of confusion...."units". I understand exponents now...it's basically how you pass decimal values. That's easy enough. But "units"....in other words, I have a voltage I want to put in a report. If I include in the report descriptor the fact that it is actually a voltage, with units of "volts",

Hi All, It seems to me that there is potential for doing some target independent loop invariant optimizations in the back end, but prior to instruction selection. For instance, I noticed that the loop invariant constant generated for a loop bounds check is still stuck inside the loop. Likewise constant address generated for globals accessed within a loop are generated on each iteration,

What is the current status of the residual echo suppressor in the preprocessor? I ask this because I have occasional problems with the AEC, in which it fails to cancel echo. I think the problems have to do with samples being dropped by the audio IO system, which is effectively impossible to detect and counteract reliably. A colleague recommended using an echo suppression technique (which he

OK, I get it. The essence of this problem is that a node can be covered exactly and just once but its result can be referred multiple times for a tree pattern matching isel. So to duplicate a load node (only if we can!) is convenient to conquer that case. The truth is, in pattern (add (load) (load)), source operands are memory addresses, and thus it can be treated as (addmm address,

Counteract incorrect use of the "deprecated" attribute in ffmpeg headers. In particular, struct AVPaletteControl is deprecated, but it's used in a non-deprecated struct AVCodecContext (as found in Fedora's ffmpeg-devel-0.4.9-0.8.20070530.fc7.x86_64). Define attribute_deprecated to an empty string until broken version of ffmpeg are too obsolete to support. Use appropriate

I am writing a target for an odd cisc-like architecture which has no support for keeping most values in registers. As such, memory-memory operations are needed, but for isel to generate a memory-memory the pattern must be of the form (store (op (load) (load))). Let's use a simple example to show how this can be problematic: %0 = load i32* %a.addr, align 4 store i32 %0, i32* %other, align

Hi @all, I'm having trouble to realize my use case and hope somebody could help me. # Use case For a home lab I want to deploy several guest domains. These domains must not have a direct or NAT connection to the internet or my LAN. They should only be able to reach my LAN and the internet through a proxy. # What I've done I've created the following virtual switch in isolated

I'll give that a shot, thanks! -Joe On Sun, Dec 2, 2012 at 12:06 PM, Triple Yang <triple.yang at gmail.com> wrote: > OK, I get it. > > The essence of this problem is that a node can be covered exactly and > just once but its result can be referred multiple times for a tree > pattern matching isel. So to duplicate a load node (only if we can!) > is convenient to

Hello, The ScheduleDAGInstrs::buildSchedGraph() function creates def/uses lists by iterating over all instruction operands and calls addPhysRegDeps() if used post-RA (line ~770 ff.). If an operand is a def, the uses of that registers are cleared (ScheduleDAGInstrs.cpp:333: Uses.eraseAll(Reg); ). As a consequence, if an instruction has an explicit use of a register and an implicit def of the

Hi, Joe. I am sorry I did not catch your point. Can you provide more details? Since SDValue/SDNode can be used multiple times, why would you want to create two identical objects instead of reference to the same one? 2012/12/2 Joseph Pusdesris <joe at pusdesris.com>: > Yes, changing parameters will create a new Node, but is there some way I can > force a new node with the same

I've noticed that there was an attempt to mitigate ExitValues problem in https://reviews.llvm.org/D12494 that went nowhere. Were there particular issues with that approach? -- Danila From: Philip Reames [mailto:listmail at philipreames.com] Sent: Saturday, August 10, 2019 02:05 To: Danila Malyutin <Danila.Malyutin at synopsys.com>; Finkel, Hal J. <hfinkel at anl.gov> Cc: llvm-dev

The residual echo suppression is supposed to be working decently well now. However, it's not designed to counter the effects of samples being dropped off the soundcard. You'll just need to fix that problem for real. Jean-Marc Coffey, Michael a ?crit : > What is the current status of the residual echo suppressor in the > preprocessor? > > I ask this because I have occasional

Sorry if this has been beaten to death here but I couldn''t find the exact answer I was looking for. In the app I''m writing, we convert the score to a percentage and display it with the search results. The problem is when you search for an exact phrase (for example) and it matches the title of a document exactly, you only get a 17% match. Has anyone seen a way to either curve

Kevin Burton has posted about poor ranking in Lucene preferring shorter documents over longer ones[1]. A similar search in Xapian returns documents in the expected order: Performing query `Xapian::Query(foo)' 3 results found ID 3 99% [foo foo foo] ID 2 94% [foo foo] ID 1 80% [foo] Anyone know what Lucene is doing here? Their FAQ doesn't mention what weighting scheme they use, and I

...(...); > $tg->index_text($txt,$weight); The second parameter there is a WDF multiplier, which isn't really "weight". It depends on the weighting formula you're using (and the parameters set for it), but simply scaling up the WDF values for a whole document is likely to be counteracted by the corresponding increase in the document length (since that is SUM(WDF)). And the average document length will be fairly meaningless, which will probably make the relevance weighting less effective. Also, recency changes with passing time, so you'll either have to reindex regularly, or e...

I was thinking about this some more: Is there a reason I can't just weight by some function of recency at indexing time? $weight = get_weight_based_on_recency(...); $tg->index_text($txt,$weight); If I wanted to allow the user the option of searching either in recency-weighted mode or not, I could index each document into 2 different databases, one with and one without. This avoids