search for: reused

On Thu, Jun 26, 2014 at 3:39 PM, Robinson, Paul <Paul_Robinson at playstation.sony.com> wrote: > The main motivation for turning it off is that no known consumer (debugger) > took advantage of it. > > Turning it on does more than slightly increase the object file size, it can > cause the same source line to be listed multiple times in the .debug_line > table (with different

The UDP binding logic will reuse local port numbers immediately. This causes problems for TFTP, which assumes a very low probability of a source port number being reused. The consequence is that lpxelinux.0 may end up downloading an incorrect file (e.g. attempting to download pxelinux.cfg/default but actually receiving a copy of ldlinux.c32, due to the port number having been reused). Fix by allocating local UDP port numbers in the same way as local TCP port numb...

...it another way, the "heap slot reuse causes invalid analysis results" situation is actually a subset of "we access a dangling pointer" which is what we really want to catch (I mean "dangling" in a sense that a pointer stays "dangling" even if its heap slot is reused). By avoiding reuse of heap slots, the dangling pointer is more likely to be in a heap slot that ASan is keeping poisoned and not reusing (hence it can detect the error). -- Sean Silva > > (Or did I just re-state what you were saying?) > > -- Sanjoy > -------------- next part ----...

The following changes since commit afd2ff9b7e1b367172f18ba7f693dfb62bdcb2dc: Linux 4.4 (2016-01-10 15:01:32 -0800) are available in the git repository at: git://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost.git tags/for_linus for you to fetch changes up to 43e361f23c49dbddf74f56ddf6cdd85c5dbff6da: checkpatch: add virt barriers (2016-01-12 20:47:08 +0200)

The following changes since commit afd2ff9b7e1b367172f18ba7f693dfb62bdcb2dc: Linux 4.4 (2016-01-10 15:01:32 -0800) are available in the git repository at: git://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost.git tags/for_linus for you to fetch changes up to 43e361f23c49dbddf74f56ddf6cdd85c5dbff6da: checkpatch: add virt barriers (2016-01-12 20:47:08 +0200)

I'm looking for a way to approximate the "zero-overhead" model of code reuse available in languages like Python, Perl, etc. I've described this idea in more detail, and the motivation for this question in an earlier post to R-help (https://stat.ethz.ch/pipermail/r-help/2016-September/442174.html). (One of the responses I got advised that I post my question here instead.) The

Dear LLVM-Mailing-List, I'm using the llvm::EngineBuilder to create an instance of the llvm::ExecutionEngine, I then JIT my code, take the addresses I need and delete the llvm::ExecutionEngine. But now I started to wonder, if I could reuse that instance for a new module again? I first tried calling llvm::EngineBuilder without setting a Module, I planned to add it later - but when I do this

Heyho, I can only provide you with a screenshot for the first problem I noticed: [https://media.discordapp.net/attachments/534012750045642783/575369402195640321/unknown.png] This code will crash when calling "eeBuilder.create". But I also looked at what happens if I do reuse the llvm::ExecutionEngine. After the call to "finalizeObject" I use "removeModule" for the

...%EFLAGS<imp-def,dead> ; srcLine 0 2816 %reg1591<def> = ADD64rr %reg1591, %reg1579, %EFLAGS<imp-def,dead> ; srcLine 0 2820 %reg1198<def> = LEA64r %reg1591, 1, %reg1574, 0 ; srcLine 0 ##### %reg1591 gets spilled by linear scan with all of the uses in the sequence above reused by the "spltting" code in LiveIntervals. Note especially that %reg1591 is (correctly) identified at rematable (for the SUB64rr): ##### spilling(a): %reg1591,3.3557 = [2178,2802:4)[2802,2810:3)[2810,2818:2) [2818,2966:1)[2966,7840:0) 0 at 2966 1 at 2818-(2966) 2 at 2810-(2818) 3 at 2...

...Component: core AssignedTo: wayned at samba.org ReportedBy: martin at scharrer-online.de QAContact: rsync-qa at samba.org Hi, I observed the following behavior of rsync: If a file contains identical blocks (e.g. all-zero, etc.) then these blocks are not re-transfered but reused by the delta-transfer algorithm - BUT only if one of these blocks is already in the destination file. If not or if the destination file does not exists yet, all identical blocks are copied over and over again. In some special cases (e.g. large sparse files which are rsync'ed --inplace, i.e. -S...

...connection between different agi's.Actually when call comes to asterisk box it executes various agi scripts sequentially. Each script checks various values by making a new?MySQL?connection and then execute query and then disconnects.? So,?Ideally?there should be one connection, and it should be reused between each agi and when a call is over it should be disconnected. Is there any?mechanism?to reuse single?MySQL?connection?between agi scripts?The agi scripts are written in?Perl Thanks, Faheem, M. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://...

Hi, Is it generally safe to cache a FunctionPassManager and reuse it on modules other than the one it was constructed with (assuming they have the same target triple)? paul -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110923/cd845b59/attachment.html>

I'm trying to implement *MUL_LOHI for my processor. My processor has mulxss (e.g.) that gives the 32 high bits of a 64 bit multiply. I tried this in ios2ISelDAGToDAG.cpp: /// Mul/Div with two results case ISD::SMUL_LOHI: case ISD::UMUL_LOHI: { SDValue Op1 = Node->getOperand(0); SDValue Op2 = Node->getOperand(1); AddToISelQueue(Op1);

Thanks. The reason I ask is because I'm looking at some code that does just that. A single FunctionPassManager is constructed with a dummy Module and createStandardFunctionPasses is called on it. The FunctionPassManager cached and run on Functions in other Modules. So far I haven't noticed any problems but I guess that is because the passes added by createStandardFunctionPasses don't

> On Feb 27, 2017, at 9:39 AM, Daniel Berlin <dberlin at dberlin.org> wrote: > > > > On Mon, Feb 27, 2017 at 9:29 AM, Adam Nemet <anemet at apple.com <mailto:anemet at apple.com>> wrote: > >> On Feb 27, 2017, at 7:27 AM, Hal Finkel <hfinkel at anl.gov <mailto:hfinkel at anl.gov>> wrote: >> >> >> On 02/27/2017 06:29 AM,

I'm seeing the following failures with "make check" (x86-32 linux): FAIL: test/CodeGen/X86/fold-mul-lohi.ll Failed with exit(1) at line 2 while running: llvm-as < test/CodeGen/X86/fold-mul-lohi.ll | llc -march=x86-64 | not grep lea leaq B, %rsi leaq A, %r8 leaq P, %rsi child process exited abnormally FAIL:

For eg: c=a-b is represented using the following statements in IR: %tmp = load i32, i32* %a, align 4 %tmp1 = load i32, i32* %b, align 4 %sub = sub nsw i32 %tmp, %tmp1 store i32 %sub, i32* %c, align 4 whenever there is a redundant computation of the same, say k=a-b (if the value of *a* and *b* are not changed) the code will be like this: %tmp2 = load i32, i32* %a, align 4 %tmp3 =

On Wed, Aug 28, 2019 at 01:37:12PM +0800, Tiwei Bie wrote: > Details about this can be found here: > > https://lwn.net/Articles/750770/ > > What's new in this version > ========================== > > There are three choices based on the discussion [1] in RFC v2: > > > #1. We expose a VFIO device, so we can reuse the VFIO container/group > > based

On Wed, Aug 28, 2019 at 01:37:12PM +0800, Tiwei Bie wrote: > Details about this can be found here: > > https://lwn.net/Articles/750770/ > > What's new in this version > ========================== > > There are three choices based on the discussion [1] in RFC v2: > > > #1. We expose a VFIO device, so we can reuse the VFIO container/group > > based

I want to replace an existing 32bit with a 64bit installation (Centos 5). There's an existing LVM with lots of partitions. Most are used for Xen guests. The system itself uses only one of them plus a separate /boot partition that is not on LVM. What's the best course of action here? Should I do the reinstall with kickstart or better manually and reuse the existing filesystem? As I