search for: pengfei

...c slicing based on LLVM. I just see that you have implemented dynamic slicing for LLVM. I also check the Giri project, and I don't find the code. I hope I can learn something from your code. I am very appreciated if you can tell me how to get the code or send me one copy. Thank you very much! Pengfei -- View this message in context: http://llvm.1065342.n5.nabble.com/Dynamic-Analysis-tp42317p61104.html Sent from the LLVM - Dev mailing list archive at Nabble.com.

...s://developer.mozilla.org/en-US/docs/Compiling_Firefox_With_Clang_On_Linux>. I add "export CC=clang export CXX=clang++" to mozconfig file. I wonder whether you guys have built firefox with clang in Linux. Could you give me some tips how to build the firefox with clang. Best Regards, Pengfei -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20160216/bce9ea31/attachment.html>

Hi Pengfei, Glad you tried the program and it works fine to you for the first place. Dr. Swarup and John from UIUC wrote most of the code, and released the original code to public. Dynamic slicing tool is really very useful. Giri is now far from perfect. For example, there are know bugs for multi-thread pro...

...ke -O2) 2011/5/3 Manish Gupta <mgupta.iitr at gmail.com> > I just want to try loop-unroll and see corresponding changes in the bitcode > file. For that any loop will do. Have you been able to test llvm loop-unroll > successfully? > > > On Mon, May 2, 2011 at 10:04 PM, Yuan Pengfei <coolypf at qq.com> wrote: > >> Hi, >> >> > The loop that I am trying it on is: >> > for(i=0; i< 1000; i++) >> > { >> > c[i] = a[i] + b[i]; >> > } >> >> I can't find any benefit unrolling this loop. >> >&g...

Hi, > The loop that I am trying it on is: > for(i=0; i< 1000; i++) > { > c[i] = a[i] + b[i]; > } I can't find any benefit unrolling this loop. ------------------ Yuan Pengfei Peking Unversity, China

I just want to try loop-unroll and see corresponding changes in the bitcode file. For that any loop will do. Have you been able to test llvm loop-unroll successfully? On Mon, May 2, 2011 at 10:04 PM, Yuan Pengfei <coolypf at qq.com> wrote: > Hi, > > > The loop that I am trying it on is: > > for(i=0; i< 1000; i++) > > { > > c[i] = a[i] + b[i]; > > } > > I can't find any benefit unrolling this loop. > > ------------------ > Yuan Pengfei > Pek...

I recently used the Xen virtual machine backup tools, such as ''xm save'' command. And I found that before this tool save the memory and CPU state, it first pauses the VM. Do Xen have same tools for online backup the VMs? If it do not have one, can I saty that Xen don''t support VM online backup? -- View this message in context:

...ta <mgupta.iitr at gmail.com> > >> I just want to try loop-unroll and see corresponding changes in the >> bitcode file. For that any loop will do. Have you been able to test llvm >> loop-unroll successfully? >> >> >> On Mon, May 2, 2011 at 10:04 PM, Yuan Pengfei <coolypf at qq.com> wrote: >> >>> Hi, >>> >>> > The loop that I am trying it on is: >>> > for(i=0; i< 1000; i++) >>> > { >>> > c[i] = a[i] + b[i]; >>> > } >>> >>> I can't find any bene...

...com> >> >>> I just want to try loop-unroll and see corresponding changes in the >>> bitcode file. For that any loop will do. Have you been able to test llvm >>> loop-unroll successfully? >>> >>> >>> On Mon, May 2, 2011 at 10:04 PM, Yuan Pengfei <coolypf at qq.com> wrote: >>> >>>> Hi, >>>> >>>> > The loop that I am trying it on is: >>>> > for(i=0; i< 1000; i++) >>>> > { >>>> > c[i] = a[i] + b[i]; >>>> > } >>>> &g...

