search for: kubakuderski

...from new version of LLVM IR. How do you think about this? At last, we also do not support exception handling:) Thanks. Hongbin On Tue, Aug 2, 2016 at 7:26 PM, Stephen Hines <srhines at google.com> wrote: > Hi Hongbin, > > On Tue, Aug 2, 2016 at 5:42 PM, Jakub Kuderski < > kubakuderski+llvm at gmail.com> wrote: > >> I also have a look at the code, looks like it directly parse the bitcode >>> and build in memory representation in a different LLVM version than the >>> bitcode. Is this correct? >> >> According to your description, I guess th...

...t last, we also do not support exception handling:) > > > Thanks. > Hongbin > > On Tue, Aug 2, 2016 at 7:26 PM, Stephen Hines <srhines at google.com <mailto:srhines at google.com>> wrote: > Hi Hongbin, > > On Tue, Aug 2, 2016 at 5:42 PM, Jakub Kuderski <kubakuderski+llvm at gmail.com <mailto:kubakuderski+llvm at gmail.com>> wrote: > I also have a look at the code, looks like it directly parse the bitcode and build in memory representation in a different LLVM version than the bitcode. Is this correct? > According to your description, I guess the...

...e the > one to do the bitcode version downgrade, right? > > Does this took work on LLVM 3.9svn? > > And could you give some hints about how you test the bitcode translator? > > Thanks > Hongbin > > > > > On Tue, Aug 2, 2016 at 3:25 PM, Jakub Kuderski < > kubakuderski+llvm at gmail.com> wrote: > >> I'm not sure if it was intended, but I think that you responded only to >> me (not to the list). >> >> Anyway, RenderScript currently uses llvm 3.2 IR as binary >> representation/exchangeable format, but the llvm version is high...

