search for: zhendong

...://tinyurl.com/zs2826l>, link5 <https://tinyurl.com/yb7okzqd>), LLVM ( link1 <http://tinyurl.com/qj8x5ry>, link2 <http://tinyurl.com/nc9celr>, link3 <http://tinyurl.com/qy58smb>, link4 <http://tinyurl.com/z7y8rwo>, link5 <https://tinyurl.com/y7wdf5b4>)] Best, Zhendong -------- Zhendong Su Professor, Department of Computer Science, ETH Zurich Office: CAB E 64.1, Tel: +41 44 633 77 72 https://people.inf.ethz.ch/suz/ -------- On Fri, Dec 7, 2018 at 7:42 PM Vedant Kumar <vsk at apple.com> wrote: > Hello, > > + Zhendong, who’s done a lot of work on...

...iler, and regularly finds > regressions and occasional deep long lurking issues.  We don't > have a public bug tracker for this, but a sizable portion of our > upstream bug fixing activity is driven by the output of this tool. > > Philip > > On 12/7/18 11:04 AM, Zhendong Su via llvm-dev wrote: >> Thanks, Vedant.  Yes, we have done a lot of testing of Clang/LLVM >> (and GCC) in the past several years (more details at >> https://people.inf.ethz.ch/suz/emi/index.html): >> >> [GCC/LLVM bugs: *1,602* (total) / *1,007* (fixed)] >> [R...

...1807: enc_frame_size = st->Fs/50; … In the above code, Line 1802 and 1803 may be not useful. Because the result of variable ‘enc_frame_size’ is not read and used. After executing Line 1805 or Line 1807, the value of ‘enc_frame_size’ is overwritten. Looking forward to your reply. Best, Zhendong -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.xiph.org/pipermail/opus/attachments/20161205/6e3b0bc6/attachment.html>

...overflow might happen. Well, there are many other applications. In short, I would like to know if the LLVM community would be interested in such a project. I have been working on this for two months, and I am pretty confident I can implement a good range analysis. I am basing my work on a paper by Zhendong and Wagner: "A class of polynomially solvable range constraints for interval analysis without widenings". I have opted for this work, instead of Stephenson's more well known paper because I found Zhendong's easier to understand and implement. As I told you, I can already infer cor...

...ip] > Well, there are many other applications. In short, I would like to know if > the LLVM community would be interested in such a project. I have been > working on this for two months, and I am pretty confident I can implement > a good range analysis. I am basing my work on a paper by Zhendong and > Wagner: "A class of polynomially solvable range constraints for interval > analysis without widenings". I have opted for this work, instead of > Stephenson's more well known paper because I found Zhendong's easier to > understand and implement. As I told you, I c...

For what it's worth, I just ran this on PowerPC and a double bootstrap with lit and lnt tests passes everything. On Sun, Jun 11, 2017 at 12:38 AM, Zhendong Su via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Sure, we are happy to start some testing to see what we may help find. > > On Sat, Jun 10, 2017 at 3:36 PM, Daniel Berlin <dberlin at dberlin.org> > wrote: > >> +1 >> If possible, it definitely helps to f...