...;>> I just want to try loop-unroll and see corresponding changes in the >>>> bitcode file. For that any loop will do. Have you been able to test llvm >>>> loop-unroll successfully? >>>> >>>> >>>> On Mon, May 2, 2011 at 10:04 PM, Yuan Pengfei <coolypf at qq.com> wrote: >>>> >>>>> Hi, >>>>> >>>>> > The loop that I am trying it on is: >>>>> > for(i=0; i< 1000; i++) >>>>> > { >>>>> > c[i] = a[i] + b[i]; >>>&gt...

...t to try loop-unroll and see corresponding changes in the >>>>> bitcode file. For that any loop will do. Have you been able to test llvm >>>>> loop-unroll successfully? >>>>> >>>>> >>>>> On Mon, May 2, 2011 at 10:04 PM, Yuan Pengfei <coolypf at qq.com> wrote: >>>>> >>>>>> Hi, >>>>>> >>>>>> > The loop that I am trying it on is: >>>>>> > for(i=0; i< 1000; i++) >>>>>> > { >>>>>> > c[i] =...

...hanged" if there're changes in the check contents. There's a known issue if the prefix is not connected by "=", e.g. "--check-prefix X86". It will be put into "Aborted". Please pay attention for tests in these lists. Wish the script would help you😊 Thanks Pengfei -----Original Message----- From: Fāng-ruì Sòng <maskray at google.com> Sent: Friday, November 6, 2020 3:50 AM To: Matt Arsenault <Matthew.Arsenault at amd.com>; Alexey.Bataev at ibm.com; Tim Northover <t.p.northover at gmail.com>; Wang, Pengfei <pengfei.wang at intel.com>...

...igand (Ulrich.Weigand at de.ibm.com) <Ulrich.Weigand at de.ibm.com>; Cameron McInally <cameron.mcinally at nyu.edu>; Kevin Neal <Kevin.Neal at sas.com>; Blower, Melanie I <melanie.blower at intel.com>; hfinkel at anl.gov; Sanjay Patel <spatel at rotateright.com>; Wang, Pengfei <pengfei.wang at intel.com> Subject: Re: Floating point semantic modes STDC FENV_ACCESS {ON|OFF} Patch in progress. I think ON should force the following: except_behavior { strict } fenv_access { on } rounding_mode { dynamic } denormal_fp_math { IEEE } denormal_fp32_ma...

On Thu, Nov 5, 2020 at 11:36 AM David Blaikie via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > > > On Thu, Nov 5, 2020 at 10:46 AM Mircea Trofin <mtrofin at google.com> wrote: >> >> >> >> On Thu, Nov 5, 2020 at 10:40 AM David Blaikie <dblaikie at gmail.com> wrote: >>> >>> >>> >>> On Thu, Nov 5, 2020 at

...de.ibm.com) <Ulrich.Weigand at de.ibm.com>; Cameron McInally <cameron.mcinally at nyu.edu>; Kevin Neal <Kevin.Neal at sas.com>; Blower, Melanie I <melanie.blower at intel.com>; sepavloff at gmail.com; hfinkel at anl.gov; Sanjay Patel <spatel at rotateright.com>; Wang, Pengfei <pengfei.wang at intel.com> Subject: Re: [llvm-dev] Floating point semantic modes * Kaylor, Andrew via llvm-dev <llvm-dev at lists.llvm.org> [2020-01-27 23:24:10 +0000]: > Hi all, > > I'm trying to put together a set of rules for how the various floating point semantic mo...

On Fri, Jan 17, 2020 at 8:09 PM Finkel, Hal J. <hfinkel at anl.gov> wrote: > Andy, thanks for writing this up. A few thoughts: > > 1. The mental model that I have is that there is always an FP_CONTRACT pragma: there's some default (implicit) pragma at the beginning, and what it says (off/on/fast) is controlled by the command-line flags (or the driver's default if no flags

Hi Xiang, On Wed, Nov 11, 2020 at 1:59 AM Zhang, Xiang1 <xiang1.zhang at intel.com> wrote: > Jeremy wrote: > > ... The value %0 is live up to and including the ADD64ri but not past it, meaning LLVM today will drop the DBG_VALUE ... > > Just a little puzzle about the " drop the DBG_VALUE ", maybe I didn't get your key point, >

Hi, Per Reid’s feedback, I have separated two SEH missing features. This thread now is only focusing on _local_unwind(), Jumping out of _finally. The design is documented in Wiki here: https://github.com/tentzen/llvm-project/wiki/Windows-SEH:-Local_Unwind-(aka:-Jumping-Out-of-_Finally) The implementation can be seen here:

Hi all, I'm trying to put together a set of rules for how the various floating point semantic modes should be handled in clang. A lot of this information will be relevant to other front ends, but the details are necessarily bound to a front end implementation so I'm framing the discussion here in terms of clang. Other front ends can choose to follow clang or not. The existence of this set

Dear Tarun, Swarup Sahoo and I wrote some LLVM passes for dynamic slicing for LLVM 2.6. I believe we had planned to make the code publicly available as part of the Giri project (http://llvm.org/viewvc/llvm-project/giri/trunk), but due to other commitments, we have not moved the code into that SVN repository yet. Let me check with Vikram and Swarup to see about getting a copy of the code to you.