similar to: [LLVMdev] [RFC] Iterrative compilation framework for Clang/LLVM

Hal, Thank you for finding interest in our work! Please find my answers inlined below. > > ________________________________________ > From: Hal Finkel [hfinkel at anl.gov] > Sent: Monday, December 16, 2013 4:26 PM > To: Radovan Obradovic > Cc: llvmdev at cs.uiuc.edu; chandlerc; Andrew Trick > Subject: Re: [LLVMdev] [RFC] Iterrative compilation framework for Clang/LLVM >

Radovan, Thanks for posting this! I would really like to have this kind of functionality available. There are a lot of things to think through here; comments inline... ----- Original Message ----- > From: "Radovan Obradovic" <Radovan.Obradovic at imgtec.com> > To: llvmdev at cs.uiuc.edu > Sent: Monday, December 16, 2013 11:31:21 AM > Subject: [LLVMdev] [RFC]

Hi Radovan, I am also interested in the iterative compilation in LLVM, and had implemented a simple iterative compilation driver. I guess you do not need to embedded the pointer to ModuleDecisionTreeProxies into the core classes of llvm, i.e. the PassManager class and the Function class. Instead, you could: 1. Implement a special pass manager that runs a set of passes iteratively. Implementing

On Dec 16, 2013, at 4:26 PM, Hal Finkel <hfinkel at anl.gov> wrote: >> At the end of each iteration, quality of generated code is estimated >> by >> executing newly introduced target dependent pass. Based on results >> path for >> the following iteration is calculated. At the moment, this has been >> proved >> for MIPS only and it is based on code

On Jul 6, 2010, at 10:09 AM, Manuel Llosa wrote: > Dear Kenneth, May I ask you if you are implementing your search within > ctuning framework: ctuning.org/ctuning-cc? No, I'm not. I've built my own framework, and since I don't have any experience with the ctuning framework, I don't intend to start using that. There's little gain in it for me. > The thing is that I

Hello LLVMers, I'm putting together some (extensive) experiments with using a genetic algorithm to construct sets of optimization passes that are as close as optimal in a number of ways, e.g. compilation time, execution time, code size, ... I've figured out which LLVM tools I should use for this (llvm-gcc to obtain bitcode, opt to optimize, llc to obtain assembly, ...), and I'm now

On Jul 6, 2010, at 5:04 PM, Manuel Llosa wrote: > Dear Kenneth, I see. Do you plan sharing your framework in open source? > For now, I will continue using ctuning tools (they support LLVM as is but not > some specific things on JIT dynamic recompilation what is my thesis about). > I will like to compare all tools of course and will be happy > to share results although real not

Dear Kenneth, I see. Do you plan sharing your framework in open source? For now, I will continue using ctuning tools (they support LLVM as is but not some specific things on JIT dynamic recompilation what is my thesis about). I will like to compare all tools of course and will be happy to share results although real not until autumn).Look forward to your results and hopefully keep in touch.

Another alternative could be: ORE.emitMissed(DEBUG_TYPE, ...) << ... Then the first line of emitMissed does a check if it is enabled and if not then returns a dummy stream that does nothing for operator<< (and short-circuits all the stream operations) On Sep 15, 2017 2:21 PM, "Adam Nemet via llvm-dev" <llvm-dev at lists.llvm.org> wrote: For better readability we

Hi, I am working on my diploma thesis "Consideration of Virtual Machines Suitability for Packet Decoding". One of VMs I am testing is LLVM. Currently I have a filter written in LLVM IR which consist of 3 modules: filter, decoder and filter_rule. The last one is generated using my own-written compiler. I`d like to ask if there is a possibility to generate filter_rule, then link

Dear Kenneth, May I ask you if you are implementing your search within ctuning framework: ctuning.org/ctuning-cc? The thing is that I use it since some time for my thesis to optimize code size and compilation time and run time with GCC though they are not using genetic algorithms but some slower hybrid of random exploration and than AI with some fronteer detection. Since recent version can be

First of all thanks for fast replay. I appreciated it:-) > Is your compiler written in C++ or something that can interface with > it easily? If so, you should probably check out the JIT, and the > tutorial here: Yes my compiler is written in C++ and I had followed tutorial you mentioned. > It sounds like you're generating LLVM IL and dumping it to a .ll file > in your own

Hi, I’m looking at RegBankSelect’s partially implemented support for deciding to split a value between multiple registers and I’m wondering if it’s actually intended to solve the problem I’m trying to use it for. RegisterBankInfo.h has this example mapping table: /// E.g., /// Let say we have a 32-bit add and a <2 x 32-bit> vadd. We /// can expand the /// <2 x 32-bit> add into

> On Sep 16, 2017, at 4:49 PM, Sean Silva <chisophugis at gmail.com> wrote: > > Actually maybe something like: > > if (auto &E = ORE.emitMissed(DEBUG_TYPE)) { > E.emit(...) << ...; > } Well, the point of this interface was exactly to avoid writing a conditional. If you’re willing to use a conditional you can already write this: if

Is your compiler written in C++ or something that can interface with it easily? If so, you should probably check out the JIT, and the tutorial here: http://llvm.org/docs/tutorial/ In particular, this bit is relevant to using a JIT: http://llvm.org/docs/tutorial/LangImpl4.html#jit It sounds like you're generating LLVM IL and dumping it to a .ll file in your own compiler, so you'll

Tobias Grosser wrote: > The way to go is the scoplib format (propably extended by quantified > variables). This format could be extracted from graphite easily and > could also be created in LLVM. > What we need to get back into LLVM is only the new optimized schedule > described e.g. as cloog like scattering functions. These can be parsed > easily. The real code generation

hello i would like to set premission for share like this: user can: -create new file -read file user cant: -delete file -modify file is it posible? i really dont know how to do it, but i relly need it. ..and another thing if i set create mask = 0740 and force user = root why can another user still delete this file, although root is the owner with 740 mask can someone help? bye bye rado.

Sean, hopefully you’re OK with that reasoning. I went ahead and committed this in r313691. > On Sep 16, 2017, at 10:43 PM, Adam Nemet <anemet at apple.com> wrote: > > >> On Sep 16, 2017, at 4:49 PM, Sean Silva <chisophugis at gmail.com <mailto:chisophugis at gmail.com>> wrote: >> >> Actually maybe something like: >> >> if (auto &E

Hi all, I am rather new to xapian, I just recently tried to include it in my application, so bear with me if this has already been discussed. I was playing with QueryParser and noticed that it expects input to be in ISO8859_1 encoding - characters above 0x80 are transliterated, and are not considered letters. For example, using single word (in utf-8 encoding) "bo?e" as input for

On 12/27/09 10:18, ether wrote: > hi Tobi , > > that sounds greate :D > > On 2009-12-27 5:43, Tobias Grosser wrote: >> I already looked into implementing something like Graphite for LLVM. >> However just recently, so I have not released any code yet. As soon as >> some code is available I will post patches. > whats its status? do you need any help? Very