> > but doesn't emit optnone and nounwind attributes > s/nounwind/noinline On Mon, Jan 28, 2019 at 11:35 AM Jakub (Kuba) Kuderski < kubakuderski at gmail.com> wrote: > As far as I understand, gllvm doesn't run LTO pipeline or any cross-module > optimization, and the optimization level provided is only used to compile > each Translation Unit separately. > If you want to have LTO-like build, you can first run gllvm with `-...

...tion handling:) >> >> >> Thanks. >> Hongbin >> >> On Tue, Aug 2, 2016 at 7:26 PM, Stephen Hines <srhines at google.com <mailto:srhines at google.com>> wrote: >> Hi Hongbin, >> >> On Tue, Aug 2, 2016 at 5:42 PM, Jakub Kuderski <kubakuderski+llvm at gmail.com <mailto:kubakuderski+llvm at gmail.com>> wrote: >> I also have a look at the code, looks like it directly parse the bitcode and build in memory representation in a different LLVM version than the bitcode. Is this correct? >> According to your description, I g...

Hi mailing list, I has been working on a large project that is based on LLVM 3.1. Recently we are thinking to introduce an LLVM bc converter from LLVM 3.9 to LLVM 3.1, such that we can introduce some of the newest LLVM analyses and optimizations to our LLVM 3.1 based project. Have you worked on similar things that converting LLVM bc downward and has anything to share? Thanks Hongbin

Hello, I was wondering whether or not some behaviour that I am seeing is expected behaviour and that it has been designed like this, or not. A dominator relation is given by "if A dominates B", then all paths to B go through A. For example, take the CFG below (which is a directed graph (couldn’t make the arrow heads but ok.): A / \ B C \ / D | E We can construct

...>>>> >>>> On Tue, Aug 2, 2016 at 7:26 PM, Stephen Hines <srhines at google.com> >>>> wrote: >>>> >>>>> Hi Hongbin, >>>>> >>>>> On Tue, Aug 2, 2016 at 5:42 PM, Jakub Kuderski < >>>>> kubakuderski+llvm at gmail.com> wrote: >>>>> >>>>>> I also have a look at the code, looks like it directly parse the >>>>>>> bitcode and build in memory representation in a different LLVM version than >>>>>>> the bitcode. Is this corr...

...Kuba, Thanks for your feedback. I have made some improvements on the proposal according to your feedback and clarify something on the time availability. I left comments on the questions you asked in the doc. Please check it out. Thanks, Chijun 2018-03-22 10:37 GMT+08:00 Jakub (Kuba) Kuderski <kubakuderski at gmail.com>: > Hi Chijun, > > I left you my feedback in the doc (+ some nitpicks). Overall, it looks very > solid and shows you understand the problem well and know what to expect. > Your proposed timeline is reasonable and I don't see any major things to > improve there....

Hi Jakub! On Mon, 17 Jun 2019 at 17:01, Jakub (Kuba) Kuderski <kubakuderski at gmail.com> wrote: > Hi Kristóf, > > >> 1. I read the article IDFCalculator is based on[1], but I found no >> references to IDFCalculator::setLiveInBlocks, and the file header seems to >> confirm that it's an implementation specific thing. Could I get away >&...

...<char> > > > const&, > char const* const*) + 1159 > 6 lli 0x0000000104b94b84 main + 9104 > 7 libdyld.dylib 0x00007fff7d3cc015 start + 1 > Segmentation fault: 11 > > On Mon, Jan 28, 2019 at 10:40 AM Jakub (Kuba) Kuderski > <kubakuderski at gmail.com> wrote: > >> > >> but doesn't emit optnone and nounwind attributes > > > > s/nounwind/noinline > > > > On Mon, Jan 28, 2019 at 11:35 AM Jakub (Kuba) Kuderski < > kubakuderski at gmail.com> wrote: > >> > >> As f...

...n. I will appreciate it if you can give me some advice on the proposal. This draft can be viewed by the organization. (If you do not have access, please mail me, and I will give you the link.) I am looking forward to your reply. Regards, Chijun 2018-03-15 1:42 GMT+08:00 Jakub (Kuba) Kuderski <kubakuderski at gmail.com>: > Hi Chijun, > > Great, seems like you did a lot of progress and understand the issues quite > well! > >> I have done some early sketch on the API of the new updater class. >> From my current understanding, to solve the fragmentation problem of >>...

...some advice on the proposal. This draft can be viewed by > the organization. (If you do not have access, please mail me, and I > will give you the link.) > > I am looking forward to your reply. > > Regards, > Chijun > > 2018-03-15 1:42 GMT+08:00 Jakub (Kuba) Kuderski <kubakuderski at gmail.com>: > > Hi Chijun, > > > > Great, seems like you did a lot of progress and understand the issues > quite > > well! > > > >> I have done some early sketch on the API of the new updater class. > >> From my current understanding, to solv...

Hi folks, For the past month I’ve been working on improving the DominatorTree and PostDominatorTree in LLVM. The RFC that explains the motivations and plans can be found here: http://lists.llvm.org/pipermail/llvm-dev/2017-June/114045.html . Here’s a short summary of what changed upstream since posting it: - We switched from the Simple Lengauer-Tarjan algorithm for computing dominators

...mething about the way to prune redundant PostDomTree updates. I am looking forward to your reply. Regards, Chijun Sima [1] https://reviews.llvm.org/D41302?id=127155#inline-361616 [2] https://llvm.org/OpenProjects.html#llvm_domtree_updater 2018-03-02 11:57 GMT+08:00 Jakub (Kuba) Kuderski <kubakuderski at gmail.com>: > Hi Chijun, > > Thanks for your interest in the project. > >> I have gone through most of the LLVM Kaleidoscope tutorial and I have >> watched the video of the presentation “Dominator Trees and incremental >> updates that transcend time” presented on...

...> > I am looking forward to your reply. > > > Regards, > > Chijun Sima > > > [1] https://reviews.llvm.org/D41302?id=127155#inline-361616 > > [2] https://llvm.org/OpenProjects.html#llvm_domtree_updater > > 2018-03-02 11:57 GMT+08:00 Jakub (Kuba) Kuderski <kubakuderski at gmail.com>: > > Hi Chijun, > > > > Thanks for your interest in the project. > > > >> I have gone through most of the LLVM Kaleidoscope tutorial and I have > >> watched the video of the presentation “Dominator Trees and incremental > >> update...

This works great. > You can also try using the gllvm wrapper: https://github.com/SRI-CSL/gllvm ; it's quite reliable and easy to use in my experience. Just to be sure. Only one version of bc file will be generated that corresponds to the compiler options provide at configure? The original approach using ld.gold will provide several .bc files that correspond to different stages of the

...*RFC: C++ Devirtualization v2Piotr Padlewski - piotr.padlewski at gmail.com <piotr.padlewski at gmail.com>Krzysztof Pszeniczny - krzysztof.pszeniczny at gmail.com <krzysztof.pszeniczny at gmail.com>Jakub Kuderski - kubakuderski at gmail.com <kubakuderski at gmail.com>Richard Smith - RichardSmith at google.com <RichardSmith at google.com>This proposal describes a new model of representing pointers to dynamic objects as “fat pointers”. It is designed to solve the hole in the previous devirtualization model that...

Hi Jakub, On Tue, Jul 7, 2020 at 6:25 AM Jakub (Kuba) Kuderski <kubakuderski at gmail.com> wrote: > There's a lot of heavily templated code in generic DomTee construction/updater, MemSSA updater, and GraphDiff that has become really hard to modify. For the context, Alina (cc'd) was recently looking into making the domtree code work with 'CFG views'; th...

Hi, I am using LLVM 3.6.1 to test the following code: #include <omp.h> #include <stdio.h> #include <stdlib.h> int main() { int tid, nthreads; #pragma omp parallel sections private(nthreads, tid) { #pragma omp section { tid = omp_get_thread_num(); printf("Hello, tid = %d\n ", tid); } #pragma omp section { tid = omp_get_thread_num();