Hello everyone! We are working on writing a paper about testing the reliability of C compilers by using Csmith (a random C99 program generator). A previous testing effort, using Csmith, found 202 LLVM bugs, which represented 2% of all reported bugs at that time (PDF: https://www.flux.utah.edu/download?uid=114 <https://www.flux.utah.edu/download?uid=114>): . However, after this paper was

...v at lists.llvm.org> wrote: >> For what it's worth, I just ran this on PowerPC and a double bootstrap with >> lit and lnt tests passes everything. >> > I fixed the only bug that has been reported (there were others, but > turned out to be issues in other passes). > Zhendong, did you find anything else? If not, maybe let's wait another > week to give people another chance to test and then decide whether > to flip the switch. > > -- > Davide > _______________________________________________ > LLVM Developers mailing list > llvm-dev at lists.l...

+1 If possible, it definitely helps to fuzz it. On Sat, Jun 10, 2017 at 2:45 PM, Davide Italiano via llvm-dev < llvm-dev at lists.llvm.org> wrote: > On Sat, Jun 10, 2017 at 8:21 AM, Geoff Berry via llvm-dev > <llvm-dev at lists.llvm.org> wrote: > > Hi All, > > > > I'd like to switch the function simplification run of EarlyCSE to use > > MemorySSA by

...or what it's worth, I just ran this on PowerPC and a double bootstrap with >>>> lit and lnt tests passes everything. >>>> >>> I fixed the only bug that has been reported (there were others, but >>> turned out to be issues in other passes). >>> Zhendong, did you find anything else? If not, maybe let's wait another >>> week to give people another chance to test and then decide whether >>> to flip the switch. >>> >>> -- >>> Davide >>> _______________________________________________ >>...

...14, 2017 at 11:05 AM, John Regehr via llvm-dev <llvm-dev at lists.llvm.org> wrote: > These are definitely LLVM bugs. It would be best to report reduced test > cases against top of tree. > > We should have some automated infrastructure for finding these too... > > John > Zhendong & friends generally do that (and reported many bugs :) I tried that myself, but never got to automate the whole procedure. While the problem is combinatorial in nature, evidence shows that you don't need to enumerate all the possible combination of passes to break LLVM. I think an `opt` opt...

On Thu, Jul 6, 2017 at 7:00 AM, Davide Italiano <davide at freebsd.org> wrote: > On Wed, Jul 5, 2017 at 3:59 PM, Johan Engelen via llvm-dev > <llvm-dev at lists.llvm.org> wrote: > > Hi all, > > I just found an optimization regression regarding simple > > dataflow/constprop analysis: > > https://godbolt.org/g/Uz8P7t > > > > This code >

...d pass. Stephenson would assume, > for instance, that when we read an array position, we are inside the > boundaries of the array, and would use this to improve the precision > of his analysis. Of course, he assumes that the program is correct, > and you only read valid array positions. Zhendong does not make this > assumption. > The analysis is flow sensitive, because it relies on the SSI > framework that Andre Tavares has implemented onto LLVM. And it is sparse, in the sense that it maps variables, e.g Values, to ranges. So, like Nuno had already suggested, the interface woul...

...0/tools/lld/docs/ReleaseNotes.html Thanks to everyone who helped with filing, fixing and doing code review for release blocking bugs. Special thanks to the release testers and packagers: Dimitry Andric, Renato Golin, Vasileios Kalintiris, Diana Picus, Ben Pope and Nikola Smiljanic. Also thanks to Zhendong Su whose fuzz testing prevented many bugs going into this release. For questions or comments about this release, please contact the community on the mailing lists. Onward to 4.0! Cheers, Hans

...nks to everyone who helped with filing, fixing and code reviewing for release blocking bugs. Special thanks to the release testers and packagers: Ben Pope, Bernhard Rosenkränzer, Diana Picus, Dimitry Andric, Mehdi Amini, Michał Górny, Renato Golin, Simon Dardis, and Sylvestre Ledru. Also thanks to Zhendong Su and his team whose fuzz testing prevented many bugs going into the release. For questions or comments about this release, please contact the community on the mailing lists. Onwards to LLVM 5! Cheers, Hans

...0/tools/lld/docs/ReleaseNotes.html Thanks to everyone who helped with filing, fixing and doing code review for release blocking bugs. Special thanks to the release testers and packagers: Dimitry Andric, Renato Golin, Vasileios Kalintiris, Diana Picus, Ben Pope and Nikola Smiljanic. Also thanks to Zhendong Su whose fuzz testing prevented many bugs going into this release. For questions or comments about this release, please contact the community on the mailing lists. Onward to 4.0! Cheers, Hans

...nks to everyone who helped with filing, fixing and code reviewing for release blocking bugs. Special thanks to the release testers and packagers: Ben Pope, Bernhard Rosenkränzer, Diana Picus, Dimitry Andric, Mehdi Amini, Michał Górny, Renato Golin, Simon Dardis, and Sylvestre Ledru. Also thanks to Zhendong Su and his team whose fuzz testing prevented many bugs going into the release. For questions or comments about this release, please contact the community on the mailing lists. Onwards to LLVM 5! Cheers, Hans

Hi, I'm trying to autotune a good sequence of IR optimization passes and I seem to run into segfaults in opt (in LLVM5) with certain pass orderings. Is this expected behavior? If so, what would be the recommended way of determining pass dependencies so that I can encode them into the tuner? The test program can be found here: https://gist.github.com/kavon/92d153cdd54ce9b77162af3af47d4c95

Already added in the commit (I think) On Fri, Jun 30, 2017 at 3:58 PM Hans Wennborg <hans at chromium.org> wrote: > On Thu, Jun 29, 2017 at 3:42 PM, Chandler Carruth via cfe-dev > <cfe-dev at lists.llvm.org> wrote: > > If you don't use BBVectorize at all, you can ignore this. > > > > Hal suggested this in a thread in 2014: > >

...ated-propagation) currently doesn't > catch that, but a more powerful analysis does (and it's faster on > large testcases & has an interprocedural version, the code is on > github). > http://homepages.dcc.ufmg.br/~raphael/papers/CGO13.pdf [and the predecessor > paper from Zhendong Su, circa 2004 IIRC, I don't have a link handy sorry :)] > > [I just put a 10 lines intraprocedural/interprocedural client on top > of it that prints the found ranges > https://github.com/dcci/range-analysis/commit/f9677dfd032f811ed545977690f8d7aead7cccaa] > > Thanks, > &gt...